Nova Folding Scheme Enables Efficient Recursive Proof Accumulation
Nova's non-interactive folding scheme compresses arbitrary computation histories into a single, logarithmic-size proof, finally enabling practical IVC.
Optimal Prover Time Unlocks Practical Zero-Knowledge Proof Systems
New ZKP protocols achieve optimal linear prover computation and fully distributed proving, transforming theoretical computational integrity into practical scalability.
Data Availability Encoding Yields Zero-Overhead Polynomial Commitments
By unifying data availability encoding with multilinear polynomial commitments, this research eliminates a major proving bottleneck, enabling faster verifiable computation.
Fast Zero-Knowledge Proofs for Structured Data Grammar Parsing
Coral enables private, verifiable computation on structured data like JSON by proving correct parsing via efficient segmented memory.
Sublinear Memory Zero-Knowledge Proofs Democratize Verifiable Computation
Introducing the first ZKP system with memory scaling to the square-root of computation size, this breakthrough enables privacy-preserving verification on edge devices.
Sublinear-Space Zero-Knowledge Proofs Enable Ubiquitous Verifiable Computation
A novel equivalence reframes ZKP generation as tree evaluation, yielding the first sublinear-space prover, unlocking on-device verifiable computation for resource-constrained systems.
