Granted Patent B2

US 12,452,087 · App. 18/072,621 · Granted Oct 21, 2025

Inventors: Zongyou Wang (Shenzhen, CN); Hu Lan (Shenzhen, CN); Pan Liu (Shenzhen, CN); Yifang Shi (Shenzhen, CN); Kaiban Zhou (Shenzhen, CN); Jinsong Zhang (Shenzhen, CN); Qucheng Liu (Shenzhen, CN); Huankun Huang (Shenzhen, CN); Gengliang Zhu (Shenzhen, CN); Zhiyong Liao (Shenzhen, CN)

Assignee: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED

H04L9/50G06F16/2365G06F16/27H04L9/3297H04L2209/56

Abstract

Claims (72)

1. A data communication method, performed by a computer device acting as a lightweight node of a blockchain data network, the method comprising:

receiving data from an associated block having an association with the lightweight node, the data comprising a plurality of transactions that are associated with the lightweight node and that are in the associated block, and a statistical proof transaction list, each of the plurality of transactions having their respective corresponding transaction visible addresses of lightweight nodes that can access the transaction, the statistical proof transaction list comprising a plurality of statistical proof transactions, each of the plurality of statistical proof transactions indicating a quantity of transactions that are visible to a lightweight node represented by a corresponding transaction visible address, and the plurality of statistical proof transactions being obtained by encrypting the transaction visible addresses corresponding to the transaction nodes, and the quantities of the transaction visible addresses in the associated block;

recognizing a target index of the lightweight node in the statistical proof transaction list;

obtaining an encrypted path set based on the associated transactions, the encrypted path set comprising encrypted paths of the associated transactions and an encrypted path of the statistical proof transaction list; and

determining validity of the associated transactions according to the statistical proof transaction list, the target index, and the encrypted path set, the validity being used for representing accuracy and completeness of the associated transactions, further including:

checking, based on the encrypted path set, whether the associated transactions are accurate, and obtaining the accuracy indicating that content related to the associated transactions is not tampered with; and

checking, based on the target index, the statistical proof transaction list, and the encrypted path of the statistical proof transaction list, whether the associated transactions are complete, and obtaining the completeness indicating that no content related to the associated transactions is missing.

2. The method according to claim 1 , wherein there are a plurality of associated transactions, the plurality of associated transactions comprise a first associated transaction and a second associated transaction, and the encrypted paths of the plurality of associated transactions comprises a first encrypted path corresponding to the first associated transaction and a second encrypted path corresponding to the second associated transaction; and

the checking, based on the encrypted path set, whether the associated transactions are accurate, and obtaining the accuracy comprises:

determining a first Merkle root according to the first associated transaction and the first encrypted path;

determining a second Merkle root according to the second associated transaction and the second encrypted path; and

checking, based on the first Merkle root and the second Merkle root, whether the associated transactions are accurate, and obtaining the accuracy.

3. The method according to claim 2 , wherein the checking, based on the first Merkle root and the second Merkle root, whether the associated transactions are accurate, and obtaining the accuracy comprises:

receiving a block Merkle root of the associated block;

determining, when the first Merkle root, the second Merkle root, and the block Merkle root are all the same as each other, that the associated transactions are accurate; and

determining, when at least two Merkle roots of the first Merkle root, the second Merkle root, and the block Merkle root are not the same as each other, that the associated transactions are inaccurate.

4. The method according to claim 1 , wherein the checking, based on the target index, the statistical proof transaction list, and the encrypted path of the statistical proof transaction list, whether the associated transactions are complete, and obtaining the completeness comprises:

checking, according to the encrypted path of the statistical proof transaction list, whether the statistical proof transaction list is valid;

receiving the transaction quantity of the associated transactions from the associated block in a case of checking and determining that the statistical proof transaction list is valid;

searching the statistical proof transaction list for a target statistical proof transaction corresponding to the target index; and

checking, according to the statistical proof transaction list, the target statistical proof transaction, the transaction quantity, and a node address of the lightweight node, whether the associated transactions are complete, and obtaining the completeness.

5. The method according to claim 4 , wherein the checking, according to the statistical proof transaction list, the target statistical proof transaction, the transaction quantity, and a node address of the lightweight node, whether the associated transactions are complete, and obtaining the completeness comprises:

