- This section outlines the core concept utilized by the status list
- mechanism described in this document. At the most basic level, status
- information for all verifiable credentials issued by an issuer
- are expressed as simple binary values. The issuer keeps a bitstring
- list of all verifiable credentials it has issued. Each
- verifiable credential is associated with a position in the list. If
- the binary value of the position in the list is 1 (one), the
- verifiable credential is revoked, if it is 0 (zero) it is not revoked.
+This section outlines the core concept utilized by the status list
+mechanism described in this document. At the most basic level, status
+information for all verifiable credentials issued by an issuer
+are expressed as simple binary values. The issuer keeps a bitstring
+list of all verifiable credentials it has issued. Each
+verifiable credential is associated with a position in the list. If
+the binary value of the position in the list is 1 (one), the
+verifiable credential is revoked, if it is 0 (zero) it is not revoked.
- One of the benefits of using a bitstring is that it is a highly compressible
- data format since, in the average case, large numbers of credentials will
- remain unrevoked. This will ensure long sections of bits that are the same
- value and thus highly compressible using run-length compression techniques
- such as GZIP [[RFC1952]]. The default bitstring size is 16KB (131,072 entries),
- and when only a handful of verifiable credentials are revoked, the
- compressed bitstring size is reduced down to a few hundred bytes.
+One of the benefits of using a bitstring is that it is a highly compressible
+data format since, in the average case, large numbers of credentials will
+remain unrevoked. This will ensure long sections of bits that are the same
+value and thus highly compressible using run-length compression techniques
+such as GZIP [[RFC1952]]. The default bitstring size is 16KB (131,072 entries),
+and when only a handful of verifiable credentials are revoked, the
+compressed bitstring size is reduced down to a few hundred bytes.
- Another benefit of using a bitstring is that it enables large numbers of
- verifiable credential statuses to be placed in the same list.
- This specification utilizes a minimum bitstring length of 131,072 (16KB). This
- population size ensures an adequate amount of herd privacy in the average case.
- If better herd privacy is required, the bitstring can be made to be larger.
+Another benefit of using a bitstring is that it enables large numbers of
+verifiable credential statuses to be placed in the same list.
+This specification utilizes a minimum bitstring length of 131,072 (16KB). This
+population size ensures an adequate amount of herd privacy in the average case.
+If better herd privacy is required, the bitstring can be made to be larger.
-For example, if a bitstring is 131,072 bits in size (16KB), the first index will be 0, and the last index will be 131,071.
+For example, if a bitstring is 131,072 bits in size (16KB), the first index will
+be 0, and the last index will be 131,071.
Implementations SHOULD consume and/or assign indexes randomly.