sentence1: the celebrated pcp theorem states that all languages in np can be verified probabilistically by randomized verifiers that only check a constant number of bits of a polynomial size proof .
sentence2: the celebrated pcp theorem states that any problem in np admits a pcp with verifier complexity that is polylogarithmic in the size of the problem .