As a zk newb, I was surprised to see STARKs with a verifier complexity of O(polylog(n)). Why is this not a problem for STARK-based scalability solutions? @dcbuilder? https://i.imgur.com/kRQqwE8.png
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.