Great Internet Mersenne Prime Search

src: cnet2.cbsistatic.com

The Great Internet Mersenne Prime Search (GIMPS) is a collaborative project of volunteers who use freely available software to search for Mersenne prime numbers.

The GIMPS project was founded by George Woltman, who also wrote the software Prime95 and MPrime for the project. Scott Kurowski wrote the PrimeNet Internet server that supports the research to demonstrate Entropia-distributed computing software, a company he founded in 1997. GIMPS is registered as Mersenne Research, Inc. Kurowski is Executive Vice President and board director of Mersenne Research Inc. GIMPS is said to be one of the first large scale distributed computing projects over the Internet for research purposes.

The project has found a total of sixteen Mersenne primes as of January 2018, fourteen of which were the largest known prime number at their respective times of discovery. The largest known prime as of January 2018 is 2^77,232,917 - 1 (or M_77,232,917 in short). This prime was discovered on December 26, 2017 by Jonathan Pace.

To perform its testing, the project relies primarily on Lucas-Lehmer primality test, an algorithm that is both specialized to testing Mersenne primes and particularly efficient on binary computer architectures. They also have a trial division phase, used to rapidly eliminate Mersenne numbers with small factors which make up a large proportion of candidates. Pollard's p - 1 algorithm is also used to search for larger factors.

Video Great Internet Mersenne Prime Search

History

The project began in early January 1996, with a program that ran on i386 computers. The name for the project was coined by Luther Welsh, one of its earlier searchers and the co-discoverer of the 29th Mersenne prime. Within a few months, several dozen people had joined, and over a thousand by the end of the first year. Joel Armengaud, a participant, discovered the primality of M_1,398,269 on November 13, 1996.

Maps Great Internet Mersenne Prime Search

Status

As of October 2017, GIMPS has a sustained aggregate throughput of approximately 324 TeraFLOPS (or TFLOPS). In November 2012, GIMPS maintained 95 TFLOPS, theoretically earning the GIMPS virtual computer a place among the TOP500 most powerful known computer systems in the world. Also theoretically, in November 2012, the GIMPS held a rank of 330 in the TOP500. The preceding place was then held by an 'HP Cluster Platform 3000 BL460c G7' of Hewlett-Packard. As of November 2014 TOP500 results, these old GIMPS numbers would no longer make the list.

Previously, this was approximately 50 TFLOPS in early 2010, 30 TFLOPS in mid-2008, 20 TFLOPS in mid-2006, and 14 TFLOPS in early 2004.

src: i.ytimg.com

Software license

Although the GIMPS software's source code is publicly available, technically it is not free software, since it has a restriction that users must abide by the project's distribution terms. Specifically, if the software is used to discover a prime number with at least 100,000,000 decimal digits, the user will only win $50,000 of the $150,000 prize offered by the Electronic Frontier Foundation.

Third-party programs for testing Mersenne numbers, such as Mlucas and Glucas (for non-x86 systems), do not have this restriction.

GIMPS also "reserves the right to change this EULA without notice and with reasonable retroactive effect."

src: fm.cnbc.com

Primes found

All Mersenne primes are in the form M_p, where p is the (prime) exponent. The prime number itself is 2^p - 1, so the smallest prime number in this table is 2^1398269 - 1.

M_n is the rank of the Mersenne prime based on its exponent.

^{^ +} As of August 22, 2018, 44,599,787 is the largest exponent below which all other prime exponents have been checked twice, so it is not verified whether any undiscovered Mersenne primes exist between the 47th (M_43112609) and the 50th (M_77232917) on this chart; the ranking is therefore provisional. Furthermore, 80,198,801 is the largest exponent below which all other prime exponents have been tested at least once, so all Mersenne numbers below the 50th (M_77232917) have been tested.

^{^ ?} The number M_77232917 has 23,249,425 decimal digits. To help visualize the size of this number, a standard word processor layout (50 lines per page, 75 digits per line) would require 6,199 pages to display it. If one were to print it out using standard printer paper, single-sided, it would require approximately 12 reams of paper.

Whenever a possible prime is reported to the server, it is verified first before it is announced. The importance of this was illustrated in 2003, when a false positive was reported to possibly be the 40th Mersenne prime but verification failed.

src: i.ytimg.com

See also

• Berkeley Open Infrastructure for Network Computing
• Distributed computing
• List of distributed computing projects
• PrimeGrid

src: 3.bp.blogspot.com

References

src: i.ytimg.com

External links

• Official website
• PrimeNet server
• Mersenne Wiki
• GIMPS Forum

Source of article : Wikipedia