Editing Probabilistically checkable proof (section)

== Linear PCP ==
A Linear PCP is a PCP in which the proof is a vector of elements of a finite field <math>\pi \in \mathbb{F}^n </math>, and such that the PCP oracle is only allowed to do linear operations on the proof. Namely, the response from the oracle to a verifier query <math>q \in \mathbb{F}^n </math> is a linear function <math>f(q,\pi)</math>. Linear PCPs have important applications in proof systems that can be compiled into SNARKs.