Blockchain State Tree Archiving for Storage Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Blockchain networks face storage resource limitations due to increasing data, leading to insufficient storage space and efficiency issues in validity and existence verification processes.
Innovation Solution
A blockchain-based data processing method that detects state subtrees satisfying archiving conditions, generates archiving transactions, and archives them to a service device, while deleting non-essential nodes from the target state tree, thereby alleviating storage pressure and improving verification efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is continuously stored in the blockchain, then data completeness and verification capability are improved, but storage resource consumption increases
Solution Approach 1:
The state tree is divided into multiple state subtrees, where each state subtree represents a segment of the overall state data. This segmentation allows the blockchain to store only essential verification information (roots of state subtrees) while archiving detailed state data externally, thus reducing on-chain storage while maintaining verification capability.
Solution Approach 2:
The patent extracts and archives state subtrees that meet archiving conditions (such as being unchanged for a certain period) to external storage. Only the root nodes of these archived state subtrees are retained in the blockchain, separating detailed state data from essential verification data, thereby reducing storage resource consumption while preserving verification ability.
2Reliability
If all state tree nodes are retained in the blockchain, then data integrity is ensured, but storage space is insufficient
Solution Approach 1:
The system performs preliminary archiving of state subtrees that are unlikely to change (based on archiving conditions such as time duration or state stability) before they would consume excessive storage space. This preliminary action prevents future storage issues while ensuring that archived data can still be verified when needed through the retained root nodes.
Solution Approach 2:
Instead of storing complete state subtree data in the blockchain, the system stores hash copies (root nodes) of these subtrees. These hash copies serve as verification anchors that are much smaller in size but sufficient for integrity verification, allowing the full data to be archived externally without compromising data integrity.
3Quantity of substance
If state subtrees are archived externally, then storage resource is reduced, but verification complexity increases
Solution Approach 1:
The system implements a feedback mechanism where the blockchain stores root hashes of state subtrees that can be used to verify the integrity of externally archived data. When verification is needed, the system retrieves the archived state subtree and uses the stored root hash to verify its integrity, providing a simple feedback loop that reduces verification complexity despite external archiving.
Solution Approach 2:
The root node of the state subtree acts as an intermediary between the blockchain and externally archived state data. This intermediary element enables verification without requiring the entire state subtree to be stored on-chain, simplifying the verification process by providing a single verification point (the root hash) that represents the entire archived subtree.
4Productivity
If archiving operations are performed frequently, then storage efficiency is improved, but system overhead increases
Solution Approach 1:
The system employs periodic archiving operations based on predefined conditions (such as time intervals, state change frequency, or storage thresholds) rather than continuous archiving. This periodic action allows the system to achieve good storage efficiency by archiving at optimal intervals while minimizing the overhead associated with frequent archiving operations.
Solution Approach 2:
The system changes parameters such as archiving thresholds, time intervals, and state stability criteria to optimize the balance between storage efficiency and system overhead. By adjusting these parameters based on system conditions and requirements, the system can achieve high storage efficiency while keeping overhead manageable through intelligent parameter selection rather than fixed frequent archiving.
Data Source
AI summary
Embodiments of the present disclosure disclose a blockchain-based data processing method, a device, and a readable storage medium. The method includes: in response to determining that a first state subtree satisfying a state archiving condition exists in a target state tree, generating an archiving transaction based on a first leaf node and a first sub-root node that are of the first state subtree; archiving the first state subtree to a service device in response to the archiving transaction being successfully uploaded, where a business service provided by the service device is associated with the first object information; and deleting, from the target state tree, a node other than the first sub-root node in the first state subtree, where the first sub-root node in the target state tree is configured for indicating that the first state subtree is archived.