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

**URL:** <https://discourse.julialang.org/t/optimal-mersenne-primes-search-using-modular-groups-in-julia/139960>\
**Category:** General Usage\
**Created:** [October 12, 2026, 3:19am UTC](https://discourse.julialang.org/t/optimal-mersenne-primes-search-using-modular-groups-in-julia/139960 "2026-10-12T03:19:32Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![jzakiya](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/jzakiya/32/6416_2.png) [@jzakiya](https://discourse.julialang.org/u/jzakiya)\
**Post date:** [October 12, 2026, 3:19am UTC](https://discourse.julialang.org/t/optimal-mersenne-primes-search-using-modular-groups-in-julia/139960/1 "2026-10-12T03:19:32Z")

</div>

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](https://www.academia.edu/178745494/Optimal_Mersenne_Primes_Search_Using_Modular_Groups)

---

<div class="post-metadata">

**Author:** ![yolhan\_mannes](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/yolhan_mannes/32/220485_2.png) [@yolhan\_mannes](https://discourse.julialang.org/u/yolhan_mannes)\
**Post date:** [October 12, 2026, 5:09am UTC](https://discourse.julialang.org/t/optimal-mersenne-primes-search-using-modular-groups-in-julia/139960/2 "2026-10-12T05:09:23Z")

</div>

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](https://discourse.julialang.org/t/self-initializing-quadratic-sieve-in-julia/139826/26)