Systematizing Consensus Models Redefines Adversarial Fault Tolerance Bounds
This research fundamentally characterizes Byzantine consensus resilience by modeling client behavior, revealing new protocol designs that maintain safety under 99% adversarial control.
Democratic Random Beacons Eliminate Leader Bottlenecks for Scalable Randomness
Kleroterion, a democratic randomness beacon, achieves linear computation and leaderless input sharing, decoupling beacon performance from network size.
Democratic Randomness Protocol Eliminates Leader Bottlenecks for Scalability
Kleroterion, a democratic random beacon using Pinakion PVSS, achieves linear complexity by distributing input sharing, enabling scalable, bias-resistant randomness.
DAG Protocol Achieves MEV Protection with Zero Overhead
Fino, a new DAG-based BFT protocol, integrates a commit-reveal scheme to achieve Blind Order-Fairness, eliminating MEV risk with zero message overhead and no latency penalty.
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.
Fino Protocol Achieves MEV Protection on High-Throughput DAG Consensus
Fino embeds blind order-fairness into DAG-BFT with zero message overhead, securing high-throughput systems against transaction reordering attacks.
Modular SMR Synchronizers Guarantee Provable Liveness in Distributed Consensus
A new SMR synchronizer primitive modularizes liveness mechanisms in Byzantine protocols, enabling provably robust and efficient distributed state consistency.
Dual-Layer Consensus Decouples Scalability and Finality for Secure Sharding
Dual-Layer Consensus introduces a BFT-typed finality committee to PoS sharding, achieving high concurrency and guaranteed deterministic finality.
