Blockchain Compression Using Merkle Roots for Historical Ledger Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The growing size of blockchains increases storage and network resource demands, making it difficult to maintain and distribute, particularly for larger blockchains with historical transactions.
Innovation Solution
Implementing a blockchain compression system that calculates a hash root value for a set of blocks, stores this in a Merkle tree, and distributes a compressed version of the blockchain, reducing storage and network costs by referencing the root hash value and database address for accessing compressed blocks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the blockchain stores all historical transactions, then the completeness and reliability of the ledger is improved, but the storage requirements and network transmission costs increase significantly
Solution Approach 1:
The patent extracts only the essential verification data (Merkle root hash) from the complete blockchain and stores it in the genesis block, while the full transaction history is stored externally in a database. This allows nodes to verify transactions without storing all historical data, resolving the contradiction between ledger completeness and storage requirements.
Solution Approach 2:
The patent segments the blockchain into two parts: a compressed genesis block containing only the Merkle root hash and metadata, and an external database containing the complete transaction history. This segmentation allows different storage requirements for different parts of the blockchain, improving overall storage efficiency while maintaining reliability.
2Reliability
If the blockchain stores all historical transactions, then the completeness and reliability of the ledger is improved, but the network transmission time and resource usage increase
Solution Approach 1:
The patent extracts only the Merkle root hash from the complete blockchain and transmits it in the genesis block, while the full transaction data remains in the external database. This dramatically reduces network transmission time and resource usage while maintaining the ability to verify transaction completeness through the Merkle root.
Solution Approach 2:
The patent segments the data transmission into a compressed genesis block (transmitted quickly over the network) and an external database (accessed locally when needed). This segmentation resolves the contradiction by transmitting only essential verification data over the network while keeping detailed data accessible locally.
3Quantity of substance
If the blockchain is compressed using Merkle tree hashing, then the storage requirements and network transmission costs are reduced, but the complexity of the system increases
Solution Approach 1:
The patent introduces a Merkle tree as an intermediary structure that connects the compressed genesis block and the external database. The Merkle root hash serves as a mediator that verifies the integrity of the external data without requiring nodes to store it, managing the complexity through a well-defined cryptographic structure.
Solution Approach 2:
The patent changes the parameter representation from storing complete transaction data to storing only the Merkle root hash in the genesis block. This parameter change (from full data to hash digest) reduces storage requirements while the Merkle tree structure manages the complexity of maintaining data integrity.
4Productivity
If a new era genesis block is created to represent a portion of the blockchain, then the distribution efficiency is improved, but the complexity of accessing and verifying historical data increases
Solution Approach 1:
The patent segments the blockchain into multiple new era genesis blocks, each representing a portion of the blockchain history. Each genesis block contains a Merkle root hash that can be independently verified, allowing distributed storage and access while maintaining verification simplicity through the Merkle tree structure.
Solution Approach 2:
The patent performs preliminary compression of blockchain portions into new era genesis blocks with pre-calculated Merkle root hashes. This preliminary action allows efficient distribution of compressed blocks while the Merkle tree structure provides a straightforward verification process, managing access complexity through pre-computed verification data.
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.