Roadmap

[haampie]

Most important right now is:

• Implement an iterator for the segmented sieve that is efficient in the range OneTo(2^32)
• Use that iterator to efficiently sieve a small interval a:b where a and b are roughly 2^64. The loop will then be of the form:

  # segment has constant memory
  for segment in segments(1:√b)
      for p in primes(segment)
          # here we just store the full interval a:b (compressed of course)
          cross_off_multiples(a:b, p)
      end
  end