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.
Verifiable Information Dispersal Decouples Finality from Asynchronous Data Availability
Asynchronous Verifiable Dispersal is a new primitive enabling optimal BFT latency by proving data dispersal before full reconstruction, accelerating consensus.
Graded Broadcast Protocol Decouples Agreement Achieving Optimal Asynchronous Latency
Falcon's Graded Broadcast bypasses mandatory agreement in ABFT, establishing a new primitive for lower latency and superior throughput in fully asynchronous systems.
Asymmetric Quorums Unlock Scalable DAG Consensus under Non-Uniform Trust
A new asymmetric common core primitive fundamentally redesigns DAG consensus, enabling high-performance protocols that tolerate non-uniform, realistic trust assumptions.
Concurrent BFT Decouples Throughput and Latency, Eliminating Censorship
A new asynchronous BFT protocol concurrently executes dissemination and agreement, resolving the throughput-latency tradeoff and guaranteeing censorship resistance.
