Byzantine fault tolerant consensus mechanism based on multi-group voting

Abstract

This paper fully studies PBFT and its improved consensus mechanism. PBFT, as a classic consensus mechanism in the blockchain to solve the Byzantine fault tolerance problem, has a fault tolerance rate of 33%, but it has problems such as lack of dynamics, no scalability, and the consensus efficiency decreases with the increase of the number of nodes. Although the improved consensus mechanism of PBFT improves the existing problems of PBFT to a certain extent, it still has other problems such as high energy consumption and delay, and it cannot be put into use very well. Based on the above problems, this paper proposes a Byzantine fault-tolerant consensus mechanism based on a multi-group voting mechanism. The biggest problem with PBFT is that it is not dynamic. When the nodes in the system change dynamically, it will crash, and it must be restarted to run. In response to this problem, this improved method introduces a multi-group voting mechanism, which enhances the fault tolerance of the consensus mechanism by grouping nodes in the network and generating production nodes through two-stage voting. At the same time, in the production node consensus stage, the production node replacement protocol is used to improve the security of the consensus mechanism and make the improved PBFT dynamic. After completing the improved design of the consensus mechanism, compared with the PBFT consensus mechanism, it is superior to PBFT in terms of energy consumption, delay, fault tolerance, etc.