Implies that every arbitrarily long proof for any statement in propositional logic can be formalized (in polynomial time), so that one can check whether it is correct or not by only reading a constant number of letters from it!