Block chain construction method based on node reputation and partition consensus
A construction method and technology of blockchain, applied in the field of IoT data storage, can solve the problems such as the limited processing capacity of the blockchain system, the processing capacity of a single computing node, the damage to the security of the blockchain network, and the inability to reach consensus on partitions. Achieve the effect of improving transaction throughput, improving effectiveness, ensuring stability and strength
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0049] First input the node set n and the transaction W, the n-node blockchain network is divided into T disconnected committee partitions, and the size of each partition is T n for:
[0050]
[0051] Within the committee, the number of failed nodes Need to meet:
[0052]
[0053] Then, the value of the number of partitions T is:
[0054]
[0055] Combined with the calculation of complexity, we get:
[0056]
[0057] In the formula, t g is the average time to reach consensus within the committee, t t is the average time to verify transactions on the chain;
[0058] make
[0059]
[0060] Thus, the optimal partition number T value is obtained. Combining the two different perspectives of consensus security and consensus complexity, the optimal partition size is obtained.
[0061] 104. Establish a master-slave branch multi-chain blockchain structure according to the partition, so that each partition has its own partition chain, and the entire blockchain netw...
Embodiment 2
[0065] After obtaining the optimal partition size, the goal of this work is to divide the IoT nodes into multiple committees fairly and randomly, so that each partition can process transactions independently and in parallel. In order to improve the efficiency of partitioning and ensure the randomness of partitioning, this paper proposes a node allocation technology based on node reputation value.
[0066] First, based on the calculated partition size T and the number of nodes in each partition T n , when the partition size T=1, no partition algorithm is needed. Otherwise, it is partitioned based on the reputation value. Nodes with a reputation value reaching a threshold of a good level are randomly assigned to partitions. Among them, the nodes with the top 45% reputation value will be partitioned by unique ID and hash value, where the hash value is the new hash value B of the node’s last agreed block (h-1) Calculated, namely:
[0067] I(h)=H(B (h-1) , ID) (5)
[0068] I(...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


