Full ZK Whiteboard Sessions playlist here: kzread.info?list...
________
In Module 13, William Borgeaud and host Brendan Farmer, both from Polygon Zero, discuss Plonky2 - the recent proving system they’ve developed based on PLONK with custom gates. The goal of Plonky2 is to build the fastest prover that is also able to do recursion. William explains what recursive proofs are and breaks down different approaches other systems used to achieve this. Finally, they look at the techniques used in Plonky2: FRI, TurboPlonk and the Goldilocks field.
What you’ll learn:
0:00 What is Plonky2
2:25 What are recursive proofs
4:14 Prior approaches for recursion with pairings (MNT curves, Aztec)
13:00 Prior approaches for recursion without pairings (inner product arguments, Halo, Plonky)
19:57 Plonky2: the solution
23:28 Choosing a finite field: the Goldilocks field
28:04 Arithmetization: TurboPLONK
35:46 Batched polynomial commitment and FRI
41:51 Example of a custom gate
49:00 Starky (STARK prover)
54:45 ZK-rollup with Plonky2 and Starky
Below is an accompanying reading list:
- Plonky2 Repo: github.com/mir-protocol/plonky2
- Plonky2 Whitepaper: github.com/mir-protocol/plonk...
- Paper: On Cycles of pairing-friendly elliptic curves: arxiv.org/abs/1803.02067
- Paper: Recursive Proof Composition without a Trusted Setup: eprint.iacr.org/2019/1021
- Proposal: The Turbo-PLONK program syntax for specifying SNARK programs: docs.zkproof.org/pages/standa...
- ethSTARK Documentation (FRI+STARK Analysis): eprint.iacr.org/2021/582
________
ZK Whiteboard Sessions is a weekly video educational series focused on the building blocks of ZK. Produced by ZK Hack and powered by Polygon. Add your email to our mailing list to be notified - whiteboard.zkhack.dev
Follow along with the series:
Join the conversation on Discord: / discord
Twitter: / __zkhack__
Website: whiteboard.zkhack.dev/