Search

To solve the problem that the PBFT consensus algorithm can 't support large-scale network with the quadratic communication complexity of 0(n²) in consortium blockchain, this paper proposed an ABFT algorithm. Firstly, it improved the information interaction mode of nodes in PBFT consensus algorithm on multiple phases. On the prepare phase,each replica node sent information and signatured to the master node for verification. On the commit phase, the master node collected and verified the signatures, and combined with BLS signature, it aggregated the multiple verified signatures into an aggregating signature, which would be broadcast to all other replica nodes with other necessary information for verification. Moreover, ABFT algorithm the added the finish phase to prevent most replica nodes from timing out and causing view change. The ABFT algorithm reduced the complexity of network communication to 0(n). Experiments show that in the case of multiple nodes, the ABFT algorithm can effectively reduce the consensus delay and improve the transaction throughput, which makes the consortium blockchain being able to accommodate a large number of nodes [ABSTRACT FROM AUTHOR]