1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
|
Source: prime-net
Section: non-free/misc
Priority: optional
Maintainer: Francois Gouget <fgouget@multimania.com>
Standards-Version: 2.5.0.0
Package: prime-net
Architecture: i386
Conflicts:
Replaces:
Depends: ${shlibs:Depends}
Description: donate unused CPU cycles - PrimeNet GIMPS client
Donate your extra CPU cycles to a worthy cause!
.
You could discover one of the most coveted finds in all of Mathematics -
a new Mersenne prime number. The Great Internet Mersenne Prime Search
(GIMPS) harnesses the power of thousands of small computers like yours
to solve the seemingly intractable problem of finding HUGE, hundreds of
thousands of digits or more, prime numbers.
.
Join in on this fun, yet serious research project and in addition to the
joy of making a mathematical discovery, you might win some cash. The
Electronic Frontier Foundation is offering a $100,000 award to the
first person to discover a ten million digit prime number!
.
Fair warning: A 500 MHz PC will take a full year to test a single exponent
with only 1 chance in 250,000 of finding such a prime number. But you can
also do very useful work in much less time: primality tests on smaller primes
take about a month and factoring tests take much less. The details of how
GIMPS will handle this award are at http://www.mersenne.org/prize.htm
.
Note that you can also use this package to participate to ECM and P-1
factoring projects. Some of these projects, like the Fermat number
factorisation, also carry cash prizes.
.
For more information, see http://www.mersenne.org/prime.htm
|
