I just released this new paper which explains in detail this algorithm, and presents its implementation (and benchmarks) in 6 languages: D, Go, C++, Nim, Rust, and Crystal. It is the mathematically fastest way to generate|count primes, and I would like it to be considered for inclusion into your libraries.
Twin Primes Segmented Sieve of Zakiya (SSoZ) Explained https://www.academia.edu/81206391/Twin_Primes_Segmented_Sieve_of_Zakiya_SSoZ_Explained Jabari Zakiya -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/cf71c2d2-352f-4644-85d5-91794da512cbn%40googlegroups.com.
