cross-posted from: https://lemmyrs.org/post/29094 Machine-prime is an attempt at making the optimal primality test that can be used on many platforms and called in many languages. It is written in Rust, however bindings are provided for C, C++, Fortran, Python, and Julia. I welcome any further bindings which are fairly easy to write due to the simple api. I also welcome anyone who can write a faster algorithm, only a slightly harder problem.

I originally wrote this a few months back, but I have done some work to let the algorithm be easily reproducible, as well as added some features to allow reduced memory (not-so-optimal) variants.