Knowledge of coefficient
zeroknowledgeblog.com · 1,081 words · saved by 1 readers
The Zero Knowledge Blog
Empty  Print  Email If you read and spent some time on the previous posts on the blog, you should know that a proof will be the hidings of A(P), B(P), C(P), and H(P) , all calculated in the hidden space by using the hidings of the “building block” polynomials. The hidings that compose the proof prove that the equations hold, i.e. they prove that hh[A(P)] * hh[B(P)] - hh[C(P)] / hh[Z(P)] = hh[H(P)]. Now, we see all these fancy formulas for these hidings: hh[A(P)], hh[B(P)], hh[C(P)], hh[H(P)], ... but in reality they are just numbers : nobody can tell if we really calculated them as h
related reading
- Hidingzeroknowledgeblog.com
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Lecture 14: Zero knowledge proofsboazbarak.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- QAPzeroknowledgeblog.com
- Why and How zk-SNARK Works 1: Introduction & the Medium of a Proof | by Maksym | Mediummedium.com
- 1021.pdfeprint.iacr.org
- STARKs, Part I: Proofs with Polynomialsvitalik.eth.limo
- Zero-Knowledge Proofs | MIT CSAIL Theory of Computationtoc.csail.mit.edu
- 1482.pdfeprint.iacr.org
- How Unknowable Math Can Help Hide Secrets | Quanta Magazinequantamagazine.org