Blockchain Compression Using Merkle Roots for Historical Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The growing size of blockchains poses storage and maintenance challenges due to increasing transaction data, leading to higher storage needs and network resource utilization, especially for larger blockchains with many historical transactions, which complicates efficient data management and transmission.
Innovation Solution
A blockchain compression system that calculates a hash root value for sets of blocks when a compression condition is met, using a Merkle tree to compress data, storing this compressed data in a service provider's database, and generating a new era genesis block with a database address and root hash value for distribution, allowing nodes to access and build upon the compressed blockchain.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If the blockchain stores all historical transactions in full detail, then the completeness and accessibility of transaction data is improved, but the storage requirements and network transmission costs increase significantly
Solution Approach 1:
The patent extracts only the essential verification information (hash root values) from the complete transaction data, storing the full transaction details in a centralized database while maintaining only the compressed hash representations in the distributed blockchain. This extraction principle resolves the contradiction by separating the verification function from the storage function.
Solution Approach 2:
The patent creates compressed copies of transaction data in the form of hash root values that can be stored and verified across the distributed network without requiring the original full transaction data. These hash copies serve as sufficient proof of transaction inclusion while occupying minimal storage space.
2Duration of action of stationary object
If the blockchain grows to include more historical transactions, then the historical record completeness is improved, but the network resource utilization and transfer times worsen
Solution Approach 1:
The patent extracts only the critical hash root values from historical transactions for inclusion in the distributed blockchain, while the complete transaction data remains in centralized storage. This extraction enables the blockchain to span extensive historical periods without proportionally increasing network transfer burdens.
Solution Approach 2:
The patent segments the blockchain data into two parts: compressed hash root values distributed across the network for verification, and full transaction data stored centrally for complete access. This segmentation allows historical records to extend further without linearly increasing network synchronization time.
3Reliability
If the blockchain maintains full transaction data for verification, then the verification accuracy is improved, but the storage intensity and maintenance difficulty increase
Solution Approach 1:
The patent extracts the essential verification element (hash root value) from the complete transaction data, maintaining verification accuracy while reducing storage requirements. Nodes can verify transactions by checking hash roots against the centralized database without storing all historical transaction details.
Solution Approach 2:
The patent introduces a centralized database as an intermediary that stores the complete transaction data, allowing distributed nodes to verify transactions by querying this intermediary source rather than maintaining full copies themselves. This intermediary approach preserves verification reliability while simplifying node maintenance.
Data Source
AI summary
Methods and systems described herein improve blockchain storage operations in a variety of environments. A blockchain compression system may determine that a blockchain compression condition associated with a blockchain having a first plurality of blocks has been satisfied. In response, the system compresses the first plurality of blocks using a first hash tree into a first root hash value and stores the first plurality of blocks in a first database. The blockchain compression system generates a first new era genesis block that includes the first root hash value and a first database address of the first database at which the first plurality of blocks are stored. The blockchain compression system stores the blockchain at one or more nodes in a blockchain network. The blockchain includes the first new era genesis block and any previous new era genesis blocks. This may effectively reduce storage requirements for the blockchain, in various embodiments.