Plonk is a widely used succinct non-interactive proof system that uses univariate polynomial
commitments. Plonk is quite flexible: it supports circuits with low-degree “custom” gates as …

We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …

Blockchain technology promises a decentralized ecosystem for building apps with
decentralized ownership and high security level. One of the most adopted blockchain …

The area of practical computational integrity proof systems, like SNARKs, STARKs,
Bulletproofs, is seeing a very dynamic development with several constructions having …

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 …

Polynomial commitment schemes (PCS) have recently been in the spotlight for their key role
in building SNARKs. A PCS provides the ability to commit to a polynomial over a finite field …

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

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 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 …

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