Scalable BFT Consensus Mechanism Through Aggregated Signature Gossip

TL;DR

This paper introduces a scalable Byzantine Fault Tolerance (BFT) consensus mechanism utilizing an aggregated signature gossip protocol, enabling thousands of nodes to achieve high throughput efficiently with minimal messaging complexity.

Contribution

The paper proposes a novel non-interactive, leaderless BLS signature aggregation protocol that significantly reduces messaging complexity in BFT consensus for large networks.

Findings

Achieves consensus with O(log n) messages per node

Supports thousands of nodes with high transaction throughput

Proven correctness and efficiency of the protocol

Abstract

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.