WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification
eprint.iacr.org · 9,504 words · saved by 1 readers
N/A
WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification Gal Arnon Alessandro Chiesa gal.arnon@weizmann.ac.il alessandro.chiesa@epfl.ch Weizmann Institute EPFL Giacomo Fenzi Eylon Yogev giacomo.fenzi@epfl.ch eylon.yogev@biu.ac.il EPFL Bar-Ilan University November 21, 2024…
saved by
related reading
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 370.pdfeprint.iacr.org
- The Spartan zkSNARK framework - Alin Tomescualinush.github.io
- Variants of KZG: Part III, Multilinear Commitments with Zeromorphblog.zksecurity.xyz
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Explaining Halo 2 - Electric Coin Companyelectriccoin.co
- 1043.pdfeprint.iacr.org
- 浡琀栀猀昀 愀氀氀漀眀攀搀 漀渀氀礀 椀渀 洀愀琀栀 洀漀搀攀䘀䤀䌀匀 愀渀搀慴hsf allowed only in math modeFACS: Fast IOPPs and Accumulation via Code-Switchingeprint.iacr.org
- 1022.pdfeprint.iacr.org
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org