I just released a paper on how to optimally find Mersenne Primes of form 2^p - 1.
It's mathematically super simple, and easy to implement in software.
The paper provides proof of concept Crystal code for a single core implementation.
Currently the GIMPS project generates them by directly computing|testing 2^p -1 by directly using candidate values of p, which my method eliminates having to do. But they already have the software to generate and do the primality tests on those large values, which are 100s of digits long.
My question: does the Rust ecosystem have the ability to perform this large number math natively, or able to took into the GIMPS apps and use them to do the math, storage, etc?
It would be interesting to have an optimized Rustified version of GIMPS, since it's taking over the world in so many other areas. 
https://www.academia.edu/178745494/Optimal_Mersenne_Primes_Search_Using_Modular_Groups
2 posts - 2 participants
