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 …

This paper introduces a SNARK called Brakedown. Brakedown targets R1CS, a popular NP-
complete problem that generalizes circuit-satisfiability. It is the first built system that provides …

This paper studies zero-knowledge SNARKs for NP, where the prover incurs $ O (N) $ finite
field operations to prove the satisfiability of an $ N $-sized R1CS instance. We observe that …

We design, implement, and evaluate a zero knowledge succinct non-interactive argument
(SNARG) for Rank-1 Constraint Satisfaction (R1CS), a widely-deployed NP language …

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 Testudo, a new FFT-less SNARK with a near linear-time prover, constant-time
verifier, constant-size proofs and a square-root-size universal setup. Testudo is based on a …

While NIZK arguments in the CRS model are widely studied, the question of what happens
when the CRS is subverted has received little attention. In ASIACRYPT 2016, Bellare …

We study succinct non-interactive arguments (SNARGs) and succinct non-interactive
arguments of knowledge (SNARKs) for the class UP in the reusable designated verifier …

Abstract Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs)
are becoming an increasingly fundamental tool in many real-world applications where the …

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 …