DAG-Based BFT Protocol Achieves Optimal Latency without Common Primitives
This novel DAG-based BFT protocol achieves optimal three-round latency by eliminating reliable broadcast and common coin primitives, paving the way for hyper-efficient decentralized systems.
Hybrid Synchronous Model Unlocks Optimal Low-Latency Byzantine Fault Tolerance
A new BFT protocol leverages a hybrid synchrony model to achieve up to 15x lower latency, preserving high fault tolerance for scalable decentralized systems.
Uncertified DAG Consensus Protocol Achieves Optimal Three-Round Latency
Mysticeti-C is the first DAG-based Byzantine consensus protocol to reach the theoretical lower bound of three message rounds, enabling sub-second finality.
Uncertified DAG Consensus Protocol Achieves Theoretical Minimum Latency
Introducing Mysticeti-C, a BFT protocol using uncertified DAGs and a novel commit rule to achieve the theoretical 3-round message latency limit, enabling sub-second finality.
Probabilistic Quorums Achieve Scalable BFT Consensus and Optimal Latency
A new BFT protocol uses probabilistic quorums to achieve optimal three-step latency and O(nsqrtn) message complexity, radically improving resource efficiency.
Asynchronous Verifiable Random Functions Achieve Optimal Leaderless BFT Consensus
AVRFs enable every node to verifiably compute the next proposer locally, eliminating leader election latency and achieving optimal asynchronous speed.
Optimal Latency Consensus Achieves $2delta$ Communication by Eliminating Inter-Replica Messaging
A new consensus notion, Pod, eliminates inter-replica communication to achieve physically optimal 2δ latency, unlocking ultra-fast, censorship-resistant distributed applications.
Uncertified DAGs Achieve Optimal Latency in Byzantine Consensus
A novel commit rule for uncertified Directed Acyclic Graphs revolutionizes consensus, ensuring immediate transaction finality and optimal latency in distributed systems.
Pod: Optimal-Latency, Censorship-Free, Accountable Generalized Consensus Layer
A novel consensus primitive eliminates inter-replica communication, achieving physically optimal latency and enabling high-speed, accountable decentralized applications.