Scalable BFT Consensus Mechanism Through Aggregated Signature Gossip

In this paper, we present a new BFT consensus mechanism which enables thousands of nodes to participate in the consensus process, and supports very high transaction throughput. This is achieved via an aggregated signature gossip protocol which can significantly reduce the messaging complexity and thus allows a large number of nodes to reach consensus quickly. The proposed aggregated signature gossip protocol leverages a non-interactive leaderless BLS signature aggregation scheme. We have proven the correctness of the protocol, and analyzed its efficiency. In our analysis, each node only needs to send and receive O(logn) messages to reach agreement, where each message just contains a couple kilobytes of data.