Improved Fault-Tolerant Consensus Based on the PBFT Algorithm

Nowadays Practical Byzantine Fault Tolerance (PBFT) algorithm has become the most extensive consensus in alliance chain. However, PBFT is usually only applicable to small networks due high communication complexity and poor scalability. Although there have been many improved algorithms for recent years, they ignore fault tolerance democracy. Therefore, meet requirements of a degree decentralization blockchain-based scenarios. This paper proposes NBFT, which follows principle democratization blockchain ensures improvement performance upper limit First, we use consistent hash group nodes avoid much between nodes, reduce network, improve scalability network. Second, ensure fault-tolerant ability grouping consensus, nodal decision broadcast model threshold vote-counting are proposed first. Combined with two models, joint analysis carried out, more than 1/3. Then, Faulty Number Determined (FND) introduced simulate experiment, results verified.