# US 11,444,776 B2 · Blockchain with daisy chained records, document corral, quarantine, message timestamping, and self-addressing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 11,444,776 B2
- Document ID: US11444776B2
- Status: Granted
- Kind: B2
- Application number: 16/848,759
- Filed: 2020-04-14
- Published: 2020-07-30
- Granted: 2022-09-13
- Earliest claimed: 2019-05-01
- Applicants: Kelce S. Wilson
- Inventors: Kelce S. Wilson
- Web page: https://patentgrep.com/patent/US11444776B2

## CPC

- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]}
- H04L 9/3297: {involving time stamps, e.g. generation of time stamps}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Permissioned blockchains with off-chain storage establish integrity and no-later-than date-of-existence for documents, leveraging records containing hash values of documents. When a document's integrity or date is challenged, a new hash value is compared with a record in the blockchain. Proving date-of-existence (via hash value in a publication and/or SMS) for the block containing the record establishes no-later-than date-of-existence for the document. Permissioning monetizes operations, enforcing rules for submission rights and content, thereby precluding problematic material (privacy, obscenity, malicious logic, copyright violations) that threatens long-term viability. Compact records and off-chain storage in a document corral (with quarantine capability) preserve document confidentiality and ease storage burdens for distributed blockchain copies. Using multiple hash values for each document hardens against preimage attacks with quantum computing. Daisy chaining records establishes that relationships existed among documents at registration. Self-addressed blockchain registration (SABRe) permits documents to self-identify their blockchain record address (block ID, index).

## Claims

### Claim 1

A method of using a blockchain to generate evidence for proving document integrity, the method executable by a processor, the method comprising:
reserving a blockchain address in a first block for a first record for a document;
entering the blockchain address into a copy of the document;
generating, for the document, the first record in a first format, the first format comprising:
an integrity verification code (IVC) field comprising an IVC portion; and
a linked record locator field;
wherein the first record comprises:
a first IVC value in the IVC portion of the first record, wherein the first IVC value is for the copy of the document having the blockchain address entered therein; and
a linked record value in the linked record locator field of the first record, wherein the linked record value indicates a blockchain address of a second record, different than the first record, wherein the blockchain address of the second record indicates a location of the second record within the blockchain, wherein the location of the second record is within a second block that is prior to the first block in the blockchain, wherein the linked record value includes a block identifier of the second block, and wherein the linked record locator field does not link blocks of the first blockchain; and
generating, in the blockchain, a first block comprising the first record, wherein the first block is chained to a prior block in the blockchain using a second IVC value.

### Claim 2

A method of using a first blockchain to generate evidence for proving document integrity, the method executable by a processor, the method comprising:
reserving a blockchain address in a first block for a first record for a document; entering the blockchain address into a copy of the document;
generating, for the document, the first record in a first format, the first format comprising:
an integrity verification code (IVC) field comprising a first IVC portion; and a linked record locator field;
wherein the first record comprises:
a first IVC value in the first IVC portion of the first record; and
a first linked record value in the linked record locator field of the first record; and generating, in the first blockchain, the first block comprising the first record,
wherein the first linked record value indicates a location of a blockchain address of a second record, different than the first record, wherein the blockchain address of the second record indicates a location of the second record within the blockchain, wherein the location of the second record is within a second block that is prior to the first block in the first blockchain, wherein the first linked record value includes a block identifier of the second block, and wherein the linked record locator field does not link blocks of the first blockchain.

### Claim 3 (depends on 2)

The method of claim 2
wherein the IVC field further comprises a second IVC portion,
wherein the first record further comprises a second IVC value in the second IVC portion,
wherein the second IVC value represents a same document as the first IVC value, and
wherein the second IVC value represents an output of a different integrity verification function than the first IVC value.

### Claim 4 (depends on 3)

The method of claim 3 further comprising:
generating the second record in the first format;
wherein the second record comprises:
a third IVC value in the first IVC portion of the second record; and
a fourth linked record value in the linked record locator field of the second record, wherein the fourth linked record value indicates a location of a fifth record in the first blockchain, thereby linking the first record with the fifth record in a daisy chain.

