Twist and Shout - Fast, Simple Memory Arguments

Learn about two innovative memory-checking arguments, Twist and Shout, in this conference talk that demonstrates how to exploit repeated computational structure for more efficient cryptographic proofs. Discover how Shout provides a fast, simple protocol for batch evaluation by proving multiple evaluations of the same function while avoiding circuit-based encodings and reducing per-evaluation costs through a small one-time investment. Explore how Twist extends Shout's capabilities to efficiently handle read/write memory operations. Understand how these combined techniques enable SNARKs for CPU execution (zkVMs) that are both simpler and faster than existing approaches, while also producing a streaming prover with low memory usage that requires no SNARK recursion.