> The math and crypto are fairly straight-forward Would you mind explaining the q-power knoweldge of exponent assumption and how someone verifying the recursiv

> The math and crypto are fairly straight-forward Would you mind explaining the q-power knoweldge of exponent assumption and how someone verifying the recursively constructed proof can be confident that the prover actually knows a _specific_ satisfaction of the circuit themselves given that the proof is much smaller possible state of different inputs? :P