MagpieBFT: An Efficient Asynchronous BFT Protocol for Blockchain

Asynchronous Byzantine fault tolerance (BFT) protocols have received increasing attention due to their better real network adaptation and non-leader model. Synchronous BFT protocols, such as the PBFT, may perform better but lose their liveness if the network turns unstable. In this paper, we propose MagpieBFT, a three-stage efficient asynchronous BFT protocol, which exhibits more throughput and less latency than HoneyBadgerBFT, DumboBFT and DispersedLedger. We adopt the heterogeneous transaction execution mode that allows each proposer processing separate transactions asynchronously to release the concurrent execution capability of the system. We lower the verification overhead of threshold signatures to improve the throughput of the system. We remove the asynchronous binary agreement stage to decrease the transaction latency. Experimental results demonstrate that when the node size reaches 80, the throughput of our protocol is 7.9 times of that in HoneyBadgerBFT, 2.5 times of that in DumboBFT, and 3.5 times of that in DispersedLedger.