System and method for parallel-processing blockchain transactions
Methods, systems, and apparatus, including computer programs encoded on computer storage media, for parallel-processing blockchain transactions are provided. One of the methods includes: obtaining a plurality of candidate transactions for adding to a blockchain; grouping the candidate transactions into one or more transaction groups; creating one or more copies of at least a portion of a data structure of a latest block of the blockchain; associating the one or more transaction groups respectively with the one or more copies of the data structure; executing the candidate transactions in each of the transaction groups and updating the associated copies of the data structure; and merging the updated copies of the data structure to obtain at least a portion of a new data structure of a new block to add to the blockchain.
1. A computer-implemented method for parallel-processing blockchain transactions, comprising:
obtaining, at a blockchain node, a plurality of candidate transactions for adding to a blockchain;
grouping, at the blockchain node, the candidate transactions into a plurality of transaction groups;
creating, at the blockchain node, a plurality of copies of at least a portion of a state tree data structure of a newest block of the blockchain;
associating, at the blockchain node, the plurality of transaction groups respectively with the plurality of copies of the state tree data structure of the newest block of the blockchain, wherein the plurality of candidate transactions in the plurality of transaction groups have not yet been added the blockchain;
executing, at the blockchain node, the candidate transactions in each of the transaction groups;
respectively updating, at the blockchain node, the associated copies of the state tree data structure based on the execution of the candidate transactions in each of the transaction groups; and
generating, at the blockchain node, a new state root node of a new block by at least merging the updated associated copies of the state tree data structure and propagating the updates to the new state root node.
2. The method of claim 1 , wherein:
the plurality of transaction groups are independent transaction groups.
3. The method of claim 1 , wherein grouping the candidate transactions into the plurality of transaction groups comprises:
grouping two or more of the candidate transactions each involving at least one common transaction account under a same transaction group of the plurality of transaction groups.
4. The method of claim 1 , wherein grouping the candidate transactions into the plurality of transaction groups comprises:
grouping two or more of the candidate transactions that do not involve any common transaction account under different transaction groups of the plurality of transaction groups.
5. The method of claim 1 , wherein:
the state tree data structure comprises a Merkle Patricia tree comprising a single state root node stored in the newest block and a plurality of intermediate nodes and leaf nodes not stored in the newest block.
6. The method of claim 1 , wherein executing the candidate transactions in each of the transaction groups and updating the associated copies of the state tree data structure comprises:
executing the candidate transactions in each of the transaction groups and updating the associated copies of the state tree data structure in parallel.
7. The method of claim 1 , wherein executing the candidate transactions in each of the transaction groups comprises:
executing the candidate transactions in each of the transaction groups by a multi-core processor.
8. The method of claim 1 , wherein updating the associated copies of the state tree data structure comprises at least one of:
updating a balance of a transaction account in one of the associated copies of the state tree data structure;
removing the transaction account; or
adding a new transaction account.
9. The method of claim 1 , wherein merging the updated copies of the state tree data structure comprises:
updating at least the portion of the state tree data structure of the newest block of the blockchain by combining and incorporating updates made in the updated copies of the state tree data structure.
10. The method of claim 1 , further comprising:
adding the new block to the blockchain.
11. A system for parallel-processing blockchain transactions, comprising one or more processors and one or more non-transitory computer-readable memories coupled to the one or more processors and configured with instructions executable by the one or more processors to cause the system to perform operations comprising:
obtaining a plurality of candidate transactions for adding to a blockchain;
grouping the candidate transactions into a plurality of transaction groups;
creating a plurality of copies of at least a portion of a state tree data structure of a newest block of the blockchain;
associating the plurality of transaction groups respectively with the plurality of copies of the state tree data structure of the newest block of the blockchain, wherein the plurality of candidate transactions in the plurality of transaction groups have not yet been added the blockchain;
executing the candidate transactions in each of the transaction groups;
respectively updating the associated copies of the state tree data structure based on the execution of the candidate transactions in each of the transaction groups; and
generating a new state root node of a new block by at least merging the updated associated copies of the state tree data structure and propagating the updates to the new state root node.
12. The system of claim 11 , wherein grouping the candidate transactions into the plurality of transaction groups comprises:
grouping two or more of the candidate transactions each involving at least one common transaction account under a same transaction group of the plurality of transaction groups.
13. The system of claim 11 , wherein grouping the candidate transactions into the plurality of transaction groups comprises:
grouping two or more of the candidate transactions that do not involve any common transaction account under different transaction groups of the plurality of transaction groups.
14. The system of claim 11 , wherein updating the associated copies of the state tree data structure comprises at least one of:
updating a balance of a transaction account in one of the associated copies of the state tree data structure;
removing the transaction account; or
adding a new transaction account.
15. A non-transitory computer-readable storage medium configured with instructions executable by one or more processors to cause the one or more processors to perform operations comprising:
obtaining a plurality of candidate transactions for adding to a blockchain;
grouping the candidate transactions into a plurality of transaction groups;
creating a plurality of copies of at least a portion of a state tree data structure of a newest block of the blockchain;
associating the plurality of transaction groups respectively with the plurality of copies of the state tree data structure of the newest block of the blockchain, wherein the plurality of candidate transactions in the plurality of transaction groups have not yet been added the blockchain;
executing the candidate transactions in each of the transaction groups;
respectively updating the associated copies of the state tree data structure based on the execution of the candidate transactions in each of the transaction groups; and
generating a new state root node of a new block by at least merging the updated associated copies of the state tree data structure and propagating the updates to the new state root node.
16. The storage medium of claim 15 , wherein grouping the candidate transactions into the plurality of transaction groups comprises:
grouping two or more of the candidate transactions each involving at least one common transaction account under a same transaction group of the plurality of transaction groups.
17. The storage medium of claim 15 , wherein grouping the candidate transactions into the plurality of transaction groups comprises:
grouping two or more of the candidate transactions that do not involve any common transaction account under different transaction groups of the plurality of transaction groups.
18. The storage medium of claim 15 , wherein updating the associated copies of the state tree data structure comprises at least one of:
updating a balance of a transaction account in one of the associated copies of the state tree data structure;
removing the transaction account; or
adding a new transaction account.