✳flâneur — a map of the web's best reading
QAP
zeroknowledgeblog.com · 1,492 words · saved by 1 readers
The Zero Knowledge Blog
Empty  Print  Email A quick recap of some of the previous posts, before we move ahead. We have a defined computation and we want to prove that we did run it . To do that, we expressed it in a very basic programming language, and then transformed it into a collection of numerical vectors that verify some defined equations among them. Unfortunately, we are not done with our transformations yet: we need to convert our set of vectors into something else, to be able to handle them in the zero-knowledge, succinct, non-interactive proving technology that we are building here: a Pinocchio zk
Explore this link on the map →related reading
- Why and How zk-SNARK Works 1: Introduction & the Medium of a Proof | by Maksym | Mediummedium.com
- Hidingzeroknowledgeblog.com
- From Theory to Practicezeroknowledgeblog.com
- STARKs, Part I: Proofs with Polynomialsvitalik.eth.limo
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Zero Knowledge Canon, part 1 & 2 - a16z cryptoa16zcrypto.com
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Background in ZK - Circom 2 Documentationdocs.circom.io
- Explaining Halo 2 - Electric Coin Companyelectriccoin.co
- Arithmetization II. “We Need To Go Deeper” | by StarkWare | StarkWare | Mediummedium.com