Double-layer grouping Byzantine fault-tolerant consensus method and system

Abstract

The invention discloses a double-layer grouping Byzantine fault-tolerant consensus method and system. The method comprises the following steps: S1, determining node groups; S2, for each group of nodes, selecting a part of nodes from the nodes as committee nodes, forming committee of the group, taking the remaining nodes except the committee nodes as common nodes, and selecting a main node of each group from the committee nodes; S3, building a block chain network; S4, if a certain group of committee receives a proposal request, the main node of the group generating a block according to the proposal request and sending the block to other committee nodes of the group for a first round of consensus, and if the first round of consensus passes, generating an initial block and sending the initial block to the common node of each group; and S5, performing a second round of consensus on the initial block by the common node of each group, and if the second round of consensus is passed, chaining the initial block and storing the initial block in a local account book. According to the method, a double-layer grouping consensus structure is adopted, and the system robustness is improved on the premise that low communication complexity is guaranteed.

Description

technical field [0001] The invention belongs to the technical field of block chains, and more specifically relates to a two-layer group Byzantine fault-tolerant consensus method and system. Background technique [0002] In the prior art, the Byzantine Fault Tolerance consensus method mainly has the following methods: [0003] A Practical Byzantine Fault Tolerance protocol (Practical Byzantine Fault Tolerance, PBFT) is proposed in the prior art, which is the most commonly used distributed consensus method. This method removes the influence of malicious behavior of Byzantine nodes through mutual communication between nodes, and uses pre-preparation, preparation , Promise three stages to ensure the consistency of nodes. However, the pairwise interaction between nodes makes the communication complexity of PBFT as high as O(n 2 ), when the number of nodes is large, it will easily lead to network congestion and poor scalability. [0004] In order to reduce the communication com...

AI Technical Summary

Problems solved by technology

However, there is still a lack of methods that take into account both communication complexity and system robustness.

Moreover, the above research has a high generality and has not been optimized for specific scenarios or applications, and there is still a lot of room for improvement in algorithm performance.

Images