# US 2021/0232572 A1 · Blockchain data storage based on shared nodes and error correction code

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

- Number: US 2021/0232572 A1
- Document ID: US20210232572A1
- Status: Published application
- Kind: A1
- Application number: 17/209,996
- Filed: 2021-03-23
- Published: 2021-07-29
- Earliest claimed: 2019-08-20
- Assignees: Advanced New Technologies Co., Ltd.
- Applicants: Advanced New Technologies Co., Ltd.
- Inventors: Haizhen Zhuo
- Web page: https://patentgrep.com/patent/US20210232572A1

## CPC

- G06F 16/2379: {Updates performed during online database operations; commit processing}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 16/2246: {Trees, e.g. B+trees}
- H03M 13/154: {Error and erasure correction, e.g. by using the error and erasure locator or Forney polynomial}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 63/123: {received data contents, e.g. message integrity}
- H04L 2209/34: Encoding or coding, e.g. Huffman coding or error correction
- 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)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for storing blockchain data. One of the methods includes determining block data and current state data associated with a current block of a blockchain; sending the current state data to one or more shared storage nodes of a blockchain network; performing error correction coding of the block data to generate encoded block data; dividing, based on one or more predetermined rules, the encoded block data into a plurality of data sets; storing, based on the one or more predetermined rules, one or more data sets of the plurality of data sets; hashing each data set of remaining data sets of the plurality of data sets to generate one or more hash values corresponding to the remaining data sets; and storing the one or more hash values and the current state data.

## Claims

### Claim at position 1

1-30. (canceled)

### Claim 31

A computer-implemented method for storing blockchain data, the computer-implemented method comprising:
determining, by a blockchain node of a blockchain network, block data and current state data associated with a current block of a blockchain;
sending, by the blockchain node, the current state data to a plurality of shared storage nodes of the blockchain network, wherein the blockchain node stores the current state data and the plurality of shared storage nodes store historic state data associated with every block of the blockchain;
determining an impediment in storing the block data in a buffer of the blockchain node, wherein the impediment comprises identifying that a size of the block data is greater than a predetermined threshold or the buffer is full;
in response to determining the impediment in storing the block data in the buffer of the blockchain node, performing, by the blockchain node, error correction coding of the block data to generate encoded block data, wherein the error correction coding is configured to recover missing bits of new data using the encoded block data;
dividing, by the blockchain node and based on a plurality of predetermined rules, the encoded block data into a plurality of data sets, wherein the plurality of predetermined rules provide a distribution of data sets between the plurality of shared storage nodes;
storing, by the blockchain node and based on the plurality of predetermined rules, a portion of the plurality of data sets;
hashing, by the blockchain node, each data set of remaining data sets of the plurality of data sets to generate a plurality of hash values corresponding to the remaining data sets; and
storing, by the blockchain node, the plurality of hash values and the current state data.

### Claim 32 (depends on 31)

The computer-implemented method of claim 31, further comprising:
sending, by the blockchain node, a hash value to one shared storage node of the plurality of shared storage nodes for retrieving an account state included in the historic state data;
receiving, by the blockchain node, the account state in response to sending the hash value; and
verifying, by the blockchain node, that the account state is part of the blockchain based on the hash value.

### Claim 33 (depends on 31)

The computer-implemented method of claim 31, wherein the blockchain network includes at least f+1 shared storage nodes and no more than 2f+2 consensus nodes, and wherein f is a maximum number of faulty shared storage nodes and consensus nodes that can be tolerated within the blockchain network.

### Claim 34 (depends on 31)

The computer-implemented method of claim 31, wherein the plurality of shared storage nodes are elected by receiving 2f+1 votes from all 3f+1, 3f+2, or 3f+3 nodes of the blockchain network, and wherein f is a maximum number of faulty shared storage nodes and consensus nodes that can be tolerated within the blockchain.

### Claim 35 (depends on 31)

The computer-implemented method of claim 31, wherein the current state data and the historic state data are stored as a fixed depth Merkle tree.

### Claim 36 (depends on 31)

The computer-implemented method of claim 31, wherein the error correction coding is erasure coding.

### Claim 37 (depends on 31)

The computer-implemented method of claim 31, wherein the blockchain node is a first blockchain node, and further comprising:
determining that at least a portion of the block data needed for executing a smart contract is not stored by the first blockchain node;
identifying, based on the plurality of predetermined rules, a second blockchain node that stores at least one data set of the remaining data sets of the plurality of data sets and at least one hash value corresponding to the at least one data set of the remaining data sets of the plurality of data sets; and
sending the at least one hash value to the second blockchain node for retrieving the at least one data set of the remaining data sets of the plurality of data sets.

### Claim 38

