Workload-based randomization byzantine fault tolerance consensus protocol

Abstract

This paper introduces a new Byzantine fault tolerance protocol called workload-based randomization Byzantine fault tolerance protocol (WRBFT). Improvements are made to the Practical Byzantine Fault Tolerance (PBFT), which has an important position in the Byzantine Fault consensus algorithm. Although PBFT has numerous advantages, its primary node selection mechanism is overly fixed, the communication overhead of the consensus process is also high, and nodes cannot join and exit dynamically. To solve these problems, the WRBFT proposed in this paper combines node consensus workload and verifiable random function (VRF) to randomly select the more reliable primary node that dominates the consensus. The selection of the nodes involved in the consensus is based on the node workload, and the optimization of the agreement protocol of the PBFT is also based on this. Simulation results show that the WRBFT has higher throughput, lower consensus latency, and higher algorithmic efficiency compared to the PBFT.

Keywords

• Blockchain
• Consensus algorithm
• BFT
• PBFT
• Verifiable random function