Before revision:  We show that for every \Pi, algorithms using o(\sqrt{n .
After revision:  We show that for every \Pi, OCSP(\Pi) is approximation-resistant to o(n)-space streaming algorithms. This space bound is tight up to polylogarithmic factors .