A non-transitory, computer-readable medium storing plurality of instructions executable by a computer system to perform operations for storing blockchain data, comprising:
determining, by a blockchain node of a blockchain network, block data and current state data associated with a current block of a blockchain;
sending, by the blockchain node, the current state data to a plurality of shared storage nodes of the blockchain network, wherein the blockchain node stores the current state data and the plurality of shared storage nodes store historic state data associated with every block of the blockchain;
determining an impediment in storing the block data in a buffer of the blockchain node, wherein the impediment comprises identifying that a size of the block data is greater than a predetermined threshold or the buffer is full;
in response to determining the impediment in storing the block data in the buffer of the blockchain node, performing, by the blockchain node, error correction coding of the block data to generate encoded block data, wherein the error correction coding is configured to recover missing bits of new data using the encoded block data;
dividing, by the blockchain node and based on a plurality of predetermined rules, the encoded block data into a plurality of data sets, wherein the plurality of predetermined rules provide a distribution of data sets between the plurality of shared storage nodes;
storing, by the blockchain node and based on the plurality of predetermined rules, a portion of the plurality of data sets;
hashing, by the blockchain node, each data set of remaining data sets of the plurality of data sets to generate a plurality of hash values corresponding to the remaining data sets; and
storing, by the blockchain node, the plurality of hash values and the current state data.

### Claim 39 (depends on 38)

The non-transitory, computer-readable medium of claim 38, further comprising:
sending, by the blockchain node, a hash value to the one shared storage node of the plurality of shared storage nodes for retrieving an account state included in the historic state data;
receiving, by the blockchain node, the account state in response to sending the hash value; and
verifying, by the blockchain node, that the account state is part of the blockchain based on the hash value.

### Claim 40 (depends on 38)

The non-transitory, computer-readable medium of claim 38, wherein the blockchain network includes at least f+1 shared storage nodes and no more than 2f+2 consensus nodes, and wherein f is a maximum number of faulty shared storage nodes and consensus nodes that can be tolerated within the blockchain network.

### Claim 41 (depends on 38)

The non-transitory, computer-readable medium of claim 38, wherein the plurality of shared storage nodes are elected by receiving 2f+1 votes from all 3f+1, 3f+2, or 3f+3 nodes of the blockchain network, and wherein f is a maximum number of faulty shared storage nodes and consensus nodes that can be tolerated within the blockchain.

### Claim 42 (depends on 38)

The non-transitory, computer-readable medium of claim 38, wherein the current state data and the historic state data are stored as a fixed depth Merkle tree.

### Claim 43 (depends on 38)

The non-transitory, computer-readable medium of claim 38, wherein the error correction coding is erasure coding.

### Claim 44 (depends on 38)

The non-transitory, computer-readable medium of claim 38, wherein the blockchain node is a first blockchain node, and further comprising:
determining that at least a portion of the block data needed for executing a smart contract is not stored by the first blockchain node;
identifying, based on the plurality of predetermined rules, a second blockchain node that stores at least one data set of the remaining data sets of the plurality of data sets and at least one hash value corresponding to the at least one data set of the remaining data sets of the plurality of data sets; and
sending the at least one hash value to the second blockchain node for retrieving the at least one data set of the remaining data sets of the plurality of data sets.

### Claim 45

A computer-implemented system for storing blockchain data, comprising:
one or more processors; and
one or more computer-readable memories coupled to the one or more processors and having instructions stored thereon that are executable by the one or more processors to perform plurality of operations comprising:
determining, by a blockchain node of a blockchain network, block data and current state data associated with a current block of a blockchain,
sending, by the blockchain node, the current state data to a plurality of shared storage nodes of the blockchain network, wherein the blockchain node stores the current state data and the plurality of shared storage nodes store historic state data associated with every block of the blockchain,
determining an impediment in storing the block data in a buffer of the blockchain node, wherein the impediment comprises identifying that a size of the block data is greater than a predetermined threshold or the buffer is full,
in response to determining the impediment in storing the block data in the buffer of the blockchain node, performing, by the blockchain node, error correction coding of the block data to generate encoded block data, wherein the error correction coding is configured to recover missing bits of new data using the encoded block data,
dividing, by the blockchain node and based on a plurality of predetermined rules, the encoded block data into a plurality of data sets, wherein the plurality of predetermined rules provide a distribution of data sets between the plurality of shared storage nodes,
storing, by the blockchain node and based on the plurality of predetermined rules, a portion of the plurality of data sets,
hashing, by the blockchain node, each data set of remaining data sets of the plurality of data sets to generate a plurality of hash values corresponding to the remaining data sets, and
storing, by the blockchain node, the plurality of hash values and the current state data.

### Claim 46 (depends on 45)

The computer-implemented system of claim 45, further comprising:
sending, by the blockchain node, a hash value to the one shared storage node of the plurality of shared storage nodes for retrieving an account state included in the historic state data;
receiving, by the blockchain node, the account state in response to sending the hash value; and
verifying, by the blockchain node, that the account state is part of the blockchain based on the hash value.

### Claim 47 (depends on 45)

The computer-implemented system of claim 45, wherein the blockchain network includes at least f+1 shared storage nodes and no more than 2f+2 consensus nodes, and wherein f is a maximum number of faulty shared storage nodes and consensus nodes that can be tolerated within the blockchain network.

### Claim 48 (depends on 45)

The computer-implemented system of claim 45, wherein the plurality of shared storage nodes are elected by receiving 2f+1 votes from all 3f+1, 3f+2, or 3f+3 nodes of the blockchain network, and wherein f is a maximum number of faulty shared storage nodes and consensus nodes that can be tolerated within the blockchain.

### Claim 49 (depends on 45)

The computer-implemented system of claim 45, wherein the current state data and the historic state data are stored as a fixed depth Merkle tree.

### Claim 50 (depends on 45)

The computer-implemented system of claim 45, wherein the error correction coding is erasure coding.
