Mechanism Design Achieves Strategy-Proof AMMs Eliminating MEV at the Application Layer
A new batch-processing AMM mechanism uses a constant potential function to ensure arbitrage resilience and strategy-proofness, fundamentally mitigating MEV.
Uncertified DAG Consensus Achieves Sub-Second Asynchronous Byzantine Finality
This new asynchronous BFT protocol uses an uncertified DAG and a novel commit rule to shatter the latency barrier, enabling sub-second finality at high throughput.
Practical Asynchronous BFT Protocol Achieves Optimal Performance and Simplicity
A new asynchronous BFT protocol merges rotating leader efficiency with leaderless agreement, ensuring optimal resilience and high performance without relying on network timing assumptions.
LLM-Driven Property Generation Automates Formal Smart Contract Verification
A Retrieval-Augmented LLM system automates the manual creation of formal contract specifications, dramatically scaling rigorous blockchain security.
Probabilistic BFT Achieves Optimal Latency with Sub-Quadratic Message Complexity
By relaxing to a probabilistic security model, ProBFT delivers optimal three-step latency and $O(nsqrt{n})$ message complexity, enabling practical BFT scalability.
HyperPlonk’s Multilinear Arithmetization Unlocks Linear Prover Time for ZK-SNARKs
HyperPlonk eliminates the FFT bottleneck in Plonk by using multilinear polynomials over the boolean hypercube, enabling linear-time ZK-proof generation for massive circuits.
FRIDA Enables Transparent Data Availability Sampling with Poly-Logarithmic Proofs
FRIDA uses a novel FRI-based commitment to achieve non-trusted setup data availability sampling, fundamentally improving scalability.
Vector-OLE Enables Efficient Zero-Knowledge Proofs over Integer Rings
A new Vector-OLE protocol provides maliciously secure, high-speed Zero-Knowledge Proofs over the integer ring $mathbb{Z}_{2^k}$, fundamentally aligning verifiable computation with modern CPU arithmetic.
Near-Optimal Communication Byzantine Broadcast under Message Adversary Model
A new Byzantine Reliable Broadcast algorithm leverages erasure codes to achieve near-optimal $O(|m| + nkappa)$ communication complexity, securing asynchronous systems against message-dropping adversaries.
