✳flâneur — a map of the web's best reading
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
Explore this link on the map →related reading
- Background in ZK - Circom 2 Documentationdocs.circom.io
- Proving circuits with ZK - Circom 2 Documentationdocs.circom.io
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Why and How zk-SNARK Works 1: Introduction & the Medium of a Proof | by Maksym | Mediummedium.com
- Zero Knowledge Canon, part 1 & 2 - a16z cryptoa16zcrypto.com
- ZK-Friendly Hash Functions | Zellic — Researchzellic.io
- GitHub - iden3/snarkjs: zkSNARK implementation in JavaScript & WASM · GitHubgithub.com
- Arithmetic Circuits for ZK | RareSkillsrareskills.io
- QAPzeroknowledgeblog.com