:::spoiler {state="open"} 2021/07/29 Episode 190 The Why & How of Privacy for DAOs with John Light & Samuel JJ Gosling Two kinds of privacy Stackholder's voting decision and weight DAO's functionality ::: :::spoiler 2021/04/21 Episode 177 Unwrapping Optimism with Ben and Mark

Plonk $$ \mathcal{R}\mathsf{snark}(\lambda) = \left{ \begin{array}{l} \ (x, w, crs) = \left( \begin{array}{l} (w_i){i \in [\ell]}, \

Pinocchio (PHGR13) and Groth16 {%pdf https://drive.google.com/file/d/1Q2C94PuRGhMqSMlcupwrG9UMGovXXnrX/preview %} Note SNARG vs SNARK SNARG - Succinct Non-interactive ARGument At least computational soundness, which means verifier is highly unlikely to accept a proof if the corresponding statement $\phi$ is not in the relation $R$

ZKP Study Club Planning Goal Expect we can read new ZKP related works without too much effort Expect we can be able to build cool projects using ZKP ... Rule Two week a cycle

KZG10 / Plonk (GWC19) {%pdf https://drive.google.com/file/d/1c4783jrKfDIGhEPuagWLlmphZnHCkU4P/preview %} Reference KZG10 Polynomial Commitments Kate-Zaverucha-Goldberg (KZG) Constant-Sized Polynomial Commitments by Alin Tomescu Kate polynomial commitments by Dankrad Feist

Interested Topic Theoretical [ ] Proof System [x] Random Oracle Model [ ] Pairing Vector Commitment [x] Kate Commitment (KZG10)