Distributed Blockchain Validation Through Merkle Tree Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain validation processes require significant resources and time due to the need to download and store blocks, maintain large UTXO pools, and perform extensive processing tasks, which many users cannot meet or prefer not to, necessitating a faster and more efficient verification model without compromising security or altering the existing protocol.
Innovation Solution
The method involves decomposing a blockchain block's Merkle tree into segments, allocating these segments to multiple validators, and using a binary indexing system for load balancing, enabling parallel and distributed processing of transactions, with each validator maintaining a subset of the UTXO pool, thus reducing the computational burden and enhancing efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional blockchain validation is performed by single nodes downloading and storing complete blocks, then validation security is maintained, but resource consumption and time requirements increase significantly
Solution Approach 1:
The patent divides the Merkle tree into multiple segments and allocates different segments to different validating resources. Each validating resource only needs to download, store, and validate its assigned segment rather than the entire block, significantly reducing resource consumption and validation time while maintaining overall validation security through the distributed nature of the segments.
2Measurement precision
If complete UTXO pools are maintained by each validating node, then transaction validation accuracy is ensured, but storage requirements and processing overhead increase
Solution Approach 1:
Each validating resource maintains only the subset of UTXO data relevant to its assigned Merkle tree segment rather than complete UTXO pools. This localisation of data storage and processing reduces storage requirements and processing overhead while maintaining validation accuracy for transactions within each segment's scope.
3Productivity
If distributed validation is implemented across multiple resources, then processing efficiency improves, but system complexity increases
Solution Approach 1:
The system performs preliminary allocation of Merkle tree segments to validating resources before validation begins. This pre-organisation of work segments and their assignment to specific resources simplifies the coordination required for distributed validation, reducing system complexity while maintaining the processing efficiency benefits of parallel validation across multiple resources.
Data Source
AI summary
The present disclosure provides methods and systems for distributed and/or parallel processing of data records, and in particular validation of blockchain transactions in a blockchain block. In a preferred embodiment, a distributed validation node is disclosed in which one or more transactions are allocated to a validating resource in a plurality of validating resources. The one or more transactions relates to a portion of a Merkle tree for the block, so that each validation resource is able to operate independently on verification of a subset of the block's transactions, each subset being based on a segment of the Merkle tree. The disclosure includes advantageous techniques for at least: allocation of tree segments to different validation resources, load balancing, download of the transactions to be validated, distributed UTXO pools, indexing schemes and prevention of double spend events.