I was looking around racket repositories to contribute and <https://github.com/racket/racket/wiki/Math-Library-Features#user-content-mathspecial-functions:~:text=math%2Fnumber%2Dtheory,in%2Dprimes|discovered that >in-primes<https://github.com/racket/racket/wiki/Math-Library-Features#user-content-mathspecial-functions:~:text=math%2Fnumber%2Dtheory,in%2Dprimes| is on the todo>. Can someone please explain how in-primes is expected to work?

It would be a stream that produced each prime, in order of size.

How would it have to be implemented? Would the priority queue based solution described in this paper suffice? https://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf

There are lots of potential implementations; that seems like it might be fine

@joshibharathiramana In math/number-theory there is a next-prime function. So one way to do it: (in-primes start) will produce all primes ≥start.

The iterator needs to store a current number and call next-prime to find the next prime.