performing a superposition operation on the transaction quantity and the node address of the lightweight node, to obtain a target superposition value, and performing an encryption operation on the target superposition value through an encryption algorithm, to obtain a target service transaction of the lightweight node; and

determining, when the target statistical proof transaction is the same as the target service transaction, that the associated transactions are complete.

6. A computer device acting as a lightweight node of a blockchain data network, comprising a memory and a processor, the memory storing a set of program code that, when executed by the processor, cause the computer device to perform a data communication method including:

receiving data from an associated block having an association with the lightweight node, the data comprising a plurality of transactions that are associated with the lightweight node and that are in the associated block, and a statistical proof transaction list, each of the plurality of transactions having their respective corresponding transaction visible addresses of lightweight nodes that can access the transaction, the statistical proof transaction list comprising a plurality of statistical proof transactions, each of the plurality of statistical proof transactions indicating a quantity of transactions that are visible to a lightweight node represented by a corresponding transaction visible address, and the plurality of statistical proof transactions being obtained by encrypting the transaction visible addresses corresponding to the transaction nodes, and the quantities of the transaction visible addresses in the associated block;

recognizing a target index of the lightweight node in the statistical proof transaction list;

obtaining an encrypted path set based on the associated transactions, the encrypted path set comprising encrypted paths of the associated transactions and an encrypted path of the statistical proof transaction list; and

determining validity of the associated transactions according to the statistical proof transaction list, the target index, and the encrypted path set, the validity being used for representing accuracy and completeness of the associated transactions, further including:

checking, based on the encrypted path set, whether the associated transactions are accurate, and obtaining the accuracy indicating that content related to the associated transactions is not tampered with; and

checking, based on the target index, the statistical proof transaction list, and the encrypted path of the statistical proof transaction list, whether the associated transactions are complete, and obtaining the completeness indicating that no content related to the associated transactions is missing.

7. The computer device according to claim 6 , wherein there are a plurality of associated transactions, the plurality of associated transactions comprise a first associated transaction and a second associated transaction, and the encrypted paths of the plurality of associated transactions comprises a first encrypted path corresponding to the first associated transaction and a second encrypted path corresponding to the second associated transaction; and

the checking, based on the encrypted path set, whether the associated transactions are accurate, and obtaining the accuracy comprises:

determining a first Merkle root according to the first associated transaction and the first encrypted path;

determining a second Merkle root according to the second associated transaction and the second encrypted path; and

checking, based on the first Merkle root and the second Merkle root, whether the associated transactions are accurate, and obtaining the accuracy.

8. The computer device according to claim 7 , wherein the checking, based on the first Merkle root and the second Merkle root, whether the associated transactions are accurate, and obtaining the accuracy comprises:

receiving a block Merkle root of the associated block;

determining, when the first Merkle root, the second Merkle root, and the block Merkle root are all the same as each other, that the associated transactions are accurate; and

determining, when at least two Merkle roots of the first Merkle root, the second Merkle root, and the block Merkle root are not the same as each other, that the associated transactions are inaccurate.

9. The computer device according to claim 6 , wherein the checking, based on the target index, the statistical proof transaction list, and the encrypted path of the statistical proof transaction list, whether the associated transactions are complete, and obtaining the completeness comprises:

checking, according to the encrypted path of the statistical proof transaction list, whether the statistical proof transaction list is valid;

receiving the transaction quantity of the associated transactions from the associated block in a case of checking and determining that the statistical proof transaction list is valid;

searching the statistical proof transaction list for a target statistical proof transaction corresponding to the target index; and

checking, according to the statistical proof transaction list, the target statistical proof transaction, the transaction quantity, and a node address of the lightweight node, whether the associated transactions are complete, and obtaining the completeness.

10. The computer device according to claim 9 , wherein the checking, according to the statistical proof transaction list, the target statistical proof transaction, the transaction quantity, and a node address of the lightweight node, whether the associated transactions are complete, and obtaining the completeness comprises:

performing a superposition operation on the transaction quantity and the node address of the lightweight node, to obtain a target superposition value, and performing an encryption operation on the target superposition value through an encryption algorithm, to obtain a target service transaction of the lightweight node; and

determining, when the target statistical proof transaction is the same as the target service transaction, that the associated transactions are complete.

11. A non-transitory computer-readable storage medium, storing a computer program, the computer program comprising program instructions that, when executed by a processor of a computer device acting as a lightweight node of a blockchain data network, cause the computer device to perform a data communication method including:

receiving data from an associated block having an association with the lightweight node, the data comprising a plurality of transactions that are associated with the lightweight node and that are in the associated block, and a statistical proof transaction list, each of the plurality of transactions having their respective corresponding transaction visible addresses of lightweight nodes that can access the transaction, the statistical proof transaction list comprising a plurality of statistical proof transactions, each of the plurality of statistical proof transactions indicating a quantity of transactions that are visible to a lightweight node represented by a corresponding transaction visible address, and the plurality of statistical proof transactions being obtained by encrypting the transaction visible addresses corresponding to the transaction nodes, and the quantities of the transaction visible addresses in the associated block;

recognizing a target index of the lightweight node in the statistical proof transaction list;

obtaining an encrypted path set based on the associated transactions, the encrypted path set comprising encrypted paths of the associated transactions and an encrypted path of the statistical proof transaction list; and

determining validity of the associated transactions according to the statistical proof transaction list, the target index, and the encrypted path set, the validity being used for representing accuracy and completeness of the associated transactions, further including:

checking, based on the encrypted path set, whether the associated transactions are accurate, and obtaining the accuracy indicating that content related to the associated transactions is not tampered with; and

checking, based on the target index, the statistical proof transaction list, and the encrypted path of the statistical proof transaction list, whether the associated transactions are complete, and obtaining the completeness indicating that no content related to the associated transactions is missing.

12. The non-transitory computer-readable storage medium according to claim 11 , wherein there are a plurality of associated transactions, the plurality of associated transactions comprise a first associated transaction and a second associated transaction, and the encrypted paths of the plurality of associated transactions comprises a first encrypted path corresponding to the first associated transaction and a second encrypted path corresponding to the second associated transaction; and

the checking, based on the encrypted path set, whether the associated transactions are accurate, and obtaining the accuracy comprises:

determining a first Merkle root according to the first associated transaction and the first encrypted path;

determining a second Merkle root according to the second associated transaction and the second encrypted path; and

checking, based on the first Merkle root and the second Merkle root, whether the associated transactions are accurate, and obtaining the accuracy.

13. The non-transitory computer-readable storage medium according to claim 12 , wherein the checking, based on the first Merkle root and the second Merkle root, whether the associated transactions are accurate, and obtaining the accuracy comprises:

receiving a block Merkle root of the associated block;

determining, when the first Merkle root, the second Merkle root, and the block Merkle root are all the same as each other, that the associated transactions are accurate; and

determining, when at least two Merkle roots of the first Merkle root, the second Merkle root, and the block Merkle root are not the same as each other, that the associated transactions are inaccurate.

14. The non-transitory computer-readable storage medium according to claim 11 , wherein the checking, based on the target index, the statistical proof transaction list, and the encrypted path of the statistical proof transaction list, whether the associated transactions are complete, and obtaining the completeness comprises:

checking, according to the encrypted path of the statistical proof transaction list, whether the statistical proof transaction list is valid;

receiving the transaction quantity of the associated transactions from the associated block in a case of checking and determining that the statistical proof transaction list is valid;

searching the statistical proof transaction list for a target statistical proof transaction corresponding to the target index; and

checking, according to the statistical proof transaction list, the target statistical proof transaction, the transaction quantity, and a node address of the lightweight node, whether the associated transactions are complete, and obtaining the completeness.

15. The non-transitory computer-readable storage medium according to claim 14 , wherein the checking, according to the statistical proof transaction list, the target statistical proof transaction, the transaction quantity, and a node address of the lightweight node, whether the associated transactions are complete, and obtaining the completeness comprises:

performing a superposition operation on the transaction quantity and the node address of the lightweight node, to obtain a target superposition value, and performing an encryption operation on the target superposition value through an encryption algorithm, to obtain a target service transaction of the lightweight node; and

determining, when the target statistical proof transaction is the same as the target service transaction, that the associated transactions are complete.

Assignments (1)

Priority Claims (1)

Continuity (2)

References Cited (26)