Folding Schemes Enable Linear-Time Recursive Zero-Knowledge Computation
Nova's folding scheme fundamentally solves recursive proof composition by accumulating instances instead of verifying SNARKs, unlocking infinite verifiable computation.
Statement Hiders Enable Privacy Preserving Folding Schemes for Verifiable Computation
The Statement Hider primitive blinds zero-knowledge statements before folding, resolving privacy leakage during selective verification for multi-client computation.
Recursive Proof Composition Enables Infinite Scalability and Constant Verification
Recursive proof composition collapses unbounded computation history into a single, constant-size artifact, unlocking theoretical infinite scalability.
Lattice SNARKs Achieve Post-Quantum Security, Public Verifiability, and Recursion
Researchers created the first lattice-based SNARK that is post-quantum secure and recursively composable, future-proofing verifiable computation.
Batch-Updatable Vector Commitments Enable Efficient Stateless Blockchain Architecture
Cauchyproofs introduces a quasi-linear batch-updatable vector commitment, solving the critical state proof maintenance bottleneck for practical stateless chains.
Transparent Polynomial Commitments Achieve Practical Constant-Size Proofs
New aggregation techniques slash transparent polynomial commitment proof size by 85%, enabling practical, trustless, constant-sized ZK-SNARKs.
Folding Schemes Enable Practical Recursive Zero-Knowledge Arguments
A novel folding scheme compresses computation steps into a single instance, radically reducing recursion overhead for scalable verifiable systems.
Constant-Size Accumulators Unlock Truly Stateless Blockchain Architecture
This research introduces constant-size batching techniques for cryptographic accumulators, fundamentally enabling blockchain nodes to achieve constant-time state verification with minimal storage.
Lattice-Based Recursion Enables Transparent Post-Quantum Zero-Knowledge Proofs
LaBRADOR introduces a post-quantum, lattice-based ZK primitive that achieves sublinear proof size via recursive folding, securing future computation.
