The Great Internet Mersenne Prime Search (GIMPS) is a distributed computing model that uses a client called Prime95 to run calculations to find prime numbers in the form of 2^p – 1 where p is also prime.

Here is a brief history of GIMPS and Prime 95 from

GIMPS was founded in 1996 by George Woltman. The software ran on Intel i386 systems using hand-tuned assembly code for the critical calculations, resulting in highly optimized Lucas-Lehmer code.

It wasn’t long before GIMPS had it’s first discovery in November of that same year, showing the effectiveness of distributed computing in harnessing spare computer cycles in a coordinated effort.

As efficient as the software itself was, the early years of GIMPS involved a manual process using emails to request work assignments and then send the results back. As the project grew, a more efficient system was needed and Scott Kurowski responded to that need with the introduction of PrimeNet through his company Entropia, a pioneer in the early days of distributed computing projects. Without Scott’s invaluable contribution, the ability to manage thousands of volunteers and millions of work assignments would not have been possible. PrimeNet paved the way for the future growth of the project as a whole.

With the solid foundation of PrimeNet in place, George continued his focus on improving the core calculations of Prime95. As new Intel and AMD processors were introduced, George worked with the new instruction sets and timings to increase the performance. The core of the program is now able to optimize itself to work at peak efficiency on all modern CPU’s, but also still finds a home on many older generation systems.

If you want to join the search, as we have, you can download the client software by clicking this link for the Windows version that supports AMD Zen, or you can go here to see all available versions.

If you decide to join the search feel free to our team – Ensurtec.