Twist and Shout: Fast, Simple Memory Arguments
summary
Two new memory-checking arguments, Twist and Shout, turn lookup-heavy proofs into practical zkVM plumbing: Shout gives a batch-evaluation/lookup protocol with a one-time fixed cost depending on K (e.g. K=2^64) and a per-evaluation cost around ~100 field multiplications (example c≈4, T=10^9), while Twist extends that to read/write memory and supports locality to avoid log-K per access. The system uses the Dory elliptic-curve commitment (square-root-size opening work) and powers Jolt, a zkVM prototype with ~50 KB proofs, ~500k→1M RISC‑V cycles/sec targets, low memory and no SNARK recursion.
AI-written summary · about
chapters (8)
- 0:00SNARKs and memory arguments
- 8:52Twist and Shout arguments
- 12:29Shout batch evaluation
- 29:55Twist for read-write memory
- 37:10Jolt zkVM with Twist and Shout
- 45:07Streaming provers
- 50:32Technical foundations
- 1:07:13Q&A
