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.
Differential Privacy Enforces Transaction Ordering Fairness in State Machine Replication
A breakthrough links Differential Privacy to fair transaction ordering, repurposing noise mechanisms to eliminate algorithmic bias in State Machine Replication and mitigate MEV.
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.
Compiler Proves Security for Distributed Cryptography via Foundational Unification
A formal compiler proof automatically synthesizes secure, distributed cryptographic protocols from simple centralized code, enabling robust, private systems.
Linear-Time ZK Proof System Achieves Optimal Prover Complexity
Cryptographers developed a zero-knowledge argument system achieving optimal linear-time prover complexity, fundamentally unlocking scalable verifiable computation.
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.
Graded Broadcast Protocol Decouples Agreement Achieving Optimal Asynchronous Latency
Falcon's Graded Broadcast bypasses mandatory agreement in ABFT, establishing a new primitive for lower latency and superior throughput in fully asynchronous systems.
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.
Concise Commitments and Statistical Testing Enforce Fair Transaction Ordering
New mechanism uses concise commitments and statistical honesty tests to mathematically enforce random transaction selection, mitigating ordering manipulation.
