Blockchain-based methods and apparatuses for processing data, devices and readable storage mediums

Patent metadata

Field	Value
Publication number	US-12348654-B2
Application number	US-202318218841-A
Country	US
Kind code	B2
Filing date	Jul 6, 2023
Priority date	Feb 24, 2022
Publication date	Jul 1, 2025
Grant date	Jul 1, 2025

Abstract

The present disclosure discloses methods, apparatus, and storage medium for processing blockchain-based data. The method includes: creating a first world state corresponding to an initial block; updating the first world state according to transactions in the initial block to obtain an initial update state, and performing processing of constructing a clean state tree on the initial update state based on a world state chain to obtain an updated first world state including a clean present world state tree; writing a first world state root corresponding to the clean present world state tree into the initial block to obtain a to-be-on-chained block, writing the to-be-on-chained block into a blockchain when the to-be-on-chained block is approved by consensus, committing the updated first world state to a latest on-chain world state step by step via the world state chain, and determining the updated first world state as a new consensus root world state.

First claim

What is claimed is:

1. A method for processing blockchain-based data, the method being executed by a computer device, the method comprising:
generating an initial block, and creating a first world state corresponding to the initial block; the first world state having a chained relationship pointing to a second world state, the second world state being a world state corresponding to a parent block of the initial block; the first world state and the second world state existing in a world state chain; in response to the parent block being a block with a largest block height in on-chained blocks, the second world state being a consensus root world state; the first world state in the world state chain being a latest on-chain world state; the consensus root world state having a chained relationship pointing to the latest on-chain world state; the latest on-chain world state being used for recording a latest world state corresponding to the on-chained block;
updating the first world state according to transactions in the initial block to obtain an initial updated state, and performing processing of constructing a clean state tree on the initial updated state based on the world state chain to obtain an updated first world state, the updated first world state comprising a clean present world state tree;
adding a first world state root corresponding to the clean present world state tree into the initial block to obtain a to-be-on-chained block, and transmitting the to-be-on-chained block to consensus nodes to cause the consensus node to perform consensus processing on the to-be-on-chained block based on the first world state root to obtain a consensus result; and
in response to the consensus result being a consensus pass result, incorporating the to-be-on-chained block into a blockchain, committing the updated first world state to the latest on-chain world state, and determining the updated first world state as a new consensus root world state, the new consensus root world state having a chained relationship pointing to the committed latest on-chain world state.

2. The method according to claim 1 , wherein the creating the first world state corresponding to the initial block comprises:
creating an initial world state corresponding to the initial block, the initial world state comprising a first previous world state pointer and a first tree node cache, the first tree node cache comprising a first previous tree node cache pointer; and
pointing the first previous world state pointer to a second world state corresponding to the parent block of the initial block, and pointing the first previous tree node cache pointer to a second tree node cache comprised in the second world state to obtain a first world state corresponding to the initial block.

3. The method according to claim 1 , wherein the updating the first world state according to transactions in the initial block to obtain an initial updated state comprises:
sequentially traversing transactions in the initial block to acquire a k th transaction in the initial block; k being a positive integer less than or equal to H; H being a total number of the transactions in the initial block;
creating a k th transaction world state corresponding to the k th transaction; the k th transaction world state having a chained relationship pointing to a (k−1) th committed world state; the (k−1) th committed world state being the first world state when k is 1;
executing the k th transaction, and performing, during the execution of the k th transaction, state updating processing on the k th transaction world state to obtain a k th updated transaction world state;
committing, when the k th transaction is executed successfully, the k th updated transaction world state to the (k−1) th committed world state to obtain a k th committed world state; and
using an H th committed world state as the initial updated state when k is equal to H.

4. The method according to claim 3 , wherein:
the k th transaction world state comprises account state mapping and a dirty account address set; and
the executing the k th transaction, and performing, during the execution of the k th transaction, state updating processing on the k th transaction world state to obtain a k th updated transaction world state comprise:
executing the k th transaction, and determine, during the execution of the k th transaction, to-be-updated data corresponding to the k th transaction, the to-be-updated data comprising a to-be-updated account address, a to-be-updated state data key and a to-be-updated state data value;
acquiring an account state corresponding to the to-be-updated account address based on the k th transaction world state as a to-be-updated account state, the to-be-updated account state comprising to-be-updated state data mapping and a to-be-updated dirty state data key set;
updating mapping relationship of the to-be-updated state data key and the to-be-updated state data value into the to-be-updated state data mapping and inserting the to-be-updated state data key into the to-be-updated dirty state data key set to obtain a present account state; and
updating the mapping relationship of the to-be-updated account address and the present account state into the account state mapping comprised in the k th transaction world state, and inserting the to-be-updated account address into the dirty account address set comprised in the k th transaction world state to obtain the k th updated transaction world state.

5. The method according to claim 4 , wherein the acquiring the account state corresponding to the to-be-updated account address based on the k th transaction world state as the to-be-updated account state comprises:
performing account state mapping sequence search from the k th transaction world state to the latest on-chain world state based on the to-be-updated account address;
in response to an account state having a mapping relationship with the to-be-updated account address being found during the account state mapping sequence search, taking the first found account state having a mapping relationship with the to-be-updated account address as a to-be-updated account state; and
in response to an account state having a mapping relationship with the to-be-updated account address being not found during the account state mapping sequence search, acquiring a to-be-updated state tree root corresponding to the to-be-updated account address based on a world state tree in the latest on-chain world state, and establishing a to-be-updated account state according to the to-be-updated account address and the to-be-updated state tree root.

6. The method according to claim 4 , wherein the committing, when the k th transaction is executed successfully, the k th updated transaction world state to the (k−1) th committed world state to obtain the k th committed world state comprises:
traversing account addresses in the dirty account address set comprised in the k th updated transaction world state to sequentially acquire a j th account address; j being a positive integer less than or equal to I; I being the total number of the account addresses in the dirty account address set comprised in the k th updated transaction world state;
acquiring a present account state corresponding to the j th account address from the account state mapping comprised in the k th updated transaction world state;
acquiring a previous account state of the j th account address from the (k−1) th committed world state;
committing the present account state corresponding to the j th account address to the previous account state of the j th account address, and inserting the j th account address into the dirty account address set comprised in the (k−1) th committed world state to obtain a j th

Assignees

• Tencent Tech Shenzhen Co Ltd

Inventors

• Feng Haoming
• Yan Zheming
• Tu Haitao
• He Libao
• Chen Jiabao

Classifications

• H04L2209/463

  Electronic voting · CPC title

• G06F21/64

  Protecting data integrity, e.g. using checksums, certificates or signatures · CPC title

• H04L9/0891

  Revocation or update of secret information, e.g. encryption key update or rekeying · CPC title

• Y02D10/00

  Energy efficient computing, e.g. low power processors, power management or thermal management · CPC title

• G06F16/27

  Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor · CPC title