Optimal Mersenne Primes Search Using Modular Groups (in Julia?)

General Usage
1

I just released a paper on how to optimally find Mersenne Primes, those of form 2^p - 1.
It’s mathematically super simple, and easy to implement in software.
The paper provides Crystal code for a single core implementation as a proof of concept.

I would like to know if the Julia ecosystem has the software apps to perform the large number math necessary to deal with 100s of digits numbers calculations, and create a distributed network, to perform a GIMPS like search, or is able to hook into the GIMPS apps and use them to do the math, storage, etc, to implement my method?

I haven’t used Julia for anything substantial in a few years, and am wondering if its currently able to implement a project like this.

Thanks.

https://www.academia.edu/178745494/Optimal_Mersenne_Primes_Search_Using_Modular_Groups

2

I don’t think we have a wrapper but consider looking around Nemo.jl maybe.
Not sure related but this discussion was cool Self-Initializing Quadratic Sieve in Julia - #26 by technocrat