## Public inputs

We know by now that we can give a “succinct” proof of having performed a given computation. Typically though, that is not enough.

We know by now that we can give a “succinct” proof of having performed a given computation. Typically though, that is not enough.

We can now put all the elements together. First of all, a summary of what we’ve seen in our rather long journey.

**Some last-minute obfuscation elements**

In a zk-Snark, the prover wants to fully hide its vector *w*. However, the mapping to the elliptic curve of the A, B, C and H polynomials in P **still provides some information** about it.

Pinocchio was the first practical implementation of a zero-knowledge proving system; for instance, zCash implemented it to deliver their original shielded transaction protocol.

Please find below a selection of the articles and posts that helped me to write this series of posts.