Chapters
Transcript
Episode notes
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35
Introduction
00:00 • 2min
The History of Pairing-Based Snorks
02:23 • 3min
Grot 10: A Review of Cryptographic Assumptions
05:21 • 3min
GRA 16: The Standard for Snorks
08:09 • 2min
The Polynomial Commitment Scheme Strikes Back
10:09 • 2min
Custom Gates in R1CS
12:22 • 2min
The Second Generation of Plankish Arithmetic
14:03 • 2min
The Importance of a Universal Setup
16:03 • 2min
Sonics: The Next Step in the Movie
18:20 • 2min
The End of Chapter Two of Snark Timber
20:28 • 2min
The Origins of Custom Gates in Plonk
22:00 • 2min
How to Use Plonk to Prove Client Proofs
24:10 • 3min
Recursion: A Form of Aggregation
26:43 • 3min
The Different Terms Used for Aggregation
29:48 • 2min
The Return of the Parent
31:20 • 2min
The Importance of Lookups
33:41 • 2min
How to Use a Lookup Table to Cheat
35:14 • 2min
The First Generation of Look Up Protocols
37:10 • 2min
How to Design a Look Up Protocol That Does Not Depend on Table Size
38:47 • 2min
The Importance of Pairings in CQ
40:59 • 2min
The Definition of Homomorphic Encryption
42:43 • 2min
The Additive Properties of Bulletproofs
44:31 • 2min
The Power of the Lookup Table
46:34 • 3min
Fry Approves KZG With Lookup Tables
49:07 • 2min
The Modularity of the Lookup Table
51:21 • 2min
How to Improve Aggregation With KZG
52:57 • 2min
The Importance of CQ in the Ethereum Mainnet
54:32 • 2min
CQ in Halo 2
56:38 • 3min
The Future of Halo Proving Systems
59:33 • 2min
How to Aggregate and Fold Claims
01:01:11 • 6min
Nova's Adaptation to R1CS
01:06:45 • 2min
The Cost of Proving an Error in R1CS
01:08:46 • 2min
How to Prove a Million Plonk Proofs
01:11:15 • 2min
How to Avoid FFTs
01:13:21 • 2min
The Future of Aggregation
01:15:36 • 2min