Machine-prime: Optimal primality for 64-bit integers
Open link in next tab
GitHub - JASory/machine-prime: ne plus ultra primality testing for machine-sized integers
https://github.com/JASory/machine-prime
ne plus ultra primality testing for machine-sized integers - GitHub - JASory/machine-prime: ne plus ultra primality testing for machine-sized integers
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.