370.pdf
eprint.iacr.org · 9,398 words · saved by 3 readers
N/A
Nova: Recursive Zero-Knowledge Arguments from Folding Schemes Abhiram Kothapalli† Srinath Setty⋆ Ioanna Tzialla‡ † ⋆ ‡ Carnegie Mellon University Microsoft Research New York University Abstract. We introduce a new approach to realize incrementally ver- ifiable computation (IVC), in which the prover recursively proves the correct execution of incremental computations of the form y = F (ℓ) (x), where F is a (potentially…
saved by
related reading
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Collaborative zkSNARKseprint.iacr.org
- Putting the zk in zkVM: Jolt now supports zero knowledge - a16z cryptoa16zcrypto.com
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- An incomplete guide to Folding: Nova, Sangria, SuperNova, HyperN… — Taiko Labstaiko.mirror.xyz
- Explaining Halo 2 - Electric Coin Companyelectriccoin.co
- Protogalaxy: Efficient Protostar-style folding of multiple instances[0.72cm]eprint.iacr.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- 1021.pdfeprint.iacr.org
- Zero Knowledge Canon, part 1 & 2 - a16z cryptoa16zcrypto.com