Storing of Primes

[burhop]

This is off topic but still related :-)

I'd like to continuously sieve prime numbers and store them to disk for later lookup. The trivial implementation is just to save the bits but it quickly fills up my hard drive. You can do better by not saving the bits at locations divisible by 2, 3, 5 and so on, which helps but I bet there are better solutions.

I've got an implementation here: https://github.com/burhop/prime but I'm sure it can be better.