.
allow for a simpler argument without requiring the complexity of a full PCP. A usual probabilistically checkable proof is a short (polynomial-sized) encoded proof, which the verifier can query at arbitrary points. So, we can think of it as an oracle, which, given one of polynomially many positions,