# US 2021/0232547 A1 · Systems and methods of providing immutable records

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

- Number: US 2021/0232547 A1
- Document ID: US20210232547A1
- Status: Published application
- Kind: A1
- Application number: 17/011,279
- Filed: 2020-09-03
- Published: 2021-07-29
- Earliest claimed: 2017-09-08
- Assignees: Uledger, Inc.
- Applicants: ULedger, Inc.
- Inventors: Taulant Ramabaja
- Web page: https://patentgrep.com/patent/US20210232547A1

## CPC

- G06F 16/1805: {Append-only file systems, e.g. using logs or journals to store data}
- G06F 16/2365: {Ensuring data consistency and integrity}
- H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/3236: {using cryptographic hash functions}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- 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 63/123: {received data contents, e.g. message integrity}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2463/121: Timestamp
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems and methods of providing immutable records, and immutable ordering of records, in a computing system are disclosed. The computing system can be a member of a blockchain network of a plurality of blockchains. Each block can include a cryptographic digest (or hash) conforming to a minimum degree of difficulty, a nonce by which the cryptographic digest was generated in conformation with the degree of difficulty, and a list of cryptographic digests of most recent blocks of participating neighbor blockchains. Blocks may be passed between blockchains of the plurality of blockchains, which enables each member of the blockchain network to verify an immutable record of data transactions free of the mutual trust requirement of a typical blockchain environment. In conjunction with the generation of each block, an event record may be entered into an event log of the computing system wherein the block was generated. The event record, which may contain actionable instructions, requests, etc., may be transmitted to computing systems of participating neighbor blockchains, where actionable items may be acted upon. Further, the event logs of each computing system may be exchanged, compared, and adjusted to reflect the earliest appearance of each block of each participating neighbor blockchain.

## Claims

### Claim 1

A system providing immutable record keeping, comprising:
one or more computer-readable storage media to store a principal blockchain to store record data in a principal series of blocks that are chronologically linked, a most recent block of the principal series of blocks including a cyrptographic hash of the most recent block, a nonce for the cryptographic hash of the most recent block, a cryptographic hash of a sequentially prior block, and a portion of the record data;
one or more processors in electrical communication with the one or more computer-readable storage media and configured to implement the principal blockchain, the one or more processors to:
create a new block of the principal series of blocks to store new record data, the new block linked to the most recent block by including the cryptographic hash of the most recent block, the new block becoming a new most recent block of the principal series of blocks;
generate a new cryptographic hash of the new block using a new nonce;
store the new cryptographic hash and the new nonce in the new block; and
transmit to a first neighbor computing system the new cryptographic hash and the new nonce.

### Claim 2 (depends on 1)

The system of claim 1, wherein the one or more processors are further to receive from the first neighbor computing system a cryptographic hash, a corresponding nonce, and a collection of cryptographic hashes of a most recent block of a first neighbor series of blocks.

### Claim 3 (depends on 2)

The system of claim 2, wherein the one or more processors are further to create a next block of the principal series of blocks, the next block linked to the new most recent block by including the new cryptographic hash and the new nonce, the next block also including the cryptographic hash of the most recent block of the first neighbor series of blocks.

### Claim 4 (depends on 2)

The system of claim 2, wherein the one or more processors are further to store a principal event log including an ordered listing of event records each corresponding to a transaction record of the record data stored in the principal series of blocks of the principal blockchain.

### Claim 5 (depends on 1)

The system of claim 1, wherein the one or more computer-readable storage media are further to store a principal event log including an ordered listing of event records each corresponding to a transaction record included in the record data of the principal blockchain,
wherein the one or more processors are further to record to the principal event log an event record indicating creation of the new block.

### Claim 6 (depends on 5)

The system of claim 5, the one or more processors further to:
receive, from first neighbor computing system, at least a portion of a first neighbor event log;
compare the principal event log with the first neighbor event log; and
ensure that an earliest appearance of each event record is reflected in the principle event log based on the comparison.

### Claim 7 (depends on 1)

The system of claim 1, wherein the first neighbor computing system is in electronic communication with the system and implements a first participating neighbor blockchain comprising a first neighbor series of blocks that are chronologically linked, a most recent block of the first neighbor series of blocks including a cryptographic hash of the most recent block, a nonce for the cryptographic hash of the most recent block, and a cryptographic hash of a sequentially prior block of the first neighbor series of blocks.

### Claim 8 (depends on 1)

The system of claim 1, wherein the one or more processors are further to transmit to a second neighbor computing system the new cryptographic hash and the new nonce.

### Claim 9 (depends on 8)

The system of claim 8, wherein the one or more processors are further to receive from the second neighbor computing system a cryptographic hash, a Preliminary Amendment and Response to Notice to File Missing Parts corresponding nonce, and a collection of cryptographic hashes of a most recent block of a second neighbor series of blocks of a second participating neighbor blockchain implemented on the second neighbor computing system.

### Claim 10 (depends on 1)

The system of claim 1, wherein the record data comprises a plurality of transaction records.

### Claim at position 11

11-26. (canceled)
