Prime95

Prime95 / Mprime

Workload type	LL, PRP, TF, P-1, ECM
First release	1996
Latest version	29.4 2017-11-03

Prime95 is the freeware computer program written by George Woltman that is used by GIMPS, a distributed computing project dedicated to finding new Mersenne prime numbers. More specifically, Prime95 refers to the Windows and Mac OS X versions of the software.

MPrime is the Linux command-line interface version of Prime95, to be run in a text terminal or in a terminal emulator window as a remote shell client. It is identical to Prime95 in functionality, except it lacks a graphical user interface.

As of April 2018, Prime95 was used to discover all 16 Mersenne primes found by GIMPS.

Implementation

Although most of the GIMPS software's source code is publicly available, it is technically not free software as users must abide by the project's distribution terms if the software is used to discover a prime number with at least 100,000,000 decimal digits and wins the $150,000 bounty offered by the EFF (Cooperative Computing Awards). As such, a user who uses Prime95 to discover a qualifying prime number would not be able to claim the prize directly. A free software package would not have this restriction.

The code that is used to generate checksums is not publicly available due to security reasons. The rewritten FFT assembly code in the versions since 27 (May 2012) uses AVX instructions of Intel's Sandy Bridge and Ivy Bridge CPUs (Core i3/i5/i7-2xxx and 3xxx models), resulting in a huge performance increase compared to previous versions.

Prime95 currently does not have GPU support, although Woltman has indicated that it is under development. However, there are third-party programs, such as CUDALucas, gpuOwL and clLucas, that make use of the processing power of GPUs.

Finding Mersenne primes by distributed computing

As of Mai 2017, 15 new Mersenne primes have been found by the network of participants, and, on average, a new Mersenne prime is discovered approximately every year. Scott Kurowski wrote the Internet PrimeNet server that supports the Prime95/MPrime software on GIMPS, one of the earliest grid computing projects, researching Mersenne prime numbers, to demonstrate distributed computing software of Entropia, a company he founded in 1997.

Processing power

A table of selected benchmarks is provided below. The complete list can be found at the official GIMPS website.

Comparison of CPU core power	Frequency	Cores	FFT		Trial factoring	TDP
Prime95 benchmark	(per core)		2048k	4096k	65-bit
Platform CPU model	MHz		ms	ms	ms	Watts
Intel Atom 330	1600	2	621	1166	46	8
Intel Atom D510	1664	2	585.91	1954.40	25.65	13
Intel Pentium III	1151	1	438.10	922.58	50.59	30
AMD Athlon	1054	1	457.40	774.49	56.08	?
AMD Fusion E-350	1596	2	222.03	491.02	15.18	18
AMD Athlon XP 2000+	1640	1	201.21	448.28	32.80	~60
Intel Pentium 4	3078	1	72.40	162.02	14.91	86
AMD Phenom II X4	3414	4	34.86	76.27	4.59	125
Intel Core2 Duo E8600	3334	2	34.15	73.07	4.89	65
Sandy Bridge Pentium G620T	2159	2	41.09	72.53	4.99	35
AMD Phenom II X6 1100T	3310	6	32.68	69.54	3.85	125
Intel Core i5-2500K	3330	4	23.94	53.24	3.49	95
Intel Core i7-2600K	3463	4	21.75	45.35	3.67	95

Use for stress testing

Over the years, Prime95 has become extremely popular among PC enthusiasts and overclockers as a stability testing utility. It includes a "Torture Test" mode designed specifically for testing PC subsystems for errors in order to help ensure the correct operation of Prime95 on that system. This is important because each iteration of the Lucas-Lehmer depends on the previous one; if one iteration is incorrect, so will be the entire primality test.

The stress-test feature in Prime95 can be configured to better test various components of the computer by changing the Fast Fourier transform (FFT) size. Three pre-set configurations are available: Small FFTs and In-place FFTs, and Blend. Small and In-place modes primarily test the FPU and the caches of the CPU, whereas the Blend mode tests everything, including the memory.

