We introduce HyperNova, a new recursive argument for proving incremental computations
whose steps are expressed with CCS (Setty et al. ePrint 2023/552), a customizable …

Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …

Accumulation is a simple yet powerful primitive that enables incrementally verifiable
computation (IVC) without the need for recursive SNARKs. We provide a generic, efficient …

A zero-knowledge proof of training (zkPoT) enables a party to prove that they have correctly
trained a committed model based on a committed dataset without revealing any additional …

We present a framework for building efficient folding-based SNARKs. First we develop a
new “uniformizing” compiler for NP statements that converts any poly-time computation to a …

This paper introduces Lasso, a new family of lookup arguments, which allow an untrusted
prover to commit to a vector a∈ F m and prove that all entries of a reside in some …

Abstract Succinct Non-interactive Arguments of Knowledge (SNARKs) allow an untrusted
prover to establish that it correctly ran some “witness-checking procedure” on a witness. A …

This paper introduces customizable constraint system (CCS), a generalization of R1CS that
can simultaneously capture R1CS, Plonkish, and AIR without overheads. Unlike existing …

This works introduces BaseFold, a new field-agnostic Polynomial Commitment Scheme
(PCS) for multilinear polynomials that has O (log 2 (n)) verifier costs and O (n log n) prover …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …