| 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 "Mlucas"
(update version number and date (per https://mersenneforum.org/showpost.php?p=510279&postcount=13), grammar fix) |
m (Text replacement - "Ernst Mayer" to "Ernst W. Mayer") |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Line 6: | Line 6: | ||
}} | }} | ||
| − | '''Mlucas''' is a program for performing [[Lucas-Lehmer test]]s of prime-exponent [[Mersenne number]]s. It is written by [[Ernst Mayer]] using C programming language and [[ARM]] assembly. It also includes an optional Python script for assignment management for the [[GIMPS]] project's [[PrimeNet]] server. | + | '''Mlucas''' is a program for performing [[Lucas-Lehmer test]]s of prime-exponent [[Mersenne number]]s, and Pépin tests of [[Fermat number]]s. It is written by [[Ernst W. Mayer]] using C programming language and [[ARM]] assembly. It also includes an optional Python script for assignment management for the [[GIMPS]] project's [[PrimeNet]] server. |
Mlucas is an open-source program and, unlike [[George Woltman]]'s [[Prime95]], does not impose prize-sharing rules, should a user be lucky as to find a new prime eligible for the monetary prize offered by the [[Electronic Frontier Foundation]]. | Mlucas is an open-source program and, unlike [[George Woltman]]'s [[Prime95]], does not impose prize-sharing rules, should a user be lucky as to find a new prime eligible for the monetary prize offered by the [[Electronic Frontier Foundation]]. | ||
| Line 14: | Line 14: | ||
As of June 2017, Mlucas v17.0 run only about 10% slower than Prime95 on powerful hardware. | As of June 2017, Mlucas v17.0 run only about 10% slower than Prime95 on powerful hardware. | ||
| − | The program was used to verify primes [[M38]], [[M45]], [[M46]], [[M47]], [[M48]], [[M49]] and [[ | + | The program was used to verify primes [[M38]], [[M45]], [[M46]], [[M47]], [[M48]], [[M49]], [[M50]] and [[M51]] at the times of their discovery. |
==External links== | ==External links== | ||
*[http://www.mersenneforum.org/mayer/README.html Mlucas homepage] | *[http://www.mersenneforum.org/mayer/README.html Mlucas homepage] | ||
*[http://www.mersenneforum.org/forumdisplay.php?f=118 Mlucas subforum] at [[MersenneForum]] | *[http://www.mersenneforum.org/forumdisplay.php?f=118 Mlucas subforum] at [[MersenneForum]] | ||
| + | *[https://www.mersenneforum.org/showthread.php?t=18748 Use of Mlucas code to test Fermat numbers] at [[MersenneForum]] | ||
[[Category:Software]] | [[Category:Software]] | ||
Latest revision as of 20:11, 11 August 2024
| Workload type | LL |
| First release | < 1999 |
| Latest version | 18.0 03-06-2019 |
Mlucas is a program for performing Lucas-Lehmer tests of prime-exponent Mersenne numbers, and Pépin tests of Fermat numbers. It is written by Ernst W. Mayer using C programming language and ARM assembly. It also includes an optional Python script for assignment management for the GIMPS project's PrimeNet server.
Mlucas is an open-source program and, unlike George Woltman's Prime95, does not impose prize-sharing rules, should a user be lucky as to find a new prime eligible for the monetary prize offered by the Electronic Frontier Foundation.
Mlucas includes optimizations for processors supporting AVX-512, AVX2, AVX, SSE2 or ARMv8 SIMD instruction sets.
As of June 2017, Mlucas v17.0 run only about 10% slower than Prime95 on powerful hardware.
The program was used to verify primes M38, M45, M46, M47, M48, M49, M50 and M51 at the times of their discovery.
