Academy & Industry Research Collaboration Center (AIRCC)

Volume 10, Number 19, December 2020

Research on Dynamic PBFT Consensus Algorithm


Cao Xiaopeng and Shi Linkai, Xi’an University of Posts and Telecommunications, China


The practical Byzantine fault-tolerant algorithm does not add nodes dynamically. It is limited in practical application. In order to add nodes dynamically, Dynamic Practical Byzantine Fault Tolerance Algorithm (DPBFT) was proposed. Firstly, a new node sends request information to other nodes in the network. The nodes in the network decide their identities and requests. Then the nodes in the network reverse connect to the new node and send block information of the current network, the new node updates information. Finally, the new node participates in the next round of consensus, changes the view and selects the master node. This paper abstracts the decision of nodes into the undirected connected graph. The final consistency of the graph is used to prove that the proposed algorithm can adapt to the network dynamically. Compared with the PBFT algorithm, DPBFT has better fault tolerance and lower network bandwidth.


Practical Byzantine Fault Tolerance, Blockchain, Consensus Algorithm, Consistency Analysis.