### Claim 5 (depends on 4)

The method of claim 4 wherein the first linked record value comprises at least a portion of the third IVC value.

### Claim 6 (depends on 2)

The method of claim 2 wherein the first IVC value comprises at least a portion of a Secure Hash Algorithm (SHA) message digest, and wherein the SHA message digest is generated by at least one function selected from the list consisting of:
SHA-1, SHA-224, SHA-256, SHA-384, and SHA-512.

### Claim 7 (depends on 2)

The method of claim 2 wherein the first format further comprises a timestamp field, wherein the first record further comprises a timestamp value in the timestamp field.

### Claim 8 (depends on 2)

The method of claim 2 wherein the first format further comprises a generator version field, and wherein the first record further comprises generator version information in the generator version field.

### Claim 9 (depends on 2)

The method of claim 2 wherein the first format has a fixed number of bytes.

### Claim 10 (depends on 9)

The method of claim 9 wherein the first format is 256 bytes long.

### Claim 11 (depends on 2)

The method of claim 2 wherein the location of the second record is within a second block that is prior to the first block in the first blockchain.

### Claim 12 (depends on 11)

The method of claim 11 wherein the first linked record value includes a block identifier of the second block.

### Claim 13 (depends on 2)

The method of claim 2 wherein the first record further comprises:
a second linked record value in the linked record locator field of the first record, wherein the second linked record value indicates a location of a third record.

### Claim 14 (depends on 13)

The method of claim 13 wherein the location of the third record is within the first blockchain.

### Claim 15 (depends on 13)

The method of claim 13 wherein the location of the third record is within a second blockchain.

### Claim 16 (depends on 13)

The method of claim 13 wherein the first record further comprises:
a third linked record value in the linked record locator field of the first record, wherein the third linked record value indicates a location of a fourth record.

### Claim 17 (depends on 2)

The method of claim 2 wherein the first format further comprises an index field, and wherein the first record further comprises a first index value in the index field of the first record.

### Claim 18 (depends on 17)

The method of claim 17 wherein the second record further comprises a second index value in the index field of the second record.

### Claim 19 (depends on 18)

The method of claim 18 wherein the first linked record value comprises at least a portion of the second index value.

### Claim 20 (depends on 17)

The method of claim 17 wherein the first linked record value comprises a blockchain address.

### Claim 21

One or more computer storage devices having computer-executable instructions stored thereon for using a blockchain to generate evidence for proving document integrity, which, on execution by a computer, cause the computer to perform operations comprising:
reserving a blockchain address for a first record for a document; entering the blockchain address into a copy of the document;
generating, for the document, the first record in a first format, the first format having a fixed number of bytes and comprising:
an integrity verification code (IVC) field comprising an IVC portion;
an index field; and
a linked record locator field;
wherein the first record comprises:
a first IVC value in the IVC portion of the first record;
a first index value in the index field of the first record;
a first linked record value in the linked record locator field of the first record; and
a second linked record value in the linked record locator field of the first record; and
generating a second record in the first format, wherein the second record comprises:
a second IVC value in the IVC portion of the second record, wherein the first and second IVC values each comprises at least a portion of a Secure Hash Algorithm (SHA) message digest; and a second index value in the index field of the second record;
a third linked record value in the linked record locator field of the second record;
a fourth linked record value in the linked record locator field of the second record; generating, in the blockchain, a first block comprising the first record;
generating, in the blockchain, a second block comprising the second record, wherein the first linked record value indicates a blockchain address of the second record in the blockchain, wherein the second block appears prior to the first block in the blockchain;
generating, in the blockchain, a third block comprising a third record, wherein the third block appears prior to the first block in the blockchain, wherein the second linked record value indicates a blockchain address of the third record in the blockchain, wherein the third linked record value indicates a location of a fourth record in the blockchain and the fourth linked record value indicates a location of a fifth record in the blockchain, thereby linking the first record with the second record, the third record, the fourth record, and the fifth record in a daisy chain, and wherein each blockchain address indicates at least a block and an index value of a linked record, and wherein the linked record locator field does not link blocks of the first blockchain.
