public static void main(String[] args){
		int count = 0;
		
		int last = 0;
		// here's a common use case
		// just iterate through the list until you're done. remember to break, because this list is infinite!
		for (Integer p : Primes.primeList()) {
			// check all the "composite" numbers between last and cur
			boolean verifiedComposites = true;
			for(int i=last+1; i < p; i++){
				BigInteger big = BigInteger.valueOf(i);
				if(big.isProbablePrime(10)){
					System.err.println("missed a prime number! (" + i + ")");
					verifiedComposites = false;
				}
			}
			if(!verifiedComposites){
				break;
			}
			
			// check that the current num is prime
			count++;
			BigInteger big = BigInteger.valueOf(p);
			boolean verified = big.isProbablePrime(10);
			if(verified){
				System.out.println(count + ": " + p + " -- verified");
			} else {
				System.err.println(count + ": " + p + " -- !!!!!!!!!!NOT PRIME!!!!!!!!!");
				break;
			}
			
			last = p;
		}
	}