Prime95 source code from GIMPS to find Mersenne Prime.
-
Updated
Jun 24, 2026 - C
Prime95 source code from GIMPS to find Mersenne Prime.
A small collection of helm charts
GIMPS (Great Internet Mersenne Prime Search) implementation in Go.
A first-ever high-performance distributed network for discovering perfect numbers using the Euclid-Euler theorem and Lucas-Lehmer primality testing. Real-time dashboard, automated client assignments, and detailed contributor statistics included (HTML and inline documentation was generated by Claude and README and comments were generated by ChatGPT)
Add a description, image, and links to the gimps topic page so that developers can more easily learn about it.
To associate your repository with the gimps topic, visit your repo's landing page and select "manage topics."