| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Great Internet Mersenne Prime Search"
(cat.) |
|||
| (16 intermediate revisions by one other user not shown) | |||
| Line 1: | Line 1: | ||
| − | The '''Great Internet Mersenne Prime Search''', also known as '''GIMPS''', is a prime example of [[distributed computing]] project at work and no pun intended. It is a [[Distributed | + | {{Shortcut|GIMPS|Great Internet Mersenne Prime Search: A [[distributed computing project]] for the search of [[Mersenne prime]]s.}} |
| + | The '''Great Internet Mersenne Prime Search''', also known as '''GIMPS''', is a prime example of [[distributed computing]] project at work and no pun intended. It is a [[:Category:Distributed computing project|collaborative project]] of volunteers, who use [[Prime95]], software that can be downloaded from the Internet, in order to search for [[Mersenne prime]] numbers. | ||
| − | Mersenne primes are named after [[Marin Mersenne]], a French monk and mathematician, who was born in 1588. Mersenne investigated a particular type of prime | + | Mersenne primes are named after [[Marin Mersenne]], a French monk and mathematician, who was born in 1588. Mersenne investigated a particular type of prime numbers: 2<sup>p</sup> - 1, in which ''p'' is an ordinary [[prime]]. |
| − | Mersenne primes are much rarer than | + | Mersenne primes are much rarer than ordinary primes, of which there are an infinite number. The GIMPS effort, exhaustively searching for possible candidates since 1996, has been responsible for discovering the largest Mersenne Primes to date. See the [[list of known Mersenne primes]] for more details. |
| − | This project has been rather successful: it has found 17 [[Mersenne prime]]s, each of which was the largest known prime at the time of discovery. The largest currently known prime is {{Greatest Mersenne Prime}}. Refer to the article on | + | This project has been rather successful: it has found 17 [[Mersenne prime]]s, each of which was the largest known prime at the time of discovery. The largest currently known prime is {{Greatest Mersenne Prime|text}}. Refer to the article on Mersenne primes for the complete list of GIMPS successes. |
| − | The project was founded by [[George Woltman]], who also wrote the [[Primality testing program|prime testing software]] [[Prime95]]. The GIMPS project was formed in January 1996. [[Scott Kurowski]] wrote the [[PrimeNet]] server software that supports the research to demonstrate Entropia distributed computing software, a company he founded in 1997. | + | The project was founded by [[George Woltman]], who also wrote the [[Primality testing program|prime testing software]] [[Prime95]]. The GIMPS project was formed in January 1996. [[Scott Kurowski]] wrote the [[PrimeNet]] server software that supports the research to demonstrate Entropia distributed computing software, a company he founded in 1997. In 2008, a legal entity was registered to administer GIMPS – [[Mersenne Research, Inc.]] |
| − | The [[Electronic Frontier Foundation]] offered $100,000 to the first person(s) who discovered a ten million | + | The [[Electronic Frontier Foundation]] (EFF) offered $100,000 to the first person(s) who discovered a [[ten million digits]] prime. GIMPS claimed this award. The owner of the discovering computer received $50,000 from the GIMPS foundation. |
| − | Although the GIMPS software has its source code available, technically it is not [[open source]], since it has a restriction which most open source/free software groups find unacceptable – users must abide by the prize distribution terms. This restriction will become meaningless when the | + | Although the GIMPS software has its source code available, technically it is not [[open source]], since it has a restriction which most open source/free software groups find unacceptable – users must abide by the prize distribution terms. This restriction will become meaningless when the EFF [[EFF prizes|prizes]] are claimed. |
For open source alternatives, [[Mlucas]] and [[Glucas]] are both licensed under the GPL. | For open source alternatives, [[Mlucas]] and [[Glucas]] are both licensed under the GPL. | ||
| − | Most GIMPS members [[ | + | Most GIMPS members [[Why_participate_in_GIMPS?|join the search]] for the thrill of possibly discovering a record-setting, rare, and historic, new Mersenne prime. All you have to do to be part of it, is to contribute spare or idle CPU cycles. Pretty cool. |
If you want to know more, there is a [[:Category:GIMPS FAQ|GIMPS FAQ]] available in this wiki. | If you want to know more, there is a [[:Category:GIMPS FAQ|GIMPS FAQ]] available in this wiki. | ||
| − | |||
| − | |||
| − | |||
| − | |||
==External links== | ==External links== | ||
| − | * [http://www.mersenne.org/ | + | * [http://www.mersenne.org/ GIMPS Home Page] |
| − | * [http://www.mersenneforum.org/ | + | * [http://www.mersenneforum.org/ GIMPS Forum] |
* [http://mersenne.org/primenet/ PrimeNet server] | * [http://mersenne.org/primenet/ PrimeNet server] | ||
| − | + | {{Navbox GIMPS}} | |
| − | {{ | + | {{Navbox Projects}} |
| − | {{ | + | [[Category:Great Internet Mersenne Prime Search| ]] |
| − | [[Category: | ||
Latest revision as of 14:37, 21 August 2019
The Great Internet Mersenne Prime Search, also known as GIMPS, is a prime example of distributed computing project at work and no pun intended. It is a collaborative project of volunteers, who use Prime95, software that can be downloaded from the Internet, in order to search for Mersenne prime numbers.
Mersenne primes are named after Marin Mersenne, a French monk and mathematician, who was born in 1588. Mersenne investigated a particular type of prime numbers: 2p - 1, in which p is an ordinary prime.
Mersenne primes are much rarer than ordinary primes, of which there are an infinite number. The GIMPS effort, exhaustively searching for possible candidates since 1996, has been responsible for discovering the largest Mersenne Primes to date. See the list of known Mersenne primes for more details.
This project has been rather successful: it has found 17 Mersenne primes, each of which was the largest known prime at the time of discovery. The largest currently known prime is 2136,279,841-1 (M52). Refer to the article on Mersenne primes for the complete list of GIMPS successes.
The project was founded by George Woltman, who also wrote the prime testing software Prime95. The GIMPS project was formed in January 1996. Scott Kurowski wrote the PrimeNet server software that supports the research to demonstrate Entropia distributed computing software, a company he founded in 1997. In 2008, a legal entity was registered to administer GIMPS – Mersenne Research, Inc.
The Electronic Frontier Foundation (EFF) offered $100,000 to the first person(s) who discovered a ten million digits prime. GIMPS claimed this award. The owner of the discovering computer received $50,000 from the GIMPS foundation.
Although the GIMPS software has its source code available, technically it is not open source, since it has a restriction which most open source/free software groups find unacceptable – users must abide by the prize distribution terms. This restriction will become meaningless when the EFF prizes are claimed.
For open source alternatives, Mlucas and Glucas are both licensed under the GPL.
Most GIMPS members join the search for the thrill of possibly discovering a record-setting, rare, and historic, new Mersenne prime. All you have to do to be part of it, is to contribute spare or idle CPU cycles. Pretty cool.
If you want to know more, there is a GIMPS FAQ available in this wiki.
External links
| General |
| Definitions |
| Work with GIMPS |
| Related |
| FAQ |
| Ongoing |
|
| Terminated |
