Secure Timestamp Primitive Rethinks Consensus Fairness in Asynchronous Networks
Researchers introduce a novel, corruption-resistant timestamp primitive, enabling consensus protocols to reliably record transaction submission time, which fundamentally mitigates censorship and MEV risk.
Decentralized Verifiable Computation Mechanisms Limit Efficiency and Participation
Mechanism design for verifiable computation is constrained by a theoretical limit on decentralization, forcing a strategic trade-off between speed and participation.
Batch-Processing AMM Design Eliminates MEV and Guarantees Arbitrage Resilience
A novel AMM mechanism processes all block transactions in a single batch, mathematically eliminating block producer arbitrage and mitigating MEV extraction.
Leaderless BFT Consensus Secures against Adaptive Adversaries and Centralization
Egalitarian BFT eliminates the predictable single leader, using a cryptographic lottery for simultaneous block proposal to achieve strong security against adaptive adversaries.
Smart Contract Mechanism Design Ensures Efficient, Fair, and Resilient Decentralized Resource Allocation
A game-theoretic framework for smart contracts proves unique, stable equilibrium, transforming resource allocation from ad-hoc to provably efficient and fair.
Distributed Threshold Encryption Mitigates MEV for Provably Fair Transaction Ordering
Distributed threshold encryption conceals transaction content from block producers, enforcing fair ordering and eliminating front-running opportunities.
Zero-Knowledge Proof of Training Secures Federated Learning Consensus and Data Privacy
This new consensus mechanism leverages zk-SNARKs to verify decentralized AI model contributions without exposing sensitive training data, solving the privacy-efficiency trade-off.
Execution Tickets Centralize MEV Extraction through Capital Advantage
An economic model reveals that Proposer-Builder Separation, using Execution Tickets, concentrates MEV extraction among high-capital buyers, fundamentally challenging decentralization.
Polylogarithmic Commitment Scheme Drastically Accelerates Zero-Knowledge Proof Verification
This new polynomial commitment scheme over Galois rings achieves polylogarithmic verification, fundamentally unlocking practical, high-speed verifiable computation.
