In Harman's book "Prime Detecting Sieves" he describes a method to prove that a set contains primes if we have enough Type I and Type II information for it. As shown by Selberg's example of the set of numbers with an even number of prime factors Type I information is not sufficient to detect primes. Harman's methods require the Type II information to be given on sufficiently long intervals so that the sums we cannot give assymptotic formulae for are sufficiently small. Is it possible to prove, by giving a suitable counterexample, that if we have Type I information but only a very small amount of Type II information then we can't detect primes?