Abstract
Nowadays Practical Byzantine Fault Tolerance (PBFT) algorithm has become the most extensive consensus algorithm in the alliance chain. However, the PBFT algorithm is usually only applicable to small networks due to high communication complexity and poor scalability. Although there have been many improved algorithms for PBFT in recent years, they ignore fault tolerance and democracy. Therefore, to meet the requirements of a high degree of decentralization and fault tolerance of blockchain-based scenarios. This paper proposes a high fault tolerance consensus algorithm NBFT, which follows the principle of decentralization and democratization of blockchain and ensures the improvement of performance in fault tolerance upper limit and scalability. First, we use the consistent hash algorithm to group the consensus nodes to avoid much communication between nodes, reduce the communication complexity of the network, and improve the scalability of the network. Second, to ensure the fault-tolerant ability of the grouping consensus, the nodal decision broadcast model and threshold vote-counting model are proposed first. Combined with the proposed two models, the joint fault analysis of nodes is carried out, and the fault tolerance upper limit is more than 1/3. Then, the Faulty Number Determined (FND) model is introduced to simulate the experiment, and the results are verified.
Highlights
The Byzantine fault tolerance (BFT) algorithm has been a widespread concern since it was proposed by Leslie Lamport, Robert Shostak, and Marshall Pease in 1982 [1]
It was not until Barbara Liskov et al proposed the practical Byzantine fault tolerance (PBFT) algorithm [2] in 1999, which reduced the complexity of the original Byzantine fault tolerance algorithm from exponential to polynomial, that the Byzantine fault tolerance algorithm was introduced into the engineering field
We introduce the FND model [4] and conduct a simulated consensus experiment in combination with the two models established in Part B and Part C of Section IV to analyze the NBFT fault-tolerant upper limit further
Summary
The Byzantine fault tolerance (BFT) algorithm has been a widespread concern since it was proposed by Leslie Lamport, Robert Shostak, and Marshall Pease in 1982 [1] It has not been applied in practice due to its high communication complexity. Literature [7,8,9,10] combines PBFT with a public chain consensus algorithm to improve consensus efficiency.The core idea is to select a certain number of nodes as committees through Proof-of-Work (PoW) [11], Proof-of-Stake (PoS) [12], and other. The consensus nodes are screened through the reputation mechanism, and the consensus of the whole network is turned into the participation of some nodes or committees These algorithms can effectively reduce the complexity of communication and improve the ability of network extension.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
