Circom Workshop 1 | ZK Learning Resources
learn.0xparc.org · 443 words · saved by 1 readers
Description
On this page Description In this session, we introduce the Circom tool stack and how to write basic circuits. 🔑 zk-SNARKs allow you to generate a proof that some arithmetic function f f f evaluates to an output y given a list of values W = [ w 1 , … , w n ] W=[w_1,…,w_n] W = [ w 1 , … , w n ] , which is called a witness . A circuit is uniquely defined by a series of arithmetic constraints which ensure that the function f was computed correctly. zk-SNARK proofs are useful because they allow a verifier to verify that f f f was correctly computed without needing to know all of the witness
related reading
- Background in ZK - Circom 2 Documentationdocs.circom.io
- 0xPARC0xparc.org
- Proving circuits with ZK - Circom 2 Documentationdocs.circom.io
- Lecture 14: Zero knowledge proofsboazbarak.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- 0xPARC0xparc.org
- Collaborative zkSNARKseprint.iacr.org
- Why and How zk-SNARK Works 1: Introduction & the Medium of a Proof | by Maksym | Mediummedium.com
- Intern Breakdown #4: Zero-Knowledge Proofsinternbreakdowns.substack.com
- A zkSNARK Syllabusbrianczhang.com
- BattleSnark: Learning zk-SNARK by building Battleshipkunalm.xyz
- Introduction to zk-SNARKs | Consensysconsensys.net