| 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 "Primo"
m |
m |
||
| Line 1: | Line 1: | ||
| − | {{InfoboxProgram|title=Primo|workload=ECPP|release=2001-08-03|latest=4.3.0<br><small>2018-02-21</small>}} | + | {{InfoboxProgram |
| + | |title=Primo | ||
| + | |workload=ECPP | ||
| + | |release=2001-08-03 | ||
| + | |latest=4.3.0<br><small>2018-02-21</small> | ||
| + | }} | ||
'''Primo''' is a computer program which tests numbers for [[prime|primality]] using the [[Elliptic Curve Primality Proving]] (ECPP) [[algorithm]], the fastest known general-purpose primality testing algorithm. Primo is developed by Marcel Martin using Free Pascal and Lazarus IDE. | '''Primo''' is a computer program which tests numbers for [[prime|primality]] using the [[Elliptic Curve Primality Proving]] (ECPP) [[algorithm]], the fastest known general-purpose primality testing algorithm. Primo is developed by Marcel Martin using Free Pascal and Lazarus IDE. | ||
| Line 9: | Line 14: | ||
==See also== | ==See also== | ||
| − | *[[ | + | *[[ECPP-DJ]] - an open-source implementation of ECPP test, which can also verify certificates generated by Primo. |
==External links== | ==External links== | ||
| Line 15: | Line 20: | ||
*[http://mathworld.wolfram.com/EllipticCurvePrimalityProving.html MathWorld] | *[http://mathworld.wolfram.com/EllipticCurvePrimalityProving.html MathWorld] | ||
[[Category:Software]] | [[Category:Software]] | ||
| + | [[Category:Primality testing program]] | ||
Revision as of 16:19, 13 February 2019
| Workload type | ECPP |
| First release | 2001-08-03 |
| Latest version | 4.3.0 2018-02-21 |
Primo is a computer program which tests numbers for primality using the Elliptic Curve Primality Proving (ECPP) algorithm, the fastest known general-purpose primality testing algorithm. Primo is developed by Marcel Martin using Free Pascal and Lazarus IDE.
The program does not require a number to be of any specific form. If a number is found to be prime, a primality certificate is produced, which can be quickly verified.
The record largest prime certified using Primo (as of April 2018) is 2116224-15905. It has 34,987 digits. The certification of this number was done by Peter Kaiser with Primo 4.1.1. The certification process took 694 days for the phase 1 and 58 days for the phase 2 using a Dual Intel E2667 processor (16 cores at 3.2 GHz).
The Factoring Database allows users to upload Primo certificates.
See also
- ECPP-DJ - an open-source implementation of ECPP test, which can also verify certificates generated by Primo.
