Blockchain Transaction Grouping for Parallel Cross-Block Execution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain technologies face inefficiencies in transaction execution due to varying execution times and resource wastage, particularly when smart contracts are involved, leading to low overall processing efficiency and utilization.
Innovation Solution
Implementing a method to group transactions based on pre-execution read-write sets, allowing parallel execution across multiple blocks by using algorithms like DAG and union-find sets, and ensuring transaction groups are independent of each other's read-write sets, thereby optimizing transaction execution efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If transactions are executed sequentially in a traditional blockchain system, then transaction execution correctness is ensured, but transaction processing efficiency deteriorates
Solution Approach 1:
The patent segments transactions into independent transaction groups based on read-write set analysis. By dividing the transaction pool into groups that can be executed in parallel without conflicting resource access, the system achieves both correctness and improved throughput. The segmentation is performed by analyzing pre-execution read-write sets and using algorithms like DAG and union-find sets to identify independent groups.
Solution Approach 2:
The patent performs preliminary analysis of transaction read-write sets before execution. By pre-computing the read-write sets and determining independence relationships in advance, the system can safely parallelize execution without compromising correctness. This preliminary action enables the system to identify which transactions can be executed concurrently.
2Productivity
If transactions are grouped for parallel execution, then transactions per second (TPS) improves, but system complexity increases
Solution Approach 1:
The patent introduces intermediary data structures (read-write sets, dependency graphs) and algorithms (DAG, union-find sets) that mediate between the transaction pool and the execution engine. These intermediaries abstract the complexity of parallel execution coordination, allowing the system to achieve high TPS while managing complexity through well-defined intermediate representations and proven algorithms.
3Productivity
If transaction execution is optimized for speed, then processing efficiency improves, but resource utilization deteriorates
Solution Approach 1:
The patent changes the parameter of transaction execution from sequential to parallel by adjusting the grouping strategy. By modifying execution parameters (grouping criteria, parallelism degree) based on transaction characteristics and system state, the system optimizes both processing efficiency and resource utilization. The dynamic adjustment of execution parameters allows the system to avoid resource wastage while maintaining high throughput.
Data Source
AI summary
This specification provides transaction execution methods, nodes, and blockchain systems. The methods can be applied to a first node in a blockchain system, which includes a control process and N computing processes. In an example method, the control process acquires M transaction groups, where the M transaction groups are obtained by grouping transactions in a target block based on respective pre-execution read-write sets of the transactions, and M and N are positive integers. The control process acquires, when determining that there is another block that is in an execution phase, a pre-execution read-write set of a transaction in the another block, and sends a transaction group irrelevant to the acquired pre-execution read-write set, among the M transaction groups, to different computing processes in the N processes. A first computing process executes, when receiving any one of the M transaction groups, each transaction in the received transaction group.