Jolt: SNARKs for virtual machines via lookups
summary
Jolt represents CPUs as tiny circuits that do only lookup checks into multilinear polynomial subtables instead of executing every instruction branch, using the Lasso lookup argument plus offline memory checking (Blum→Spice) and a Spartan/Hyrax-style backend. For RV32i the core circuit is about 60 constraints per step and emits ~80 field elements per step; 23 small subtables span the base instruction set. Prover is linear-time and hits ~100k instructions/sec on an M3 Max (≈600k× overhead vs native). Roadmap targets Zomorph/BAS and self-recursion for on-chain verification.
AI-written summary · about
chapters (9)
- 0:00Introduction to Jolt ZKVMs
- 2:16Overcoming circuit overheads
- 5:53Mathematical foundation
- 8:58Lasso algorithm overview
- 11:55Jolt Rust implementation
- 13:23Instruction flow walk-through
- 17:34Performance benchmarks
- 19:33Future roadmap
- 21:25Q&A and closing
related talks
23mRunning an Open Source LLM on Open Source Hardware
17mLLM Inference on RISC-V Embedded CPUs
33mParallel Processors: Past & Future Connections Between LLMs and OS Kernels.
43mThe State of EVM Languages
53mThe Best We Can Do?
01h 48mClosing Keynote Day 1
40mEthereum at Hyperscale
21mNext Generation ZK Applications with SP1