Improved Practical Byzantine Fault Tolerance Consensus Mechanism with Two-stage Verification

Abstract

Blockchain technology is widely used in finance, supply chain, Internet of Things and other fields because of its advantages of anti-tampering, decentralization, and traceability. As the core factor affecting the performance of blockchain, consensus algorithm with good performance is the current research focus and goal. Aiming at the problem of insufficient performance and scalability of Practical Byzantine Fault Tolerance (PBFT), a two-stage verification algorithm is proposed. The algorithm improves the three-stage verification of PBFT into the confirmation stage and the review stage. The block contains the confirmation information of the previous block, and the block release and information confirmation are carried out synchronously, which saves the communication cost and reduces the number of communications between nodes, so that the As the system throughput increases, the impact of network scale on performance becomes smaller. The simulation shows that the performance of the algorithm is improved by 50% compared with the PBFT algorithm. After the node reaches the maximum number of connections, the algorithm is limited by the size of the node and becomes smaller, and the scalability of the system is improved.