 Probabilistically checkable proof

A Probabilistically Checkable Proof (PCP) is a concept from theoretical computer science, particularly in the field of computational complexity and proof systems. A PCP is a type of proof for a mathematical assertion that can be verified by a probabilistic algorithm with certain characteristics: 1. **Probabilistic Verification**: The verifier, instead of reading the entire proof, can check the proof using random bits.