Whir: Reed–solomon proximity testing with super-fast verification
We introduce WHIR, a new IOP of proximity that offers small query complexity and
exceptionally fast verification time. The WHIR verifier typically runs in a few hundred …
exceptionally fast verification time. The WHIR verifier typically runs in a few hundred …
A note on efficient computation of the multilinear extension
RD Rothblum - Cryptology ePrint Archive, 2024 - eprint.iacr.org
The multilinear extension of an $ m $-variate function $ f:\{0, 1\}^ m\to\mathbb {F} $, relative
to a finite field $\mathbb {F} $, is the unique multilinear polynomial $\hat {f}:\mathbb {F} …
to a finite field $\mathbb {F} $, is the unique multilinear polynomial $\hat {f}:\mathbb {F} …
More optimizations to sum-check proving
Many fast SNARKs apply the sum-check protocol to an $ n $-variate polynomial of the form $
g (x)=\text {eq}(w, x)\cdot p (x) $, where $ p $ is a product of multilinear polynomials …
g (x)=\text {eq}(w, x)\cdot p (x) $, where $ p $ is a product of multilinear polynomials …
HyperPianist: Pianist with Linear-Time Prover and Sub-Linear Communication Cost Under Transparent Setup
Zero-knowledge proofs allow one party to prove the truth of a statement without disclosing
any extra information. Recent years have seen great improvements in zero-knowledge …
any extra information. Recent years have seen great improvements in zero-knowledge …