Blockchain Node Data Recycling via Eigenvalue Consensus
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing amount of data in blockchain systems leads to rapid expansion of storage space requirements for each node, causing storage pressure, while maintaining data security and consistency.
Innovation Solution
A shared data recycling method where nodes calculate eigenvalues to determine consistent data ranges, broadcast these values, and recycle data when consensus is reached across nodes, reducing storage pressure by retaining only necessary data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all nodes store complete blockchain data to ensure data security and consistency, then data security and consistency are improved, but storage space requirements rapidly expand causing storage pressure
Solution Approach 1:
The patent segments blockchain data into different height ranges and introduces a recycling mechanism where old data is archived instead of being fully retained. Nodes divide their storage into active blockchain data (current chain) and recycled data (historical blocks), allowing storage optimization while maintaining data availability for consensus verification.
Solution Approach 2:
The patent changes the storage parameter from retaining all historical blockchain data to selectively retaining only necessary data for consensus. By implementing a recycling threshold mechanism, nodes dynamically adjust their storage based on block height thresholds, keeping only recent blocks in full detail while archiving or summarizing older blocks.
2Stability of the object's composition
If nodes retain all historical blockchain data, then data consistency is maintained, but storage pressure on each node increases rapidly
Solution Approach 1:
The patent extracts and archives historical blockchain data that is no longer needed for active consensus operations. By separating recent blocks (retained in full) from historical blocks (recycled or archived), nodes maintain data consistency for current operations while removing unnecessary storage burden from obsolete data.
Solution Approach 2:
The patent implements preliminary recycling actions by setting block height thresholds in advance. When blockchain data reaches certain height milestones, nodes proactively recycle old data before storage pressure becomes critical, ensuring data consistency is maintained while preventing storage exhaustion.
3Volume of stationary object
If nodes recycle old blockchain data to reduce storage pressure, then storage capacity is optimized, but data security may be compromised
Solution Approach 1:
The patent implements a feedback mechanism where nodes continuously monitor their storage status and blockchain height. When the blockchain reaches recycling thresholds, nodes receive feedback signals to trigger the recycling process, ensuring that data security requirements are met before recycling occurs. The system feedbacks on storage pressure and adjusts recycling timing accordingly.
Solution Approach 2:
The patent provides beforehand cushioning by maintaining a buffer of recent blockchain data that is never recycled. This cushion layer ensures that even after recycling old data, nodes retain sufficient historical information for security verification and consensus operations, preventing security compromises while enabling storage optimization.
Data Source
Figure 1A
Figure 1B
Figure 2A
AI summary
A shared data recovery method, device, computer equipment and storage medium, belonging to the field of information technology. The method comprises: acquiring a first eigenvalue of a first node when receiving a recovery request carrying a first block height (201-203); broadcasting the first eigenvalue to at least one second node in a data sharing system (204); broadcasting recovery indication information to at least one second node if determined that the shared data stored by each node in the data sharing system are consistent according to the first eigenvalue and a plurality of second eigenvalues (206); and recovering the data within a range of the first block height in the shared data if a preset number of recovery indication information is received (207). Shared data is recovered by means of determining whether the first eigenvalue is consistent with the second eigenvalues, which ensures the consistency and security of data comprised in a block and also reduces the pressure on a node for storing the shared data in the data sharing system.