A Derivative PBFT Blockchain Consensus Algorithm With Dual Primary Nodes Based on Separation of Powers-DPNPBFT

Abstract

The Practical Byzantine Fault Tolerant (PBFT) consensus algorithm has many advantages, which makes PBFT utilized widely. Nonetheless, PBFT is not suitable for large-scale node scenarios due to its high communication complexity and it also has an apparent disadvantage of inadequate fault tolerance. The typically derived PBFT algorithms focus on reducing communication complexity at the cost of diminished system security or fault tolerance. In this paper, Dual-Primary-Node derived Practical Byzantine Fault Tolerance (DPNPBFT) is proposed to achieve the best balance of the above three performances. First, DPNPBFT selects dual master nodes based on the idea of power separation. The two master nodes check balance and supervise each other to avoid excessive centralization as a single master node system. It also reduces the communication complexity of the replica node, which only communicates with the master node. Furthermore, we designed the architecture of DPNPBFT to get a practical 49% fault tolerance rate, and it is close to the current mainstream Proof of Work and Proof of Stake algorithms. Experimental results demonstrate that DPNPBFT has O(N) level communication complexity and excellent anti-host node malicious performance. The Transactions Per Second of DPNPBFT is stable at 1700. It proves DPNPBFT has the best performance balance and excellent comprehensive performance for large-scale Internet of Things application scenarios.