Cryptographic Auction Enforces Off-Chain Influence Proofness for Fee Mechanisms
A new 'off-chain influence proofness' criterion exposes EIP-1559's vulnerability, necessitating a cryptographic second-price auction with on-chain miner reserves.
Zero-Knowledge Proof of Training Secures Decentralized Learning Consensus and Privacy
ZKPoT is a new consensus primitive using zk-SNARKs to verify decentralized machine learning contribution without revealing sensitive model data, solving the privacy-efficiency trade-off.
Adaptive Byzantine Agreement Achieves Optimal Communication Complexity Based on Actual Faults
This new consensus protocol introduces adaptive communication complexity, scaling its message load to the actual fault count, which is asymptotically optimal for large-scale BFT systems.
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.
DAG Consensus Achieves Blind Order-Fairness Mitigating MEV
Integrating a commit-and-reveal framework with DAG-based Byzantine Fault Tolerance establishes Blind Order-Fairness, securing transaction sequencing from malicious extraction.
Based Sequencing Leverages L1 Proposers for Credibly Neutral Rollup Transaction Ordering
Based sequencing delegates L2 ordering to L1 validators via specialized gateways and economic slashing, ensuring credibly neutral, high-performance rollups.
Probabilistic Quorums Achieve Scalable BFT Consensus and Optimal Latency
A new BFT protocol uses probabilistic quorums to achieve optimal three-step latency and $O(nsqrt{n})$ message complexity, radically improving resource efficiency.
Community Proving Decentralizes ZK Rollups Using Commodity Hardware Orchestration
CrowdProve introduces a resilient orchestration layer to outsource ZK proof generation to a community of provers, mitigating centralization risk and enhancing rollup scalability.
Post-Quantum zk-SNARKs from LWE Secure Verifiable Computation for All Circuits
This research formalizes quantum-safe zk-SNARKs for arithmetic circuits using LWE, securing blockchain's verifiable computation layer.
