probabilistically checkable proof

Also known as PCP

type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof