An Optimization Strategy for PBFT Consensus Mechanism Based On Consortium Blockchain

Abstract

At present, the transaction delay of the consortium block chain applying the Practical Byzantine Fault Tolerance (PBFT) consensus protocol can only reach 2 to 5 seconds, and the throughput cannot reach tens of thousands. In addition as the number of nodes increases, the performance of the consortium block chain declines very quickly. The main challenge of previous research are to realize communication network topology of PBFT algorithm and high information exchange in the case of Byzantine failure, thus, this paper proposes an optimized Byzantine fault-tolerant algorithm to solve the performance bottleneck of the consortium chain. First of all, for the communication network structure of the whole network broadcast, we have reached an agreement on the transaction according to the pre-prepare and prepare phases of PBFT, and generally enter the commit phase, there is a high probability that the leader is honest, so we will communicate with the commit phase The network is optimized as a star communication structure. Second, combined with Tendermint, merge the view-change process of Byzantine failures of the normal consensus process, and switch the leader according to the longest chain principle. The algorithm is based on a partially synchronized network model to ensure the security and liveness of the protocol, and improve the performance and effective robustness.