Fractal Commitments Enable Universal Logarithmic-Size Verifiable Computation
This new fractal commitment scheme recursively compresses polynomial proofs, achieving truly logarithmic verification costs for universal computation without a trusted setup.
Generic Folding Scheme Enables Efficient Non-Uniform Verifiable Computation
Protostar introduces a generic folding scheme for special-sound protocols, drastically reducing recursive overhead for complex, non-uniform verifiable computation.
Lattice Zero-Knowledge Proofs Secure Scalable Blockchains Post-Quantum
Lattice cryptography enables a quantum-secure ZK proof system, future-proofing on-chain privacy and scalability against cryptographic collapse.
Nova’s Recursive ZKPs Dramatically Scale Sequential Verifiable Computation
Nova introduces folding schemes for incremental verifiable computation, fundamentally enabling scalable, trustless execution of long-running processes.
Libra, Virgo, Virgo++: Optimal Zero-Knowledge Proofs for Practical Systems
New zero-knowledge protocols, Libra, Virgo, and Virgo++, achieve optimal prover time, rapid verification, and succinct proofs, making ZKPs practical for blockchain and AI.
Efficient Zero-Knowledge Proofs: Bridging Theory to Practical Blockchain Applications
This research introduces novel zero-knowledge proof protocols, significantly enhancing efficiency and scalability for secure, trustless blockchain and AI systems.
Nova: Efficient Recursive Zero-Knowledge Proofs for Incremental Computation
Nova introduces a novel protocol for incrementally verifiable computation using folding schemes, dramatically reducing proof size and verifier overhead for sequential computations.
Unveiling Efficient Non-Interactive Zero-Knowledge Proofs Sans Trusted Setup
A non-interactive zero-knowledge proof system merges algebraic and circuit statements, eliminating trusted setup for enhanced privacy and verifiable computation.
Folding Schemes Enable Efficient Recursive Zero-Knowledge Arguments
Nova introduces novel folding schemes for incrementally verifiable computation, dramatically reducing prover time and recursion overhead for scalable trustless systems.
