Fast-HotStuff Achieves Two-Round BFT Consensus, Enhancing HotStuff’s Speed and Robustness
Fast-HotStuff introduces a two-round BFT mechanism that resolves HotStuff's latency and attack vulnerabilities, establishing a new, faster baseline for decentralized finality.
Probabilistic Leader Election Enforces Cryptographic Fairness in Transaction Ordering
FairSort uses Verifiable Random Functions to probabilistically elect ephemeral sequencers, cryptographically guaranteeing transaction ordering fairness and mitigating MEV.
BFT Consensus Enables Practical Decentralized Distributed Key Generation
A new framework operationalizes Distributed Key Generation using BFT consensus as a broadcast channel, enabling trustless threshold cryptography for decentralized systems.
Hybrid Synchronous Model Resolves BFT Latency-Liveness Tradeoff
AlterBFT introduces a hybrid synchronous model differentiating message size for safety and liveness, drastically lowering BFT latency in real-world networks.
Simplex Consensus Achieves Provably Fast, Simple Byzantine Fault Tolerance
This simplified BFT protocol achieves faster finality and the easiest known liveness proof, setting a new standard for decentralized system speed and simplicity.
Unauthenticated BFT Consensus Achieves Optimal Complexity and Fast Finality
A novel unauthenticated BFT protocol secures consensus with optimal communication and 5-message finality, simplifying architecture and boosting efficiency.
Asymmetric DAG Consensus Unlocks Constant Finality with Local Trust Assumptions
By extending DAG-Rider to use asymmetric quorums, this work achieves constant-time BFT finality under realistic, locally defined trust models.
Hybrid Synchronous BFT Model Achieves Low Latency by Separating Message Sizes
AlterBFT introduces a hybrid synchronous model, relying on small, timely coordination messages to drastically reduce consensus latency.
