@dcbuilder
The short answer is that there are many Stark recursion schemes. The size of the final proof ends up being quite a lot smaller. Polygon zero for example has plonky2 which recursively verifies a stark inside of a snark.
0 reply
0 recast
0 reaction