Reducing BFT Authenticator Complexity Enables Truly Scalable Asynchronous Consensus
JUMBO introduces Quorum Certificate aggregation and dispersal to reduce aBFT authenticator complexity, unlocking consensus scalability for hundreds of nodes.
Decentralized Fair Sequencing Using Verifiable Delay Functions and Threshold Cryptography
A novel mechanism leverages Verifiable Delay Functions and Threshold Cryptography to enforce first-come, first-served transaction ordering, fundamentally mitigating sequencer MEV risk.
Composable Formal Verification Secures DAG Consensus Protocols Efficiently
A new compositional framework enables proof reuse across diverse DAG protocols, practically halving the effort for provable, architectural security.
Random Asynchronous Model Overcomes FLP Impossibility for Consensus Security
Redefining the asynchronous network model with non-adversarial scheduling circumvents the classic FLP impossibility, enabling provably live BFT consensus.
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.
Cross-Cluster Consistent Broadcast Enables Efficient Replicated State Machine Interoperability
The new Cross-Cluster Consistent Broadcast (C3B) primitive and PICSOU protocol solve inter-RSM communication, achieving 24x better performance for decentralized systems.
Asymmetric Trust DAG Consensus Achieves Constant-Round Asynchronous Agreement
This research introduces the first DAG-based consensus using asymmetric quorums, allowing nodes' subjective trust assumptions to secure high-performance asynchronous protocols.
Random Linear Coding Secures Data Availability Sampling Paradigm
Modularizing DAS with on-the-fly network coding over uncoded commitments provides orders of magnitude stronger availability assurance.
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(n^2)$ bounds for truly scalable decentralized systems.
