Efficient Lattice Polynomial Commitments Secure Post-Quantum ZK Systems
A novel lattice-based polynomial commitment scheme achieves post-quantum security with 8000x smaller proofs, enabling practical, scalable ZK-rollups.
Goldwasser-Kalai-Rothblum Protocol Turbocharges Verifiable Computation Efficiency
A new proof system architecture uses the sumcheck protocol to commit only to inputs and outputs, achieving logarithmic verification time for layered computations, drastically scaling ZK-EVMs.
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.
Homomorphic Accumulators Enable Universal Succinct Zero-Knowledge Arguments
A new homomorphic accumulator primitive allows universal zero-knowledge arguments, dramatically improving proof efficiency for any computation, fostering scalable and private blockchain applications.
