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.
Leaderless Asynchronous Consensus Achieves Optimal Complexity and Two-Round Finality
This leaderless BFT protocol, using a novel $O(n)$ threshold signature, achieves optimal resilience, linear communication, and two-round finality.
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.
Differential Privacy Ensures Transaction Ordering Fairness in Blockchains
Researchers connect Differential Privacy to State Machine Replication, using cryptographic noise to eliminate algorithmic bias and mitigate Maximal Extractable Value.
Optimal Flexible Consensus Allows Client-Specific Safety-Liveness Trade-Offs
This new BFT construction enables clients to optimally select their safety-liveness resilience, fundamentally decentralizing the finality trade-off.
Validated Strong Consensus Enables Efficient Asynchronous Leader-Based Blockchain State Replication
A new validated strong BFT model allows asynchronous blockchains to use leader-based coordination, achieving HotStuff-level efficiency and linear view changes.
Efficient Verifiable Secret Sharing Secures Byzantine Fault Tolerant Systems
EByFTVeS integrates BFT with VSS to guarantee consistency and efficiency, fundamentally securing decentralized services operating on private state.
Differential Privacy Ensures Fair Transaction Ordering in State Machine Replication Systems
Foundational research links Differential Privacy to transaction ordering fairness, leveraging established noise mechanisms to eliminate algorithmic bias.
