Simple Factoring

The thing below factors, and returns ranges of prime numbers.

Factors and Primes

Factor: x < 10,000,000,000 Primes in Range: delta < 10,000 any x < 10,000,000,000

Results

How this works: The seeds are a list representing the difference between one prime and the next one. This is used to recreate a list of prime numbers used to do the factoring.

I've been working with taking the prime roots and getting them in as small a binary block as I can, with the codicil that the only calculations to recreate the primes array would be addition and indexing. I got the set from 0 to 100,000,000 (which is about 5.76 million integers) down to 3.7 million bytes on disk.