✳flâneur — a map of the web's best reading

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

Explore this link on the map →

related reading