Twin Primes Segmented Sieve of Zakiya (SSoZ) Explained

I just released this new paper which prominently features Rust code.

Twin Primes Segmented Sieve of Zakiya (SSoZ) Explained
(PDF) Twin Primes Segmented Sieve of Zakiya (SSoZ) Explained | Jabari Zakiya -

Over the past few years I've gotten help in developing the code from the Forum and thought
I'd share the results of the refined code's comparative performance to some other languages.

I previously had posted about it here.

Recently I asked about using bitarrays here.

Actually the bitarray implementation seems just as fast (with much simpler|shorter code) but I don't use it for the reference implementation for the paper (yet) until its implementation becomes better.

Allot of refinements in the code, and performance increases have occurred, as Rust has developed.

Here are the Rust sources for the code in the paper.



I'm really interested in seeing the code's performance on other hardware, e.g. an M1, ARM, Risc, etc.

1 Like

I just updated the paper, to reflect code changes that eliminated 2 potential places in the code where arithmetic overflow would occur. I also fixed some typos, cleaned up some language and described some things simpler|clearer. Please get the updated paper|code (from previous links in initial post), dated yesterday, June 28, 2022 -Tau Day (link describing below).

Nice link, but you should clarify that's not the link for the paper.

Ah, OK. I thought it should be obvious what that link is to.
I amended the previous post to make it (I hope) clear now.

1 Like