Differential Order Fairness Secures Atomic Broadcast against Transaction Reordering
The Quick Order-Fair Atomic Broadcast protocol introduces differential order fairness, achieving optimal resilience and quadratic message complexity to eliminate leader-based MEV.
Prioritized Broadcast Slashes Asynchronous Consensus Communication Complexity.
A committee-based prioritized broadcast protocol cuts Byzantine consensus communication costs by $O(n)$, unlocking scalable asynchronous state replication.
DAG-Based BFT Protocol Achieves Optimal Latency without Common Primitives
This novel DAG-based BFT protocol achieves optimal three-round latency by eliminating reliable broadcast and common coin primitives, paving the way for hyper-efficient decentralized systems.
Concurrent Asynchronous BFT Protocol Achieves Throughput-Oblivious Latency
A new asynchronous BFT protocol structure achieves throughput-oblivious latency by concurrently executing transaction dissemination and agreement, resolving a critical scalability tension.
Simulation-Resistant Honest Majority Secures Dynamic Proof-of-Stake Consensus Bootstrapping
A new simulation-resistant honest majority condition proves the security limits of dynamic PoS, enabling a bootstrapping gadget for robust membership changes.
