✳flâneur — a map of the web's best reading
Hiding
zeroknowledgeblog.com · 701 words · saved by 1 readers
The Zero Knowledge Blog
Empty  Print  Email Before introducing the cryptographic tools we need, just a brief recap of some of my previous posts. We can express an instance of a problem as three vectors of polynomials , and a solution to that computation as a vector of values . With a series of transformations (“reductions”), we can convert a computation that we want to prove execution of to this polynomial format. Knowing all the values of the solution vector w actually means knowing the values of each variable used during our computation. If a polynomial H(X) exists, as defined in the QAP post, it means th
Explore this link on the map →related reading
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- QAPzeroknowledgeblog.com
- Knowledge of coefficientzeroknowledgeblog.com
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Why and How zk-SNARK Works 1: Introduction & the Medium of a Proof | by Maksym | Mediummedium.com
- Lecture 14: Zero knowledge proofsboazbarak.org
- Zero Knowledge Canon, part 1 & 2 - a16z cryptoa16zcrypto.com
- STARKs, Part I: Proofs with Polynomialsvitalik.eth.limo
- Explaining Halo 2 - Electric Coin Companyelectriccoin.co
- ZK-Friendly Hash Functions | Zellic — Researchzellic.io
- Aleo: Can You Keep a Secret?notboring.co