Blockchain Compression Using Merkle Roots for Historical Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The growing size of blockchains, particularly those with numerous historical transactions, poses challenges in storage management and network resource utilization, leading to increased storage needs and slower transfer times due to the extensive data that needs to be maintained and distributed across a peer-to-peer network.
Innovation Solution
A blockchain compression system that calculates a hash root value for sets of blocks when certain conditions are 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 that includes the root hash value and database address, allowing for efficient distribution and access of compressed blockchain portions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If the blockchain stores all historical transactions in full detail, then data completeness and verification accuracy are improved, but storage requirements and network transfer costs increase significantly
Solution Approach 1:
The patent extracts only the essential verification information (Merkle root hash) from the complete transaction data, storing the full transaction details separately. This allows nodes to verify transactions without storing all historical transaction data, significantly reducing storage requirements while maintaining verification completeness
Solution Approach 2:
The patent creates compressed representations (Merkle trees) of the original transaction data that can be used for verification purposes. These Merkle trees serve as compact copies that enable complete verification of transaction inclusion without requiring storage of the actual transaction payloads
2Ease of operation
If the blockchain distributes complete transaction data across all nodes, then data accessibility and verification capability are improved, but network bandwidth consumption and transfer times increase
Solution Approach 1:
The patent extracts only the Merkle root hash from complete transaction data for distribution across the network. This extracted information enables verification of transaction inclusion without requiring nodes to receive and process full transaction data, dramatically reducing network bandwidth consumption while maintaining verification accessibility
Solution Approach 2:
Instead of distributing full transaction data and allowing verification, the patent inverts the approach by distributing only verification proofs (Merkle roots) and allowing nodes to verify transaction inclusion locally. This inversion reduces network traffic while preserving verification capability
3Loss of information
If the blockchain maintains a growing history of all transactions, then historical data availability and auditability are improved, but system complexity and maintenance difficulty increase
Solution Approach 1:
The patent segments the blockchain data into two distinct parts: (1) the lightweight main chain containing only Merkle root hashes for verification, and (2) the separate storage for complete transaction data. This segmentation allows the main blockchain to remain simple and manageable while historical data is preserved in the segmented storage layer
Solution Approach 2:
The patent introduces Merkle trees as an intermediary structure between the main blockchain and complete transaction data. This intermediary enables verification of historical transactions without requiring the main blockchain to store or directly manage the complete historical data, reducing maintenance complexity
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.