Tree-shaped chain ledger structure, high-performance parallel consensus method and system
A high-performance, consensus technology, applied in the blockchain field, can solve problems such as the linear ledger model is difficult to achieve efficient consensus, fast transaction confirmation, DAG ledger model transaction confirmation probability problem, and linear chain ledger model transaction throughput. , to achieve fast confirmation of transactions, speed up block construction and consensus efficiency, and prevent construction conflicts
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0052] like figure 1 As shown, Embodiment 1 of the present disclosure provides a tree-shaped chain ledger structure, which is composed of a main block (Block) and sub-blocks (Blockchild) included in the main block. Each subblock points to the previous main block, and each main block points to its own subblocks until block 0 (the genesis block). Each subblock is built on the previous main block, and each main block is built on its own subblock.
[0053] the sub-blocks, such as figure 2 The shown 201 includes but is not limited to the following attributes: preHash, pointing to the previous main block; StateRoot, based on the previous main block state, the state root after the block is executed; txsRoot, the MPT root of the sub-block transaction, ReceiptsRoot , the MPT root of all transaction execution receipts in the sub-block; txs, the transactions included in the block;
[0054] the main block, such as figure 2 The shown 202 includes but is not limited to the following att...
Embodiment 2
[0056] Embodiment 2 of the present disclosure provides a high-performance parallel consensus method. Through a tree-shaped chained ledger structure and based on coded computing, a large block is divided into multiple small sub-blocks, which are allocated to each consensus node for parallel construction. The verification is performed, and finally the sub-blocks are aggregated into a verifiable tree-shaped block ledger data that is logically unified, tamper-proof, and verifiable through the main block.
[0057] Specifically include:
[0058] (1) Based on transaction dependencies, the transactions to be constructed are divided into unrelated branches that can be executed in parallel, each branch is a transaction execution sequence with dependencies, and there is no transaction dependency between different branches;
[0059] (2) Based on coded computing, use branches as sub-blocks to build the smallest unit of task allocation, build a branch allocation strategy that satisfies faul...
Embodiment 3
[0087] Embodiment 3 of the present disclosure provides a high-performance parallel consensus system, including multiple consensus nodes, each consensus node includes at least one computer-readable storage medium or at least one electronic device or at least one server, wherein the consensus node type Divided into master node and non-master node;
[0088] The master node is configured to execute: based on the transaction dependencies, divide the transaction into multiple branches that can be executed in parallel, build a branch allocation strategy, define the branches that each node needs to build, inject coding information into the task allocation scheme, and build based on the coding calculation The task allocation strategy code is broadcast to each consensus node; the legal sub-blocks that reach the preset threshold are collected and aggregated, and the main block is constructed and broadcasted;
[0089] After each consensus node receives the task and verifies the correctnes...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


