GIMPS (Great Internet Mersenne Prime Search)

GIMPS (Great Internet Mersenne Prime Search)
Name	Great Internet Mersenne Prime Search
Founded	January 1996
Founder	George Woltman
Key people	Scott Kurowski, Aaron Blosser
Website	www.mersenne.org

GIMPS (Great Internet Mersenne Prime Search). It is a collaborative, volunteer-based distributed computing project dedicated to discovering new Mersenne prime numbers. Founded by programmer George Woltman in 1996, the project utilizes the combined processing power of thousands of participants' personal computers worldwide. Its success has made it one of the longest-running and most productive projects in the history of volunteer computing.

Overview

The primary goal of the project is the systematic discovery of Mersenne primes, which are prime numbers expressible in the form 2^p − 1, where p itself is prime. This search leverages the Lucas–Lehmer primality test, a highly efficient algorithm specifically designed for numbers of this form. The project's architecture is a classic example of Internet-based volunteer computing, similar in model to other pioneering efforts like SETI@home. Participants run specialized software on their machines, which coordinates with a central server managed by PrimeNet to assign work units and validate results.

History

The project was launched by George Woltman in January 1996, following his development of highly optimized software for the x86 architecture. Early coordination and server infrastructure were provided by Scott Kurowski, who created the original PrimeNet server. The first major discovery under the GIMPS banner was the 35th known Mersenne prime, M_1398269, found in November 1996. This early success validated the distributed model and attracted a growing community. Over the years, project leadership and server administration have transitioned, with Aaron Blosser currently managing PrimeNet. The project's longevity has seen it through the evolution of personal computing from the era of Pentium (original) processors to modern multi-core systems.

Software and hardware

The core application used by volunteers is the Prime95 software, also known as mprime on Linux systems, developed and continuously optimized by George Woltman. This software performs the intricate calculations of the Lucas–Lehmer primality test and includes sophisticated routines for trial factoring and P-1 factoring to eliminate candidates. The software is designed to run at the lowest priority, minimizing impact on a user's system, and includes extensive error-checking to ensure computational integrity. It supports a vast array of hardware, from standard x86-64 processors in Windows and Linux environments to versions for macOS and even ARM architecture chips, harnessing power from everyday PCs to high-end GPUs for specific factoring work.

Discoveries

GIMPS has been extraordinarily successful, discovering all seventeen Mersenne primes found since its inception, including every known Mersenne prime since 1996. Monumental discoveries include M_43112609 (found in 2008), which was the first prime number with over ten million digits and claimed the Electronic Frontier Foundation's $100,000 Cooperative Computing Award. Later, M_82589933, discovered in December 2018, became the largest known prime number as of early 2024. These discoveries often make headlines in major publications like The New York Times and are recognized by institutions such as the Guinness World Records.

Participation and community

Participation is open to anyone with a compatible computer and an Internet connection. Volunteers can join by downloading the Prime95 software and creating an account, which allows them to track their contributions and earn credits. The project fosters a strong community through its forums, where participants discuss technical issues, hardware optimization, and the mathematics behind the search. Notable contributors include organizations like University of California, Los Angeles and individuals whose computers have made historic finds. The collaborative spirit is a hallmark of the project, with participants often dedicating systems for years to the collective effort.

Mathematical significance

The discovery of new Mersenne primes contributes directly to the field of number theory, particularly the study of perfect numbers, as each Mersenne prime corresponds to an even perfect number via Euclid–Euler theorem. These massive primes serve as stress tests for computer hardware and algorithms, pushing the boundaries of large-scale computation. Furthermore, the search aids in refining and testing the efficiency of primality-proving algorithms. The data generated also provides empirical insights into the distribution of prime numbers, informing conjectures in analytic number theory.

Category:Distributed computing projects Category:Prime numbers Category:Mathematics websites