Distributed Blockchain Validation via Merkle Tree Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current blockchain validation processes require significant resources and time due to the need to download and store blocks, maintain large UTXO pools, and perform processing tasks, making them inefficient for users who do not need or cannot meet these requirements without compromising security.

Innovation Solution

The solution involves distributing blockchain transaction validation tasks across multiple processing resources using a binary indexing system to allocate Merkle tree segments to validators, allowing for parallel processing and efficient reassembly of the complete Merkle tree, and utilizing a distributed UTXO pool to ensure data integrity and reduce storage needs.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional blockchain validation processes are used to ensure security and protocol conformity, then transaction validity is verified, but significant computing resources, storage space, and time are consumed

Engineering Contradiction:
Improvetransaction validation securityVSAvoidcomputing resource consumption
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent segments the blockchain validation process by dividing transaction sets into multiple portions and distributing them across multiple processing resources. Each processing resource validates only its assigned portion using a segmented validation protocol, rather than all nodes performing complete validation of all transactions. This segmentation maintains security through cryptographic verification while reducing individual resource consumption and enabling parallel processing.

Inventive Principle:
Principle #1Segmentation

2Measurement precision

If complete block downloads and large UTXO pools are maintained for validation, then transaction verification accuracy is improved, but storage requirements and processing time increase significantly

Engineering Contradiction:
Improvetransaction verification accuracyVSAvoidstorage space requirements
Core Design Contradiction:
Measurement precisionVSQuantity of substance

Solution Approach 1:

The patent extracts and utilizes only the essential validation data needed for transaction verification, rather than requiring complete block downloads and full UTXO pool maintenance. By focusing on extracting critical validation information and using segmented validation, the system achieves adequate verification accuracy with significantly reduced storage requirements.

Inventive Principle:
Principle #2Taking out (Extraction)

3Productivity

If distributed processing resources are used to validate transactions in parallel, then validation speed and network efficiency improve, but coordination complexity and communication overhead increase

Engineering Contradiction:
Improvevalidation speedVSAvoidsystem coordination complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by pre-segmenting transactions into distinct portions and pre-assigning them to specific processing resources before validation begins. This pre-organization of validation tasks eliminates the need for complex real-time coordination and communication overhead during the validation process itself, allowing parallel processing to proceed efficiently with minimal system complexity.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS20240428240A1Methods and systems for distributed blockchain functionalities
Publication Date: 2024.12.26 NCHAIN LICENSING AG
  • US20240428240A1 patent drawing
  • US20240428240A1 patent drawing
  • US20240428240A1 patent drawing

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.