Abstract Lasso (Setty, Thaler, Wahby, ePrint 2023/1216) is a recent lookup argument that
ensures that the prover cryptographically commits to only" small" values. This note describes …

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

Lookup arguments allow an untrusted prover to commit to a vector $\vec f\in\mathbb {F}^ n $
and show that its entries reside in a predetermined table $\vec t\in\mathbb {F}^ N $. One of …

We study elastic SNARKs, a concept introduced by the elegant work of Gemini
(EUROCRYPTO 2022). The prover of elastic SNARKs has multiple configurations with …

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 …

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

Polynomial commitments schemes are a powerful tool that enables one party to commit to a
polynomial p of degree d, and prove that the committed function evaluates to a certain value …

PlonK is a universal and updatable zk-SNARK for general circuit satisfiability that allows a
verifier to check the validity of a certain NP statement very efficiently, optionally in zero …

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 …

Abstract The Fiat-Shamir transform is a methodology for compiling a (public-coin) interactive
proof system for a language L into a non-interactive argument system for L. Proving security …