Proof-code: x8

Samuel Yates began, and this site continues, a database of the largest known primes. Primes in that database are assigned a proof-code to show who should be credited with the discovery as well as what programs and projects they used. (Discoverers have one prover-entry, but may have many proof-codes because they use a variety of programs...)

This page provides data on x8, one of those codes.

Code name (*):x8   (See the descriptive data below.)
Persons (*):1 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Smith_PW
Number of primes:total 1
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 40.4503

Descriptive Data: (report abuse)
Our program is a straightforward implementation of Proth's Theorem, using GMP and marginally-smarter-than-brute-force modular multiplication (i.e., simply taking advantage of the special form of the modulus to save a small bit of work). I don't believe in using somebody else's binaries and claiming that it proves something without having seen the source myself.
I am a member of this code and I would like to:
Edit the descriptive data above as:

Below is additional information about this entry.

Display (text):Smith_PW
Display (short):Smith_PW
Database id:759 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2021-07-24 05:37:17
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.