You can think of STARKS/SNARKS as proving computation, not by a program, but by a computational circuit. So the circuit size puts limits on the amount of comput

You can think of STARKS/SNARKS as proving computation, not by a program, but by a computational circuit. So the circuit size puts limits on the amount of computation. Recently, we see the introduction of recursive proof schemes (such as [1]), where part of the circuit may be verifying a proof of a much larger computation. Those can deal with certain forms of unbounded computation, such as verifying a blockchain history of arbitrarily many blocks. [1] https://eprint.iacr.org/2021/370.pdf https://eprint.iacr.org/2021/370.pdf