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

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 th...