awesome-zero-knowledge-proofs VS halo2-tutorial

Matter-Labs, Zero-Knowledge Proofs Starter Pack, etc - https://github.com/matter-labs/awesome-zero-knowledge-proofs

Check out Aztec Noir if you have 0 ZK experience. To learn, check out matter labs' awesome zkp. My favorite resource from it is "Why and How ZK Snarks". Good luck!

a link collection

Awesome lists are awesome, and Matter Labs, the team behind zkSync, keeps an awesome-zero-knowledge-proofs with links to all kind of resources.

Lots of resources here:

https://github.com/matter-labs/awesome-zero-knowledge-proofs

Finally, the are a few other zkRollups being built such as Polygon Hermez and Scroll but to go into every project in detail would require a whole post on its own. Hopefully this has been a helpful introduction to the fascinating but often confusing world of zero knowledge technology. if you want to learn more about rollups and zkRollups I’d highly recommend checking out some of u/Liberosist’s posts on the topic. or if you want to learn more about zero knowledge tech specifically, Matter Labs curated a great list of resources here: https://github.com/matter-labs/awesome-zero-knowledge-proofs

You can combine the two and have private transactions which are then rolled up in a computation, and then post the proof of the computation to mainnet. You get both cheap and private transactions and infra on top of the base chain.

But this goes beyond blockchain: we can hand code to other people to run and then have proof they haven't altered what we agreed upon running, so we can trust the results of someone else running something. That is useful in all sorts of research for replicability in science/engineering.

WIRED Computer Scientist Explains One Concept in 5 Levels of Difficulty : https://www.youtube.com/watch?v=fOGdb1CTu5c

https://developers.aztec.network/

https://z.cash/technology/zksnarks/

https://github.com/matter-labs/awesome-zero-knowledge-proofs

As another example, you could define a circuit for proving the N-th Fibonacci number, where row i of the matrix has the values x[i-2], x[i-1], x[i]. This means you'd need three advice columns to begin with, let's call them a, b, c. Then, you'd constrain c to be equal to a + b in the same row using a gate, which requires adding a selector column for controlling it. And you'd have to set up equality constraints so that a and b are equal to b and c from the previous row. Last, in order to expose the N-th number as a public value, you'd need an instance column, constrained to equal the value of c at the last row.