

Theory to Code: Building the Breakthrough zkVM Jolt
May 1, 2024
Learn about the breakthrough zkVM Jolt and the use of SNARKs in verifiable computing. Discover the evolution of the field, similarities to computer chip architecture, and the challenges of turning theory into practical engineering. Explore the efficiency and security benefits of SNARKs and ZKVMs, and the potential applications in blockchain security, processing capabilities, and decentralized social algorithms. Dive into the optimization of cryptographic protocols for efficiency gains and the future of decentralized app stores.
Chapters
Transcript
Episode notes
1 2 3 4 5 6 7 8
Introduction
00:00 • 2min
Exploring Blockchain Security and Processing Capabilities with Snarks and ZKVMs
01:38 • 2min
Exploring Snarks and the Evolution of ZKVM
04:07 • 16min
Evolution of the Sum Check Protocol in Snark Design
19:41 • 11min
Efficiency and Flexibility of Lookup Arguments in SNARKs Design
31:03 • 22min
Optimizing Cryptographic Protocols for Efficiency Gains
53:10 • 11min
Exploring Future Applications of Verifiable Compilation and Decentralized Social Algorithms
01:04:20 • 3min
Decentralized App Store and Security
01:07:25 • 8min