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 …

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

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 …

We present a generalized inner product argument and demonstrate its applications to
pairing-based languages. We apply our generalized argument to prove that an inner pairing …

We construct public-coin time-and space-efficient zero-knowledge arguments for NP NP. For
every time T and space S non-deterministic RAM computation, the prover runs in time T ⋅ …

This paper introduces HyperNova, a recursive argument for proving incremental
computations whose steps are expressed with CCS (Setty et al. ePrint 2023/552), a …

This paper introduces SuperNova, a new recursive proof system for incrementally producing
succinct proofs of correct execution of programs on a stateful machine with a particular …

This paper introduces Brakedown, 1 the first built system that provides linear-time SNARKs
for NP, meaning the prover incurs O (N) finite field operations to prove the satisfiability of an …

We introduce a new class of succinct arguments, that we call elastic. Elastic SNARKs allow
the prover to allocate different resources (such as memory and time) depending on the …