Graded Broadcast Unlocks Optimal Latency for Asynchronous BFT Consensus
Falcon BFT introduces Graded Broadcast, bypassing the agreement stage to resolve high latency and instability in asynchronous consensus protocols.
Coding Techniques Achieve Near-Optimal Synchronous BFT Communication Complexity
The Hamster protocol uses coding techniques to reduce Byzantine Fault Tolerance communication to near-optimal $O(mn)$, unlocking linear throughput scaling.
Mysticeti Achieves Optimal Byzantine Consensus Latency by Uncertified DAGs
This new DAG-based Byzantine consensus protocol reaches the theoretical 3-round latency limit by eliminating explicit block certification, drastically accelerating finality for high-throughput chains.
Epidemic Consensus Protocol Unlocks Extreme-Scale, Leaderless Blockchain Decentralization
The Blockchain Epidemic Consensus Protocol (BECP) re-engineers distributed agreement using probabilistic message dissemination, enabling extreme-scale, leaderless network security.
Practical Asynchronous BFT Protocol Achieves High Performance and Simplicity
Alea-BFT uses a two-stage pipeline with a designated leader to combine classical BFT efficiency with asynchronous network resilience, enabling practical adoption.
Validated Strong Consensus Protocol Simplifies Asynchronous Blockchain Architecture
A new BFT model allows asynchronous leader-based coordination, achieving linear view changes and making large-scale asynchronous ledgers practical.
Graded Dispersal Simplifies BFT Protocols Reducing Complexity and Communication Overhead
Foundational BFT protocols are simplified through Graded Dispersal, a new primitive that cuts communication complexity by 40% and reduces consensus rounds.
Epidemic Consensus Protocol Unlocks Extreme-Scale Fully Decentralized Blockchain Systems
The Blockchain Epidemic Consensus Protocol leverages probabilistic gossip to achieve a fully decentralized, leaderless state machine replication, significantly advancing extreme-scale throughput.
Optimal Byzantine Agreement Protocol Minimizes Communication Complexity Adaptively
New authenticated Byzantine agreement protocol achieves optimal $O(ft+t)$ communication complexity by adapting to the actual number of failures, significantly boosting SMR efficiency.
