2019/11/12 by Jieyi Long, Long, Jieyi, Ribao Wei +1 · 1 citation
Computer Science · #Blockchain Technology Applications and Security #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Parallel #Peer-to-Peer Network Technologies #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1911.04698
openalex publication_date 2019/11/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.