## PCP and Delegating Computation: A Love Story.

In this talk, I will give an overview on how PCPs, combined with cryptographic tools,

are used to generate succinct and efficiently verifiable proofs for the correctness of computations.

I will focus on constructing (computationally sound) *succinct* proofs that are *non-interactive*

(assuming the existence of public parameters) and are *publicly verifiable*.

In particular, I will focus on a recent result with Omer Paneth and Lisa Yang,

where we show how to construct such proofs for all polynomial time computations,