Blockchain node synchronization method and device using trust mechanism

Patent metadata

Field	Value
Publication number	US-11228386-B2
Application number	US-201816760188-A
Country	US
Kind code	B2
Filing date	Sep 20, 2018
Priority date	Jun 29, 2018
Publication date	Jan 18, 2022
Grant date	Jan 18, 2022

Abstract

The present application proposes a blockchain node synchronization method and device using a trust mechanism. The method comprises: acquiring data throughput history data of each node in a routing table of a node to be synchronized; acquiring synchronization success rate history data of each node in the routing table of the node to be synchronized; acquiring a total difficulty value of a blockchain currently stored by each node in the routing table of the node to be synchronized; determining a credibility of each node in the routing table according to the data throughput history data, the synchronization success rate history data, and the total difficulty value of the blockchain; and selecting, according to the credibility of each node, a target node for synchronization, and synchronizing, according to blockchain data stored by the target node, the node to be synchronized.

First claim

What is claimed is:

1. A method for synchronizing blockchain nodes based on a trust mechanism, comprising:
obtaining historical data of data throughput of each node in a routing table of a node to be synchronized;
obtaining historical data of synchronization success rate of each node in the routing table of the node to be synchronized;
obtaining a total difficulty value of a blockchain currently stored by each node in the routing table of the node to be synchronized;
determining a credibility of each node in the routing table according to the historical data of data throughput, the historical data of synchronization success rate, and the total difficulty value of the blockchain; and
selecting a target node for synchronization according to the credibility of each node, and synchronizing the node to be synchronized according to the blockchain stored by the target node.

2. The method according to claim 1 , wherein determining the credibility of each node in the routing table according to the historical data of data throughput, the historical data of synchronization success rate, and the total difficulty value of the blockchain, comprises:
calculating an average value of the data throughput of each node in a recent predefined time interval according to the historical data of data throughput, and using the average value as a data throughput parameter;
obtaining a reputation value of each node according to the historical data of synchronization success rate, wherein the reputation value is a value calculated according to a predefined rule based on the historical data of synchronization success rate; and
determining the credibility of each node according to the data throughput parameter, the reputation value, and the total difficulty value of the blockchain.

3. The method according to claim 2 , wherein determining the credibility of each node in the routing table according to the data throughput parameter, the reputation value, and the total difficulty value of the blockchain, comprises:
for each node, performing a weighted summation on the data throughput parameter, the reputation value, and the total difficulty value of the blockchain according to predefined weighting coefficients, and determining the credibility of the node according to a result of the weighted summation.

4. The method according to claim 2 , wherein obtaining the reputation value of each node according to the historical data of synchronization success rate comprises calculating the reputation value of each node recursively according to the following formula:

ξ
=

ξ

-
1

+

N

N
+
1

·
φ

where ξ represents a current reputation value of the node; ξ −1 represents a historical reputation value of the node most recently calculated; N is a number of times that the node is successfully synchronized as the target node in a predefined number of most recent node synchronization operations; and φ is a predefined reward and punishment coefficient.

5. The method according to claim 3 , wherein obtaining the reputation value of each node according to the historical data of synchronization success rate comprises calculating the reputation value of each node recursively according to the following formula:

ξ
=

ξ

-
1

+

N

N
+
1

·
φ

where ξ represents a current reputation value of the node; ξ −1 represents a historical reputation value of the node most recently calculated; N is a number of times that the node is successfully synchronized as the target node in a predefined number of most recent node synchronization operations; and φ is a predefined reward and punishment coefficient.

6. A non-transitory computer-readable storage medium having a computer program stored thereon, wherein when the program is executed by a processor, the processor is caused to implement the method for synchronizing blockchain nodes based on a trust mechanism comprising:
obtaining historical data of data throughput of each node in a routing table of a node to be synchronized;
obtaining historical data of synchronization success rate of each node in the routing table of the node to be synchronized;
obtaining a total difficulty value of a blockchain currently stored by each node in the routing table of the node to be synchronized;
determining a credibility of each node in the routing table according to the historical data of data throughput, the historical data of synchronization success rate, and the total difficulty value of the blockchain; and
selecting a target node for synchronization according to the credibility of each node, and synchronizing the node to be synchronized according to the blockchain stored by the target node.

7. A computing device, comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein when the computer program is executed by the processor, the processor is configured to synchronize blockchain nodes based on a trust mechanism by:
obtaining historical data of data throughput of each node in a routing table of a node to be synchronized;
obtaining historical data of synchronization success rate of each node in the routing table of the node to be synchronized;
obtaining a total difficulty value of a blockchain currently stored by each node in the routing table of the node to be synchronized;
determining a credibility of each node in the routing table according to the historical data of data throughput, the historical data of synchronization success rate, and the total difficulty value of the blockchain; and
selecting a target node for synchronization according to the credibility of each node, and synchronizing the node to be synchronized according to the blockchain stored by the target node.

8. The non-transitory computer-readable storage medium according to claim 6 , wherein determining the credibility of each node in the routing table according to the historical data of data throughput, the historical data of synchronization success rate, and the total difficulty value of the blockchain, comprises:
calculating an average value of the data throughput of each node in a recent predefined time interval according to the historical data of data throughput, and using the average value as a data throughput parameter;
obtaining a reputation value of each node according to the historical data of synchronization success rate, wherein the reputation value is a value calculated according to a predefined rule based on the historical data of synchronization success rate; and
determining the credibility of each node according to

Assignees

• Beijing Kingsoft Internet Security Software Co Ltd

Inventors

• Yang Wenyu
• Gao Chunmeng

Classifications

• H04L43/0888 Primary

  Throughput · CPC title

• H04L2209/56

  Financial cryptography, e.g. electronic payment or e-cash · CPC title

• H04L9/50

  using hash chains, e.g. blockchains or hash trees · CPC title

• H04L45/7453

  using hashing · CPC title

• H04L9/0643

  Hash functions, e.g. MD5, SHA, HMAC or f9 MAC · CPC title