GKR extended to approximate interactive proofs over complex circuits
At constant soundness the verifier runs in (n+1) poly(L, log S, b); the honest prover needs O(S log S) complex operations.
Stories per day · 30 days
1 stories, newest first · one card per story