SHARED BLOCKCHAIN DATA STORAGE BASED ON ERROR CORRECTION CODE

• US 20210034460A1
• Filed: 12/13/2019
• Published: 02/04/2021
• Est. Priority Date: 08/01/2019
• Status: Active Grant

• Current Assignee: Advanced New Technologies Company Limited (Ant Group Co., Ltd.)
• Original Assignee: Advanced New Technologies Company Limited (Ant Group Co., Ltd.)
• Inventors: Zhuo, Haizhen
• Granted Patent: US 11,175,987 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 11/00 Error detection; Error correction; Monitoring error detection, correction or monitoring in information storage based on relative movement between record carrier and transducer G11B20/18; monitoring, i.e. supervising the progress of recording or reproducing G11B27/36; in static stores G11C29/00
• CPC Class Codes: G06F 11/1076 Parity data used in redundant arrays of independent storages, e.g. in RAID systems
• CPC Class Codes: G06F 16/137 Hash-based content-based indexing of textual data G06F16/31
• CPC Class Codes: G06F 16/2379 Updates performed during online database operations; commit processing
• CPC Class Codes: G06F 21/64 Protecting data integrity, e.g. using checksums, certificates or signatures
• CPC Class Codes: H03M 13/154 Error and erasure correction, e.g. by using the error and erasure locator or Forney polynomial
• CPC Class Codes: H03M 13/3761 using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes
• CPC Class Codes: H04L 2209/34 Encoding or coding, e.g. Huffman coding or error correction
• CPC Class Codes: H04L 63/12 Applying verification of the received information cryptographic mechanisms or cryptographic arrangements for data integrity or data verification H04L9/32
• CPC Class Codes: H04L 9/0643 Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
• CPC Class Codes: H04L 9/3239 involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
• CPC Class Codes: H04L 9/3247 involving digital signatures
• CPC Class Codes: H04L 9/50 using hash chains, e.g. blockchains or hash trees

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, by a blockchain node, one or more blocks that are infrequently visited; performing error correction coding of the one or more blocks to generate one or more encoded blocks; dividing, based on one or more predetermined rules, each of the one or more encoded blocks to a plurality of data sets; selecting one or more data sets from the plurality of data sets of each of the one or more encoded blocks 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 the one or more data sets.

Claims

1. A computer-implemented method for storing blockchain data, the computer-implemented method comprising:

determining, by a blockchain node, one or more blocks that are infrequently visited, wherein the one or more blocks are stored on the blockchain node and created on a blockchain;

performing, by the blockchain node, error correction coding of the one or more blocks to generate one or more encoded blocks;

dividing, by the blockchain node based on one or more predetermined rules, each of the one or more encoded blocks to a plurality of data sets;

selecting, by the blockchain node, one or more data sets from the plurality of data sets of each of the one or more encoded blocks 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 one or more blocks are determined as infrequently visited if the one or more blocks are created for a predetermined amount of time or no block data associated with the one or more blocks are retrieved to execute a smart contract for a predetermined amount of time.

3. 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.

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

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

6. 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 block data needed for executing a smart contract is associated with at least one data set 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 data set of the one or more data sets and at least one hash value corresponding to the at least one data set 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 data set of the one or more data sets.

7. The computer-implemented method of claim 6, 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.

8. The computer-implemented method of claim 7, further comprising:

determining that the at least one data set is authentic if the first at least one hash value is identical to the second at least one hash value.

9. The computer-implemented method of claim 7, further comprising:

identifying, based on the one or more predetermined rules, a third blockchain node that stores at least one data set of the one or more data sets and a third at least one hash value corresponding to the at least one data set 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 data set 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 identical to the fourth at least one hash value.

10. 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 a block ID of a corresponding block of the one or more blocks associated with the one or more hash values.

11. The computer-implemented method of claim 1, wherein the one or more predetermined rules include one or more instructions for dividing the encoded blocks 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.

12. 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, one or more blocks that are infrequently visited, wherein the one or more blocks are stored on the blockchain node and created on a blockchain;

performing, by the blockchain node, error correction coding of the one or more blocks to generate one or more encoded blocks;

dividing, by the blockchain node based on one or more predetermined rules, each of the one or more encoded blocks to a plurality of data sets;

selecting, by the blockchain node, one or more data sets from the plurality of data sets of each of the one or more encoded blocks 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.

13. The non-transitory, computer-readable medium of claim 12, wherein the one or more blocks are determined as infrequently visited if the one or more blocks are created for a predetermined amount of time or no block data associated with the one or more blocks are retrieved to execute a smart contract for a predetermined amount of time.

14. The non-transitory, computer-readable medium of claim 12, 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.

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

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

17. The non-transitory, computer-readable medium of claim 12, wherein the blockchain node is a first blockchain node, and further comprising:

after deleting the one or more data sets, determining that block data needed for executing a smart contract is associated with at least one data set 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 data set of the one or more data sets and at least one hash value corresponding to the at least one data set 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 data set of the one or more data sets.

18. The non-transitory, computer-readable medium of claim 17, 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.

19. The non-transitory, computer-readable medium of claim 18, further comprising:

determining that the at least one data set is authentic if the first at least one hash value is identical to the second at least one hash value.

20. The non-transitory, computer-readable medium of claim 19, further comprising:

identifying, based on the one or more predetermined rules, a third blockchain node that stores at least one data set of the one or more data sets and a third at least one hash value corresponding to the at least one data set 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 data set 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 identical to the fourth at least one hash value.

21. The non-transitory, computer-readable medium of claim 12, further comprising:

before the deleting the one or more data sets, indexing the one or more hash values with a block ID of a corresponding block of the one or more blocks associated with the one or more hash values.

22. The non-transitory, computer-readable medium of claim 12, wherein the one or more predetermined rules include one or more instructions for dividing the encoded blocks 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.

23. 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 one or more operations for;

determining, by a blockchain node, one or more blocks that are infrequently visited, wherein the one or more blocks are stored on the blockchain node and created on a blockchain;

performing, by the blockchain node, error correction coding of the one or more blocks to generate one or more encoded blocks;

dividing, by the blockchain node based on one or more predetermined rules, each of the one or more encoded blocks to a plurality of data sets;

selecting, by the blockchain node, one or more data sets from the plurality of data sets of each of the one or more encoded blocks 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.

24. The computer-implemented system of claim 23, wherein the one or more blocks are determined as infrequently visited if the one or more blocks are created for a predetermined amount of time or no block data associated with the one or more blocks are retrieved to execute a smart contract for a predetermined amount of time.

25. The computer-implemented system of claim 23, 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.

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

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

28. The computer-implemented system of claim 23, wherein the blockchain node is a first blockchain node, and further comprising:

after deleting the one or more data sets, determining that block data needed for executing a smart contract is associated with at least one data set 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 data set of the one or more data sets and at least one hash value corresponding to the at least one data set 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 data set of the one or more data sets.

29. The computer-implemented system of claim 28, 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.

30. The computer-implemented system of claim 29, further comprising:

determining that the at least one data set is authentic if the first at least one hash value is identical to the second at least one hash value.