# US 2025/0097058 A1 · System and method for creating and maintaining immutability, agreement and availability of data

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

- Number: US 2025/0097058 A1
- Document ID: US20250097058A1
- Status: Published application
- Kind: A1
- Application number: 18/961,321
- Filed: 2024-11-26
- Published: 2025-03-20
- Earliest claimed: 2021-12-06
- Assignees: Blocky, Inc.
- Applicants: Blocky, Inc.
- Inventors: Taylor Heinecke; David L. Millman; Mike P. Wittie
- Web page: https://patentgrep.com/patent/US20250097058A1

## CPC

- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 9/0618: {Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation}
- H04L 9/3247: {involving digital signatures}
- H04L 9/3263: {involving certificates, e.g. public key certificate [PKC] or attribute certificate [AC]; Public key infrastructure [PKI] arrangements (network architectures or network communication protocols for supporting authentication of entities using certificates in a packet data network H04L63/0823)}
- H04L 9/3297: {involving time stamps, e.g. generation of time stamps}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems, methods, and non-transitory computing devices for maintaining immutability. Some methods include creating, by a processor, an alternating structure of a plurality of blocks and a first plurality of timestamp attestations, wherein a first subset of blocks of the plurality of blocks includes a link to at least one of the first plurality of timestamp attestations of at least one preceding block of the plurality of blocks. Creating the alternating structure further includes constructing a first data structure including a first set of ordered transactions and creating a first block of the plurality of blocks including a linking root of the first data structure. Creating the alternating structure further includes creating a first timestamp attestation over the first block. The method further includes determining an order of the plurality of blocks corresponding with at least one chain, determining a set of blocks of the plurality of blocks and replicating.

## Claims

### Claim 1

A method, comprising:
creating, by a processor, an alternating structure of a plurality of blocks and a first plurality of timestamp attestations, wherein a first subset of blocks of the plurality of blocks comprises a link to at least one of the first plurality of timestamp attestations of at least one preceding block of the plurality of blocks, wherein creating the alternating structure further comprises:
constructing a first data structure comprising a first set of ordered transactions corresponding to the plurality of blocks;
creating a first block of the plurality of blocks comprising a cryptographically linking root of the first data structure; and
creating a first timestamp attestation over the first block;
determining, by the processor, an order of the plurality of blocks corresponding with at least one chain;
determining, by the processor, a set of blocks of the plurality of blocks on the at least one chain; and
replicating, by the processor, the plurality of blocks, the first plurality of timestamp attestations, and the first set of ordered transactions.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first block corresponds to a second subset of blocks of the plurality of blocks, and wherein creating the alternating structure further comprises:
constructing, by the processor, a second data structure comprising a second set of ordered transactions corresponding to the plurality of blocks;
creating, by the processor, a second block of the plurality of blocks comprising a cryptographically linking root of the second data structure, wherein the second block corresponds to the second subset of blocks of the plurality of blocks;
linking, by the processor, the second block to the first timestamp attestation of the first block; and
creating, by the processor, a second timestamp attestation over the second block.

### Claim 3 (depends on 2)

The method of claim 2, wherein determining the order comprises:
assigning, by the processor, at least one sequence attestation of a first plurality of sequence attestations to each timestamp attestation of the first plurality of timestamp attestations.

### Claim 4 (depends on 2)

The method of claim 2, wherein the first data structure is a first Merkle tree comprising the first set of ordered transactions, and wherein the second data structure is a second Merkle tree comprising the second set of ordered transactions, and wherein the first timestamp attestation and the second timestamp attestation is created using a timestamp service.

### Claim 5 (depends on 4)

The method of claim 4, wherein the replicating of the plurality of blocks comprises using a replication service, and wherein replicating further comprises replicating the first set of ordered transactions of the first data structure and the second set of ordered transactions of the second data structure.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
repeating, by the processor, the constructing, creating, creating, constructing, creating, linking, and creating over a series of the plurality of blocks and the first plurality of timestamp attestations to create the alternating structure in which each block of the first subset of blocks is linked to at least one timestamp attestation of a preceding block of a plurality of preceding blocks.

### Claim 7 (depends on 1)

The method of claim 1, wherein determining the order of the plurality of blocks further comprises:
assigning, by the processor using a sequencer service, at least one sequence attestation of a first plurality of sequence attestations over each timestamp attestation of the first plurality of timestamp attestations, wherein each corresponding sequence attestation comprises a unique event identifier (ID) of a plurality of unique event IDs, wherein each unique event ID is assigned in a deterministic order; and
wherein each block of the first subset of blocks of the plurality of blocks corresponds to a height creating a total order of the plurality of blocks based on the height of each block of the first subset of blocks of the plurality of blocks and the corresponding sequence attestation assigned over each timestamp attestation.

### Claim 8 (depends on 1)

The method of claim 1, wherein determining the set of blocks on the at least one chain comprises:
validating, by the processor, a timestamp attestation of the first plurality of timestamp attestations over the first block of the plurality of blocks;
validating, by the processor, a sequence attestation of a first plurality of sequence attestations over the timestamp attestation over the first block; and
adding, by the processor, the first block and the timestamp attestation over the first block to the at least one chain.

### Claim 9 (depends on 8)

