Hello everyone,
I have shared with this forum two algorithms very dear to me: GC60_M30x8 and GC60_LRLN_x8.
These two algorithms have been combined, and the result highlights something fundamental: a different way of looking at how individual numbers move on the number line is far more powerful than just software-level optimization on a segmented sieve.
Julia has outdone itself with this combination. Thanks to its high-level nature, the program almost doubles the performance of primesieve, which is written in low-level, super-optimized C++.
I hope you enjoy this work, because I am truly proud of it.
You can find the script, benchmarks, and verification tests in my Codeberg repository:
Thank you all!