Recursion is a basic technique in computer science. It's also misleadingly simple. In this talk we'll discuss some of the questions about recursion in proof systems, as applied to recursive STARKs, including:

How to build an IVC STARK? What would proving time, verification time, and proof size look like?

Where does knowledge reside in a recursive STARK system?

Can recursive proofs have constant size for all possible computations?

If you wish to prepare, consider reading this paper on Incrementally Verifiable Computation (IVC), by Paul Valiant.

Recursive STARKs