Light Client Interaction Verification With Merkle Range Proofs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current light clients in blockchain networks face significant resource constraints due to the need to download and verify large numbers of block headers, especially as the size of the blockchain grows, making it inefficient and burdensome for devices with limited bandwidth and storage, such as smartphones and IoT devices.
Innovation Solution
A method and system that allow light clients to efficiently verify the validity of a full node's blockchain by randomly sampling a logarithmic number of block headers and using Merkle mountain range proofs, reducing the data required for verification and enabling non-interactive probabilistic verification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If light clients download and verify all block headers to ensure blockchain validity, then verification reliability is improved, but resource consumption (bandwidth, storage, computation) increases significantly
Solution Approach 1:
The patent segments the blockchain verification process into two independent components: (1) verification of block headers to ensure chain validity, and (2) verification of transaction inclusion via Merkle proofs. This segmentation allows light clients to verify blockchain validity without downloading all block data, reducing resource consumption while maintaining verification reliability.
Solution Approach 2:
The patent extracts the essential verification elements (block headers containing Merkle roots) from the complete blockchain data. By taking out only the critical components needed for verification rather than the entire blockchain, the system enables resource-constrained devices to perform verification with minimal data download.
2Measurement precision
If light clients download complete block data to verify transaction inclusion, then verification accuracy is improved, but bandwidth and storage requirements increase
Solution Approach 1:
The patent extracts Merkle proofs from complete block data and transmits them separately to light clients. This extraction allows verification of transaction inclusion accuracy without requiring clients to download entire blocks, significantly reducing bandwidth and storage consumption while maintaining verification precision.
Solution Approach 2:
The patent introduces Merkle proofs as an intermediary mechanism that bridges the gap between full nodes and light clients. These proofs serve as compact verification evidence that enables accurate transaction verification without direct access to complete block data, reducing resource requirements while preserving verification accuracy.
3Productivity
If the blockchain size grows to include more transactions, then network capacity and utility are improved, but the burden on light clients for verification increases
Solution Approach 1:
The patent segments verification complexity into fixed-size block header validation and logarithmic-size Merkle proof verification. This segmentation ensures that verification complexity for light clients remains manageable even as blockchain network capacity grows, since the verification structure scales efficiently with blockchain size.
Solution Approach 2:
The patent changes the verification parameter from linear block data download to logarithmic Merkle proof verification. This parameter change allows the system to maintain constant verification complexity for light clients regardless of blockchain growth, as Merkle proof size grows logarithmically rather than linearly with blockchain size.
Data Source
AI summary
A node in a plurality of nodes can perform an identity set generation process. The node can then determine a leader node. The node may diffuse an identity set from each node of the plurality of nodes to the plurality of nodes. The node can then determine a majority set including identities occurring in at least one half of the identify sets, wherein the leader node diffuses the majority set of the leader node to the plurality of nodes. The node can verify the majority set of the leader node. The node may then update the identity set based on the majority set of the leader node.