Novel Recursive Commitment Scheme Achieves Transparent, Efficient Zero-Knowledge Proofs
LUMEN introduces a recursive polynomial commitment scheme and PIOP protocol, eliminating the trusted setup while maintaining zk-SNARK efficiency, securing rollup scalability.
Lattice-Based Arguments Achieve Succinct Post-Quantum Verification Using Homomorphic Commitments
This work delivers the first lattice-based argument with polylogarithmic verification time, resolving the trade-off between post-quantum security and SNARK succinctness.
Universal Zero-Knowledge Proofs Eliminate Program-Specific Trusted Setup
A universal circuit construction for SNARKs decouples the setup from the program logic, establishing a single, secure, and permanent verifiable computation layer.
Lattice Polynomial Commitments Achieve Post-Quantum SNARKs without Trusted Setup
A new lattice-based polynomial commitment scheme secures zero-knowledge systems against quantum adversaries while eliminating the need for a trusted setup ceremony.
Lattice-Based Zero-Knowledge SNARKs Achieve Post-Quantum Security and Transparency
Labrador introduces a lattice-based zkSNARK that future-proofs blockchain privacy and scalability against the quantum computing threat.
Transparent Polynomial Commitment Achieves Succinct Proofs without Trusted Setup
A novel polynomial commitment scheme achieves cryptographic transparency and logarithmic verification, eliminating the reliance on a trusted setup for scalable zero-knowledge proofs.
Hyper-Efficient Prover Unlocks Universal Transparent Zero-Knowledge Scaling
This new HyperPlonk scheme achieves linear prover time for universal transparent SNARKs, fundamentally accelerating verifiable computation for all decentralized applications.
Transparent Recursive Proofs Secure Quantum-Resistant Decentralized State
Fractal introduces a hash-based, transparent SNARK, enabling recursive proofs for quantum-secure, constant-size verification of entire blockchain history.
Mercury Multi-Linear Commitment Scheme Achieves Optimal Succinctness
The Mercury Multi-Linear Polynomial Commitment Scheme achieves constant proof size and near-optimal prover work, eliminating the efficiency trade-off in verifiable computation.
