Updating a state merkle tree

A computer-implemented system, comprising:

• one or more computers;
• and
• one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations for updating a blockchain network, wherein the operations comprise:
• accessing data related to a state Merkle tree, wherein the state Merkle tree stores a state of an account in the blockchain network;
• determining to-be-updated nodes that need to be updated in the state Merkle tree due to a state change of the account;
• extracting a first subtree and M second subtrees from the state Merkle tree based on the to-be-updated nodes, wherein the first subtree comprises a root node of the state Merkle tree, wherein there is no intersection between any two of the M second subtrees, wherein a root node of each second subtree is a to-be-updated node and is a child node of a bottom-layer node in the first subtree, and wherein M is an integer greater than 1;
• allocating the M second subtrees to N worker threads, wherein two or more of the N worker threads process in parallel the M second subtrees to obtain M updated root hashes corresponding to the M second subtrees, wherein N is an integer greater than 1;
• updating at least the first subtree from one or more leaf nodes of the first subtree to the root node of the state Merkle tree based on the M updated root hashes obtained from the N worker threads, to obtain an updated state Merkle tree;
• and
• verifying a first block of the blockchain network by comparing a hash value of a root node of the updated state Merkle tree with a value of a state root recorded in the first block, wherein the first block comprises a transaction set.

A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for updating a blockchain network, wherein the operations comprise:

• accessing data related to a state Merkle tree, wherein the state Merkle tree stores a state of an account in the blockchain network;
• determining to-be-updated nodes that need to be updated in the state Merkle tree due to a state change of the account;
• extracting a first subtree and M second subtrees from the state Merkle tree based on the to-be-updated nodes, wherein the first subtree comprises a root node of the state Merkle tree, wherein there is no intersection between any two of the M second subtrees, wherein a root node of each second subtree is a to-be-updated node and is a child node of a bottom-layer node in the first subtree, and wherein M is an integer greater than 1;
• allocating the M second subtrees to N worker threads, wherein two or more of the N worker threads process in parallel the M second subtrees to obtain M updated root hashes corresponding to the M second subtrees, wherein N is an integer greater than 1;
• updating at least the first subtree from one or more leaf nodes of the first subtree to the root node of the state Merkle tree based on the M updated root hashes obtained from the N worker threads, to obtain an updated state Merkle tree;
• and
• verifying a first block of the blockchain network by comparing a hash value of a root node of the updated state Merkle tree with a value of a state root recorded in the first block, wherein the first block comprises a transaction set.