Blockchain Node Transaction Array and Merkle Root Consolidation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
As blockchain technology is applied to larger and larger numbers of transactions, managing the volume of transactions becomes challenging, particularly in achieving throughput comparable to existing payment networks like Mastercard or Visa.
Innovation Solution
A computer-implemented method for blockchain transaction processing involves appending transaction identifiers for validated transactions to an array, determining a Merkle root for the array, and adding it to a candidate block. This process continues until the array reaches a maximum size, at which point the Merkle roots are used to determine a top-level summary value for the consolidated ordered list of transactions, modifying the block header, and propagating the array on a blockchain network.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional blockchain transaction processing methods are used, then transaction validation and block creation can be achieved, but the throughput is limited and cannot handle large volumes of transactions comparable to payment networks like Mastercard or Visa
Solution Approach 1:
The patent segments the blockchain network into specialized nodes with different functions: transaction processing nodes that handle high-volume transaction validation and block creation, and verification nodes that validate blocks without processing individual transactions. This segmentation allows transaction processing nodes to achieve high throughput while verification nodes maintain security, resolving the contradiction between productivity and system complexity.
Solution Approach 2:
The patent implements preliminary action by having transaction processing nodes pre-validate transactions and pre-construct blocks before submitting them to verification nodes. This preliminary processing separates the computationally intensive transaction validation work from the final verification step, enabling high throughput transaction processing while maintaining verification integrity without requiring all nodes to perform both functions simultaneously.
2Speed
If all nodes validate and process every transaction, then security and consensus are maintained, but processing speed and throughput are limited
Solution Approach 1:
The patent divides the validation responsibility between two types of nodes: transaction processing nodes that perform initial validation and block construction, and verification nodes that perform final validation. This segmentation enables faster processing by distributing the validation workload while maintaining reliability through multiple validation layers, as verification nodes can quickly validate blocks without re-processing individual transactions.
Solution Approach 2:
Transaction processing nodes perform preliminary validation of transactions and construction of candidate blocks before submission to verification nodes. This preliminary action speeds up processing by completing intensive validation work in advance, while verification nodes perform a lighter final validation step that maintains reliability without requiring all nodes to perform full validation on every transaction.
3Measurement precision
If nodes maintain complete transaction data for verification, then validation accuracy is ensured, but memory requirements and data storage costs increase
Solution Approach 1:
The patent extracts the complete transaction data storage requirement from verification nodes and concentrates it in transaction processing nodes. Verification nodes only need to store and validate block headers and Merkle roots, while transaction processing nodes maintain the complete transaction data needed for detailed validation. This extraction maintains verification accuracy for nodes that need it while reducing memory requirements for nodes that prioritize throughput.
Solution Approach 2:
The patent introduces Merkle roots as an intermediary data structure that enables verification nodes to validate transactions without storing complete transaction data. By using cryptographic Merkle roots that represent the entire transaction set, verification nodes can achieve high verification accuracy through compact data structures, significantly reducing memory storage requirements while maintaining validation precision.
Data Source
Figure 1
Figure 2
Figure 3A~3B
AI summary
Methods, devices, and a data structure for processing large volumes of transactions in blockchain nodes without using a mempool. Incoming transactions are validated and added to a candidate block. Transaction identifiers are added to an ordered set of transaction identifiers in an array until complete. The completed array and its Merkle root are propagated to other nodes. A placeholder transaction may be used in the first array in place of a coinbase transaction and its Merkle path may be determined to enable replacement of the placeholder transaction by the coinbase transaction during mining. Subsequent arrays are appended to the consolidated list of transaction identifiers are they are completed to continuously build a growing candidate block for mining.