An interactive-PCP (say, for the membership $x \in L$) is a proof that can be verified by reading only one of its bits, with the help of a very short interactive-proof. We show that for membership in some languages $L$, there are interactive-PCPs that are significantly shorter than the known ... more >>>