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.
Constant Latency BFT Achieved on Dynamically Available Directed Acyclic Graphs
New DAG-based BFT protocol guarantees constant finality time despite validators frequently sleeping, solving a core dynamic availability problem.
Dynamic Slashing Secures Proof-of-Stake against Stake Centralization
A new mechanism dynamically scales slashing penalties by stake concentration, creating a self-regulating security equilibrium that disincentivizes validator centralization.
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.
Falcon Consensus Achieves Lower Latency by Bypassing Agreement Stage
Introducing Graded Broadcast, Falcon BFT slashes consensus latency by decoupling block inclusion from the traditional two-stage agreement process.
