Research on an improved practical byzantine fault tolerance algorithm

Abstract

PBFT is a consensus algorithm based on Byzantine fault tolerance that is widely used in current systems like blockchains. However, this algorithm has some problems that slow down its use on a large scale. In the interest of solving its problems, we have combined it with the Distributed Proof of Stake (DPoS) algorithm and smart contract technology to improve it and make it better. For this, Smart contracts were deployed in the network to improve the selection process of accounting nodes and participated in the operating process of the PBFT algorithm in order to make the selection process more transparent, incorruptible, and secure. Concerning the problem of the scalability of the nodes of the system, it will be possible to make a readjustment of the consensus algorithm to make it more flexible. The modification can be done by implementing readjustment counters, which will count the number of nodes in the network each time a consensus is reached or a node is ejected from the network, then automatically distributes the list of new nodes in the network. This new list of nodes will constitute the new network on which the new consensus will be based. To make it more secure and more sensitive to Byzantine faults, the sensitivity margin is improved.