From Theory to Practice
zeroknowledgeblog.com · 599 words · saved by 1 readers
The Zero Knowledge Blog
Empty  Print  Email We want to give proof of having executed a defined computation, and that this computation will have to belong to a specific class of problems. How do we express the computation that we need to prove? By reading some of the previous posts, we now understand that the computation has to belong to the class of problems whose solutions can be verified by a computer in finite time, once we know those solutions. To be able to handle them in our “Pinocchio” zk-Snark, we’ll express our computation as a QAP, a “ Quadratic Arithmetic Program ”. A Quadratic Arithmetic Program
related reading
- QAPzeroknowledgeblog.com
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Arithmetic Circuits for ZK | RareSkillsrareskills.io
- 0xPARC0xparc.org
- P vs NP and its application to zero knowledge proofs | RareSkillsrareskills.io
- Background in ZK - Circom 2 Documentationdocs.circom.io
- Zero Knowledge Canon, part 1 & 2 - a16z cryptoa16zcrypto.com
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Hidingzeroknowledgeblog.com
- Lecture 14: Zero knowledge proofsboazbarak.org