Create a New Proof-Code

Each prime has an associated proof-code which specifies the program used to prove that it is prime, the person running the program, and sometimes other persons, programs and projects. You should reuse your proof-codes as longs as none of these change. If something has changed, then use this page to create a new proof-code.

Only use this page after you have created a prover-account. Each prover-account can have many proof-codes, but you may have only one prover-account. Click new to create a prover-account if you do not have one.

What person will own this code? (Give the database ID or username of prover.)

We must first specify the proof method. For example, did you prove the number prime using Gallot's Proth.exe? If so, check the appropriate box below. The database contains some projects for which it knows the proof method (for example 'Seventeen or Bust' uses Gallot's program) so please select the best answer from the list below.

Jean Penné's LLR
OpenPFGW (a.k.a. PrimeForm)
Marcel Martin's Primo
Pavel Atnashev's PRST
CM a fast ECPP implementation Andreas Enge
George Woltman's Prime95
Yves Gallot's Proth.exe
John Renze's Coppersmith-Howgrave-Graham PARI script
Seventeen or Bust
FastECPP as Implemented by Morain; Franke, Kleinjung and Wirth
Phil Carmody's ForEis
RMA.exe by Shane Findley
Tony Forbes' VFYPR
other proof program (more information will be required)

You may have worked with other persons, projects or programs that you feel deserve credit. List those are to be included using either their usernames or database ids (separated by commas). If there are no others to list, then just enter the English word 'none'.

Technical Notes:

  1. Do not create codes unless you need them immediately.
  2. If you do not add primes within 24 hours after creating this entry, it will be automatically deleted.
  3. You may not use HTML tags in the above fields.
  4. The editors reserve the right to edit all fields of all entries.
  5. When forming the list of the top twenty: provers, programs and projects; the persons and projects in this code will share credit (e.g., two humans means each gets 1/2 credit). Each program will get full credit (this is to encourage proper reporting). See the bottom of the page top twenty for more information.
  6. You are not allowed to specify the order in which members of a code are listed. They will be canonically sorted when the code is created.
  7. Do not create codes simply for vanity purposes--e.g., to use a different proof-code for each type of prime you use. If you do, you may lose privileges on these pages. Proof-codes should accurately reflect the persons, programs and projects being used.
  8. Note x-codes must have a comment added to explain how the numbers were proven prime. If you do not supply this information, we may change the entry. (For example, we may convert the x-code to a p-code or L-code, should the only proof we know about be our own verification with OpenPFGW or LLR.)
Printed from the PrimePages <t5k.org> © Reginald McLean.