Interactive proofs for levels of the polynomial hierarchy
Even for giving an IP for coNP, using current techniques, one needs to arithmetize, i.e. use counting, which means essentially the full power of #P.  Any weaker prover even for coNP would be very interesting, I think (in particular would imply a new non relativing technique.)