Consensus Mechanisms
Research Papers
Academic and industry research
The Latest Gossip on BFT Consensus
Ethan Buchman, Jae Kwon, Zarko Milosevic
This report provides a comprehensive overview and analysis of various Byzantine Fault Tolerance (BFT) consensus protocols, particularly in the context of distributed systems and blockchain technology. It surveys a broad range of classical and modern BFT protocols, categorizing them based on their approaches to achieving consensus in asynchronous or partially synchronous environments, even when some nodes are malicious. The paper discusses fundamental concepts like message complexity, rounds of communication, and resilience to Byzantine failures. It highlights the trade-offs inherent in different BFT designs, such as security assumptions, performance overhead, and scalability limitations. The authors aim to consolidate knowledge in the BFT space, offering a valuable resource for researchers and practitioners seeking to understand the landscape of distributed consensus mechanisms and their applicability to building robust and decentralized systems.
The HoneyBadger of BFT Protocols
Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, Dawn Song
This paper introduces HoneyBadgerBFT, a novel asynchronous Byzantine Fault Tolerance (BFT) protocol designed for high throughput in permissionless blockchain settings. Unlike many traditional BFT protocols that rely on strong synchrony assumptions or suffer from low scalability, HoneyBadgerBFT employs techniques like batched cryptographic primitives and a form of asynchronous multi-signatures to achieve its goals. It processes transactions in batches, significantly increasing efficiency. The protocol is designed to be robust against network delays and partitions, characteristic of real-world decentralized networks. The authors demonstrate that HoneyBadgerBFT can achieve high performance, outperforming existing BFT protocols in terms of throughput while maintaining provable security under realistic network assumptions. This work contributes to the development of scalable and resilient consensus mechanisms for public blockchains.
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
Aggelos Kiayias, Alexander Russell, Bernardo David, Roman Oliynykov
Ouroboros is a family of Proof-of-Stake (PoS) consensus protocols designed to be provably secure, offering a rigorous cryptographic foundation for blockchain operation. The protocol achieves consensus by dividing time into epochs, each composed of several slots, where a slot leader is pseudo-randomly elected for each slot. This leader is responsible for producing a block if one is not already available. The security of Ouroboros relies on the assumption that less than half of the total stake is controlled by malicious actors. The paper presents formal proofs demonstrating its security against various attack vectors, including dynamic stake manipulation and network adversaries. Ouroboros variants address different network conditions, such as synchronous and asynchronous settings, and offer guarantees of safety and liveness. Its development marked a significant step towards establishing the cryptographic rigor expected for production-grade PoS consensus mechanisms in the blockchain space.