Blockchain ECC Storage for Infrequently Visited Blocks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed ledger systems (DLSs) face challenges in reducing storage space on nodes while maintaining data equality and processing efficiency, particularly due to the large size of state and block data, which can lead to 'data inequality' when not all nodes store the entire blockchain.
Innovation Solution
Implementing error correction coding (ECC) on blockchain nodes to identify infrequently visited blocks, encode them, divide the encoded blocks into data sets, hash them, and store only the hash values, allowing nodes to retrieve the rest from other nodes, thereby reducing storage needs and ensuring data authenticity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If every node stores an entire copy of the blockchain, then data equality is maintained, but storage space consumption increases significantly
Solution Approach 1:
The patent divides blockchain data into frequently visited blocks and infrequently visited blocks. Nodes store complete copies of frequently visited blocks locally while storing only hash values of infrequently visited blocks, segmenting the storage responsibility based on access patterns.
Solution Approach 2:
The patent creates hash value copies of infrequently visited blocks instead of storing complete block copies. These hash copies are stored locally while the actual block data is distributed across other nodes in the network, reducing local storage requirements.
2Volume of stationary object
If a few shared nodes store the entire copy of the blockchain, then storage space is reduced for individual nodes, but data inequality is created
Solution Approach 1:
The patent enables all nodes to function as both data consumers and data providers. Each node can serve infrequently visited block data to other nodes that need it, creating a universal peer-to-peer data sharing model where every node contributes to the collective storage capacity.
Solution Approach 2:
The patent merges the storage responsibilities of all nodes in the network. Instead of individual nodes bearing the full storage burden, the system combines the storage capacity of all nodes to collectively hold the complete blockchain, while each node only stores essential data locally.
3Volume of stationary object
If nodes store less blockchain data, then storage space is reduced, but data processing efficiency may be compromised
Solution Approach 1:
The patent performs preliminary actions by pre-calculating and storing hash values of infrequently visited blocks. When a node needs such block data, the pre-stored hash values enable quick identification and retrieval from other nodes, avoiding full data transmission and processing delays.
Solution Approach 2:
The patent implements a feedback mechanism where nodes monitor which blocks are frequently vs. infrequently visited and dynamically adjust their storage strategy. This feedback loop ensures that commonly accessed data remains locally available for efficient processing while less accessed data is stored remotely.
Data Source
AI summary
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.