An Byzantine fault-tolerant consensus algorithm based on MuSig

Abstract

In view of the disadvantages of PBFT consensus algorithm such as large traffic and complicated view change, a Byzantine fault-tolerant consensus algorithm based on MuSig, namely MSBFT consensus algorithm, is proposed. The algorithm adopts multi-signature MuSig and pipeline idea, and optimizes the consensus process, view change protocol and checkpoint protocol. The communication complexity of the consensus process, view change protocol, and check point protocol in MSBFT is reduced from O(n2), O(n3), and O(n2) in PBFT to O(n) respectively. Experimental results show that compared with ABFT, PBFT and SBFT, the consensus efficiency and throughput of MSBFT algorithm are greatly improved.