PBFT consensus algorithm based on reward and punishment mechanism

Abstract

The Practical Byzantine Fault Tolerant (PBFT) algorithm is a common consensus algorithm for coalition chain, but it has some problems such as low efficiency, poor scalability and high communication complexity. To solve these problems, this paper proposes a PBFT consensus algorithm based on reward and punishment mechanism (RP-PBFT). Based on the PBFT algorithm, the algorithm rewards and penalises the performance of each node in the consensus process, and divides the nodes into three categories according to their reputation value. The two categories of nodes with high reputation value can participate in the consensus, reduce the scale of nodes participating in the consensus, improve the security and simplify the three-stage consensus to improve the efficiency. The experimental results show that the communication complexity of RP-PBFT algorithm is significantly reduced, the throughput is increased, the delay is reduced, and the system efficiency is improved.