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
related reading
- From Theory to Practicezeroknowledgeblog.com
- Hidingzeroknowledgeblog.com
- Variants of KZG: Part III, Multilinear Commitments with Zeromorphblog.zksecurity.xyz
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- 1022.pdfeprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- The Spartan zkSNARK framework - Alin Tomescualinush.github.io
- 0xPARC0xparc.org
- Why and How zk-SNARK Works 1: Introduction & the Medium of a Proof | by Maksym | Mediummedium.com
- Lecture 14: Zero knowledge proofsboazbarak.org
- 370.pdfeprint.iacr.org
- STARKs, Part I: Proofs with Polynomialsvitalik.eth.limo