The method of claim 8, wherein:
the at least one chain comprises a last block of the plurality of blocks corresponds to a last sequence attestation, extending the at least one chain from the last block by:
finding, by the processor, a plurality of successor blocks of the last block, wherein each successor block of the plurality of successor blocks corresponds to a timestamp attestation of a second plurality of timestamp attestations, wherein each of the second plurality of timestamp attestations corresponds to the last block;
finding, by the processor, a sequence attestation of a second plurality of sequence attestations corresponding to at least one timestamp attestation of the second plurality of timestamp attestations;
identifying, by the processor, a successor block of the plurality of successor blocks of the corresponding sequence attestation being the lowest deterministic order than all other of the second plurality of sequence attestations of the plurality of successor blocks;
validating, by the processor, the corresponding timestamp attestation and validating of the corresponding sequence attestation of the successor block; and
adding, by the processor, to the at least one chain the successor block from the plurality of successor blocks having the lowest deterministic order and adding the corresponding timestamp attestation over the successor block with the lowest deterministic order sequence attestation.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
repeating, by the processor, the finding, identifying, validation, and adding over the set of blocks, the second plurality of timestamp attestations, wherein the first plurality of timestamp attestations comprise at least the second plurality of timestamp attestations.

### Claim 11 (depends on 9)

The method of claim 9, wherein adding to the at least one chain the successor block is further based on if the plurality of blocks with the second plurality of sequence attestations between the last sequence attestation of the last block on the at least one chain and the corresponding sequence attestation of the successor block with the lowest sequence attestation is found, and wherein the at least one chain further comprises at least one fork chain.

### Claim 12

A system, comprising:
a processor configured to:
create an alternating structure of a plurality of blocks and a first plurality of timestamp attestations, wherein a first subset of blocks of the plurality of blocks comprises a link to at least one of the first plurality of timestamp attestations of at least one preceding block of the plurality of blocks, wherein creating the alternating structure further comprises:
constructing a first data structure comprising a first set of ordered transactions corresponding to the plurality of blocks;
creating a first block of the plurality of blocks comprising a cryptographically linking root of the first data structure; and
creating a first timestamp attestation over the first block;
determine an order of the plurality of blocks corresponding with at least one chain;
determine a set of blocks of the plurality of blocks on the at least one chain; and
replicate the plurality of blocks, the first plurality of timestamp attestations, and the first set of ordered transactions.

### Claim 13 (depends on 12)

The system of claim 12, wherein the first block corresponds to a second subset of blocks of the plurality of blocks, and the processor configured to:
construct a second data structure comprising a second set of ordered transactions corresponding to the plurality of blocks;
create a second block of the plurality of blocks comprising a cryptographically linking root of the second data structure, wherein the second block corresponds to the second subset of blocks of the plurality of blocks;
link the second block to the first timestamp attestation of the first block; and
create a second timestamp attestation over the second block.

### Claim 14 (depends on 13)

The system of claim 13, the processor configured to, in determining the order:
assign at least one sequence attestation of a first plurality of sequence attestations to each timestamp attestation of the first plurality of timestamp attestations.

### Claim 15 (depends on 13)

The system of claim 13, wherein the first data structure is a first Merkle tree comprising the first set of ordered transactions, and wherein the second data structure is a second Merkle tree comprising the second set of ordered transactions, and wherein the first timestamp attestation and the second timestamp attestation is created using a timestamp service.

### Claim 16 (depends on 15)

The system of claim 15, wherein the replicating of the plurality of blocks comprises using a replication service, and wherein replicating further comprises replicating the first set of ordered transactions of the first data structure and the second set of ordered transactions of the second data structure.

### Claim 17 (depends on 16)

The system of claim 16, the processor further configured to:
repeat the constructing, creating, creating, constructing, creating, linking, and creating over a series of the plurality of blocks and the first plurality of timestamp attestations to create the alternating structure in which each block of the first subset of blocks is linked to at least one timestamp attestation of a preceding block of a plurality of preceding blocks.

### Claim 18 (depends on 12)

The system of claim 12, wherein determining the order of the plurality of blocks further comprises:
assigning, using a sequencer service, at least one sequence attestation of a first plurality of sequence attestations over each timestamp attestation of the first plurality of timestamp attestations, wherein each corresponding sequence attestation comprises a unique event identifier (ID) of a plurality of unique event IDs, wherein each unique event ID is assigned in a deterministic order;
wherein each block of the first subset of blocks of the plurality of blocks corresponds to a height creating a total order of the plurality of blocks based on the height of each block of the first subset of blocks of the plurality of blocks and the corresponding sequence attestation assigned over each timestamp attestation.

### Claim 19 (depends on 12)

The system of claim 12, wherein determining the set of blocks on the at least one chain comprises:
validating a timestamp attestation of the first plurality of timestamp attestations over the first block of the plurality of blocks;
validating a sequence attestation of the first plurality of sequence attestations over the timestamp attestation over the first block; and
adding the first block and the timestamp attestation over the first block to the at least one chain.

### Claim 20

A non-transitory computing device comprising a processor and memory coupled to the processor, the memory storing instructions that, when executed by the processor, causes the processor to:
create an alternating structure of a plurality of blocks and a first plurality of timestamp attestations, wherein a first subset of blocks of the plurality of blocks comprises a link to at least one of the first plurality of timestamp attestations of at least one preceding block of the plurality of blocks, wherein creating the alternating structure further comprises:
constructing a first data structure comprising a first set of ordered transactions corresponding to the plurality of blocks;
creating a first block of the plurality of blocks comprising a cryptographically linking root of the first data structure; and
creating a first timestamp attestation over the first block;
creating a first sequence attestation over the first timestamp attestation;
determine an order of the plurality of blocks corresponding with at least one chain;
determine a set of blocks of the plurality of blocks on the at least one chain; and
replicate the plurality of blocks, the first plurality of timestamp attestations, the first plurality of sequence attestations, and the first set of ordered transactions.
