  Prime numbers are fundamental in number theory and play a significant role in
various areas, from pure mathematics to practical applications, including
cryptography. In this contribution, we introduce a multithreaded implementation
of the Segmented Sieve algorithm. In our implementation, instead of handling
large prime ranges in one iteration, the sieving process is broken down
incrementally, which theoretically eliminates the challenges of working with
large numbers, and can reduce memory usage, providing overall more efficient
multi-core utilization over extended computations.
