@mmagician
What's tricky is mapping the logic (i.e. the program) we want to prove to a relation with an efficient prover. For the above two examples we have "Lookup arguments" (aptly/confusingly named to prove lookup relations) and sumcheck.
0 reply
0 recast
0 reaction