By selecting Custom, the user can gain further control of the configuration. For example, by selecting 8-8 kB as the FFT size, the program stresses primarily the CPU. By selecting 2048-4096 kB and unchecking the "Run FFTs in-place" checkbox, providing the maximum amount of RAM free in the system, the program tests the memory and the chipset. If the amount of memory to use option is set too high, then the system will start using the paging file and the test will not stress the memory.

On an absolutely stable system, Prime95 would run indefinitely. If an error occurs, at which point the stress test would terminate, this would indicate that the system may be unstable. There is an ongoing debate about terms "stable" and "Prime-stable", as Prime95 often fails before the system becomes unstable or crashes in any other application. This is because Prime95 is designed to subject the CPU to an incredibly intense workload, and to halt when it encounters even one minor error, whereas most normal applications do not stress the CPU anywhere near as much, and will continue to operate unless they encounter a fatal error.

In the overclocking community, a rule of thumb is often used to determine how long to run Prime95: test the CPU (8 kB FFT) for 10 hours and the memory (4096 kB FFT) for 10 hours, and if the system passes, there is a high chance that it is stable. Twenty-four hours of testing is recommended to be sure, as errors may show up after 16 or more hours of testing (compared to, say, just four hours of testing). Moreover, a large proportion of system overclockers and enthusiasts favor Prime95 over other benchmarking suites because Prime95 pushes the CPU's floating point units extremely hard, causing the CPU to become extremely hot. In addition, Prime95 stresses a computer far more than the majority of software based torture-suites. The nature of this is because the operating system usually shuts down the floating-point unit when unused by other programs, whereas Prime95 is well-optimized to continuously and effectively thread the FPU, causing it to be deeply pipelined, thereby generating significantly more heat because of elevated power consumption under the massive workload conditions. In CPUs which are not adequately cooled, errors are likely to occur. Prime95 also constantly accesses main memory at up to 60 MB per second. This constant activity will detect memory problems that other programs will not.

Lastly, power supply units of any machine running Prime95 are subject to the consistent ramifications of such harsh conditions. Power must be maintained clean, while providing adequate voltage, particularly to the CPU, RAM, and chipsets (mainboard chipsets such as the Northbridge where the memory controller may or may not reside; see Athlon 64 or Intel Core i7 for on-die memory controllers) to provide peak performance while maintaining stability. Cray Research used programs similar to Prime95 for over a decade for the purpose of stability testing.

Limits

Version 24 and older of Prime95 cannot test Mersenne numbers beyond 2^79,300,000-1 (Web Archive). This is slightly shorter than a 24 million digit number. Newer versions of Prime95 (version 25, 26 and 27) can handle Mersenne numbers up to the limit 2^596,000,000-1 (see here).

Prime95 does not fully stress all processor threads when the threads number is more than 64 in Windows, or 32 for the 32-bit version. Windows will manage the processors in groups when the number beyond 64. Each group will only have maximum of 64. Prime95 will only load into one processor group.

Worktodo.txt

Main article: worktodo.txt

File worktodo.txt takes Lucas-Lehmer test assignments in the following formats:[1]

Test=<ASSIGNMENT ID>,<EXPONENT>,<TRIAL FACTORING EXPONENT>,<P-1 FACTORING>
DoubleCheck=<ASSIGNMENT ID>,<EXPONENT>,<TRIAL FACTORING EXPONENT>,<P-1 FACTORING>

Where:

• <ASSIGNMENT ID> - unique assignment ID generated by the PrimeNet v5 server as an anti-poaching measure
• <EXPONENT> - Mersenne number exponent
• <TRIAL FACTORING EXPONENT> - indicates power of 2 to which trial factoring had been attempted
• <P-1 FACTORING>:
  • 0 indicates that p-1 factoring still needs to be done
  • 1 indicates that p-1 factoring attempted with no small factors found

Examples:

Test=DDD21F2A0B252E499A9F9020E02FE232,48295213,69,0
DoubleCheck=B83D23BF447184F586470457AD1E03AF,22831811,66,1

See also

• GIMPS clients
• Mlucas
• Glucas
• GPU clients
• Primality testing program

External links

• Prime95 download page