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.
Coded Byzantine Agreement Protocol Achieves Optimal Communication Complexity Bounds
New coded Byzantine Agreement protocol (COOL) achieves optimal resilience and asymptotically optimal communication complexity, fundamentally limiting distributed consensus costs.
Optimal Asynchronous Byzantine Agreement Achieves Minimum Communication Complexity
The new multi-valued Byzantine Agreement protocol achieves the theoretical minimum communication complexity, fundamentally improving decentralized system efficiency.
Efficient Byzantine Verifiable Secret Sharing Secures Decentralized Systems Foundationally
EByFTVeS introduces an Adaptive Share Delay Provision strategy to resolve consistency and efficiency burdens in BFT-based Verifiable Secret Sharing, strengthening core cryptographic primitives.
New Lower Bound Solidifies Quadratic Communication Barrier for Byzantine Consensus
This research proves that even randomized Byzantine Agreement protocols require quadratic communication complexity against adaptive adversaries, fundamentally limiting consensus scalability.
Golden Ratio Defines Consensus Speed in Dynamic Networks
New theoretical work reveals that the golden ratio dictates the fault tolerance threshold required to achieve two-round Byzantine consensus in dynamic networks.
Irrational Resilience Thresholds Characterize Optimal Latency for Sleepy Consensus
Researchers found that optimal consensus latency in dynamic systems is governed by irrational thresholds, like the Golden Ratio, redefining security limits.
Permissionless Consensus Secured in the Standard Model via Complexity Theory
Foundational security for decentralized systems is achieved by grounding Proof-of-Work in fine-grained complexity, moving beyond idealized models.
Adaptive Byzantine Agreement Achieves Optimal Communication Based on Actual Faults
Adaptive Byzantine Agreement minimizes consensus overhead by scaling communication complexity to the actual number of network faults, not the theoretical maximum.
