Security, Zero Knowledge Proofs, Snark, Cryptography, Research.
interact. We do not plan to make a deep dive into language theory and complexity here. All what we need to know is that the statement the prover P wants to prove must — very loosely speaking — be encoded in a particular language. With (x,w) ∈ L and (x,w) ∉ L we express a correct/incorrect proof