Quantum-Secure Zero-Knowledge Proofs via Extractable Homomorphic Commitments
A novel extractable homomorphic commitment primitive enables efficient lattice-based non-interactive zero-knowledge proofs provably secure against quantum adversaries.
Two-Step Algorithm Decentralizes ZK-Rollup Proving, Securing Finality and Incentives
A new two-step submission algorithm for zero-knowledge proofs fundamentally decentralizes the ZK-Rollup prover role, eliminating single-node failure risk and distributing economic rewards.
Execution Tickets Protocolizes MEV Capture and Decentralizes Block Proposal Rights
The Execution Ticket mechanism unbundles execution rights from consensus, transforming Maximal Extractable Value into a native, burnable asset to secure the network.
Active Block Producer Model Fundamentally Limits Transaction Fee Mechanism Welfare
The SAKA mechanism is a novel game-theoretic solution that achieves incentive compatibility across users and block producers while guaranteeing half of the maximum social welfare.
Formalizing Subjective Trust Assumptions for Resilient Decentralized Consensus
Introducing asymmetric Byzantine quorum systems, this work formally proves safety and liveness in networks where nodes choose their own trust sets.
Zero-Overhead Data Availability Protocol Enables Trustless Scalability
ZODA introduces a tensor code-based proof of encoding that eliminates sampler communication overhead, fundamentally democratizing data availability verification for light nodes.
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.
Post-Quantum Non-Malleable Commitment from One-Way Functions
A novel cryptographic commitment scheme achieves post-quantum security and constant-round efficiency using only one-way functions, establishing a new foundational primitive for secure computation.
Transparent Recursive Polynomial Commitment Scheme Eliminates Trusted Setup Tradeoff
A novel recursive commitment scheme creates transparent zero-knowledge proofs with non-transparent efficiency, securing ZK-Rollups from trusted setup risk.
