Shared blockchain data storage based on error correction code

Patent metadata

Field	Value
Publication number	US-10824601-B1
Application number	US-201916712702-A
Country	US
Kind code	B1
Filing date	Dec 12, 2019
Priority date	Aug 1, 2019
Publication date	Nov 3, 2020
Grant date	Nov 3, 2020

Abstract

Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for communicating and sharing blockchain data. One of the methods includes determining historic state data associated with one or more blocks created prior to a current block on a blockchain; performing error correction coding of the historic state data to generate encoded historic state data; dividing, based on one or more predetermined rules, the encoded historic state data into a plurality of data sets; selecting one or more data sets from the plurality of data sets based on the one or more predetermined rules; hashing the one or more data sets to generate one or more hash values corresponding to the one or more data sets; storing the one or more hash values; and deleting, by the blockchain node, the one or more data sets.

First claim

What is claimed is:

1. A computer-implemented method for storing blockchain data, the computer-implemented method comprising:
determining, by a blockchain node, historic state data associated with one or more blocks created prior to a current block on a blockchain;
performing, by the blockchain node, error correction coding of the historic state data to generate encoded historic state data;
dividing, by the blockchain node based on one or more predetermined rules, the encoded historic state data into a plurality of data sets;
selecting, by the blockchain node, one or more data sets from the plurality of data sets based on the one or more predetermined rules;
hashing, by the blockchain node, the one or more data sets to generate one or more hash values corresponding to the one or more data sets;
storing, by the blockchain node, the one or more hash values; and
deleting, by the blockchain node, the one or more data sets.

2. The computer-implemented method of claim 1 , wherein the error correction coding is performed when utilization rate of computational resource of the blockchain node is less than or equal to a predetermined value or usage of storage space of the blockchain node is greater than or equal to a predetermined percentage.

3. The computer-implemented method of claim 1 , wherein the error correction coding is performed by adding redundant bits to the one or more blocks.

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

5. The computer-implemented method of claim 1 , wherein the blockchain node is a first blockchain node, and further comprising:
after deleting the one or more data sets, determining that the historic state data is associated with at least one of the one or more data sets deleted by the first blockchain node;
identifying, based on the one or more predetermined rules, a second blockchain node that stores at least one of the one or more data sets and at least one hash value corresponding to the at least one of the one or more data sets; and
sending the at least one hash value to the second blockchain node for retrieving the at least one of the one or more data sets.

6. The computer-implemented method of claim 5 , wherein the at least one hash value is a first at least one hash value, and further comprising:
receiving, from the second blockchain node, at least one data set in response to sending the first at least one hash value; and
hashing the at least one data set to generate a second at least one hash value.

7. The computer-implemented method of claim 6 , further comprising:
determining that the at least one data set is authentic if the first at least one hash value is same as the second at least one hash value.

8. The computer-implemented method of claim 6 , further comprising:
identifying, based on the one or more predetermined rules, a third blockchain node that stores at least one of the one or more data sets and third at least one hash value corresponding to the at least one of the one or more data sets;
sending the third at least one hash value to the third blockchain node for retrieving the at least one of the one or more data sets;
receiving, from the third blockchain node, at least one data set in response to sending the third at least one hash value;
hashing the at least one data set to generate a fourth at least one hash value; and
determining that the at least one data set is authentic if the third at least one hash value is same as the fourth at least one hash value.

9. The computer-implemented method of claim 1 , further comprising:
before the deleting the one or more data sets, indexing the one or more hash values with an identifier identifying the one or more blocks associated with the historic state data.

10. The computer-implemented method of claim 1 , wherein the one or more predetermined rules include one or more instructions for dividing the encoded historic state data to the plurality of data sets based on a quantity of blockchain nodes of a blockchain network and assignments of one or more data sets of the plurality of data sets to be stored or hashed by each blockchain node of the quantity of blockchain nodes.

11. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for storing blockchain data, comprising:
determining, by a blockchain node, historic state data associated with one or more blocks created prior to a current block on a blockchain;
performing, by the blockchain node, error correction coding of the historic state data to generate encoded historic state data;
dividing, by the blockchain node based on one or more predetermined rules, the encoded historic state data into a plurality of data sets;
selecting, by the blockchain node, one or more data sets from the plurality of data sets based on the one or more predetermined rules;
hashing, by the blockchain node, the one or more data sets to generate one or more hash values corresponding to the one or more data sets;
storing, by the blockchain node, the one or more hash values; and
deleting, by the blockchain node, the one or more data sets.

12. The non-transitory, computer-readable medium of claim 11 , wherein the error correction coding is performed when utilization rate of computational resource of the blockchain node is less than or equal to a predetermined value or usage of storage space of the blockchain node is greater than or equal to a predetermined percentage.

13. The non-transitory, computer-readable medium of claim 11 , wherein the error correction coding is performed by adding redundant bits to the one or more blocks.

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

15. The non-transitory, computer-readable medium of claim 11 , wherein the blockchain node is a first blockchain node, and further comprising:
after deleting the one or more data sets, determining that the historic state data is associated with at least one of the one or more data sets deleted by the first blockchain node;
identifying, based on the one or more predetermined rules, a second blockchain node that stores at least one of the one or more data sets and at least one hash value corresponding to the at least one of the one or more data sets; and
sending the at least one hash value to the second blockchain node for retrieving the at least one of the one or more data sets.

16. The non-transitory, computer-readable medium of claim 15 , wherein the at least one hash value is a first at least one hash value, and further comprising:
receiving, from the second blockchain node, at least one data set in response to sending the first at least one hash value; and
hashing the at least one data set to generate a second at least one hash value.

17. The non-transitory, computer-readable medium of claim 16 , further comprising:
determining that the at least one data set is authentic if the first at least one hash value is same as the second at least one hash value.

18. The non-transitory, computer-readable medium of claim 16 , further comprising:
identifying, based on the one or more predetermined rules, a third blockchain node that stores at least one of the one or more data sets and third at least one hash value corresponding to the at least one of the one or more data sets;
sending the third at least one hash value to the third blockchain node for retrieving the at least one of the one or more data sets;
receiving, from the third blockchain

Assignees

• Alibaba Group Holding Ltd

Inventors

• Zhuo Haizhen

Classifications

• H04L9/50

  using hash chains, e.g. blockchains or hash trees · CPC title

• H03M13/05

  using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits {(H03M13/2906 takes precedence)} · CPC title

• G06F21/602

  Providing cryptographic facilities or services · CPC title

• H04L2209/34

  Encoding or coding, e.g. Huffman coding or error correction · CPC title

• H04L63/12

  Applying verification of the received information (cryptographic mechanisms or cryptographic arrangements for data integrity or data verification H04L9/32) · CPC title