Adaptive Byzantine Agreement Optimizes Communication Complexity by Fault Count
This new BFT protocol dynamically scales communication cost based on actual faults, fundamentally improving the efficiency and practicality of decentralized consensus.
Achieving Instantaneous Blockchain Finality by Resolving the Availability-Finality Dilemma
This protocol merges a dynamically available chain with a partially synchronous finality gadget to achieve single-slot finality, eliminating chain reorgs and MEV risks.
Provably Secure Tethering of Blockchains with Primary Chain Stake
Aegis introduces a provably safe and live protocol for securing expansion chains with primary-chain stake, resolving security challenges posed by dynamic validator withdrawals.
Decoupled Quorums Accelerate BFT Consensus and Transaction Finality
Minimmit, a new BFT protocol, separates the small quorum for view progression from the finality quorum, accelerating distributed systems.
Chitin Protocol Secures Proof-of-Stake Liveness against View Interference Attacks
Chitin introduces a novel PoS architecture combining dynamic availability with a finality gadget, securing liveness against view-interference for single-slot confirmation.
Adaptive Byzantine Agreement Achieves Optimal Communication Complexity by Tracking Real Faults
The new BFT protocol dynamically scales communication cost based on actual faults, overcoming classic O(n2) bounds for truly scalable decentralized systems.
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.
Adaptive Byzantine Agreement Achieves Optimal Communication Complexity with Few Faults
A new Byzantine Agreement protocol achieves optimal O(n+t · f) adaptive communication complexity, scaling cost by actual faults, not maximum potential faults.
Three-Slot Finality Protocol Overcomes Consensus Latency and MEV Vulnerability
By integrating a partially synchronous finality gadget with dynamically available consensus, this protocol achieves transaction finality in three slots, fundamentally securing the chain against reorganization risks.
Rondo Protocol Achieves Optimal Linear Complexity for Decentralized Randomness Beacon Sharing
Rondo introduces batched asynchronous verifiable secret sharing with partial output, cutting message complexity to linear for scalable, reconfigurable randomness beacons.
Rondo Protocol Achieves Scalable, Dynamic Distributed Randomness Beacon
The Rondo protocol introduces Batched Asynchronous Verifiable Secret Sharing with Partial Output, enabling dynamic node membership and optimal O(n) message complexity for scalable, unpredictable randomness.
Adaptive Byzantine Agreement Achieves Optimal Communication Parameterized by Actual Faults
This protocol introduces adaptive communication complexity to Byzantine Agreement, establishing tight theoretical bounds and optimizing consensus efficiency for real-world fault conditions.
