Proth prime

A Proth number takes the form ${\displaystyle N=k2^{n}+1}$ where k and n are positive integers, ${\displaystyle k}$ is odd and ${\displaystyle 2^{n}>k}$. A Proth prime is a Proth number that is prime.[1][2]

Without the condition that ${\displaystyle 2^{n}>k}$, all odd integers larger than 1 would be Proth numbers.[3]

The primality of a Proth number can be tested with Proth's theorem, which states that a Proth number ${\displaystyle p}$ is prime if and only if there exists an integer ${\displaystyle a}$ for which

${\displaystyle a^{\frac {p-1}{2}}\equiv -1{\pmod {p}}.}$[2][4]

This theorem can be used as a probabilistic test of primality, by checking for many random choices of ${\displaystyle a}$ whether ${\displaystyle a^{\frac {p-1}{2}}\equiv -1{\pmod {p}}.}$ If this fails to hold for several random ${\displaystyle a}$, then it is very likely that the number ${\displaystyle p}$ is composite. This test is a Las Vegas algorithm: it never returns a false positive but can return a false negative; in other words, it never reports a composite number as "probably prime" but can report a prime number as "possibly composite".

In 2008, Sze created a deterministic algorithm that runs in at most ${\displaystyle {\tilde {O}}((k\log k+\log N)(\log N)^{2})}$ time, where Õ is the soft-O notation. For typical searches for Proth primes, usually ${\displaystyle k}$ is either fixed (e.g. 321 Prime Search or Sierpinski Problem) or of order ${\displaystyle O(\log N)}$ (e.g. Cullen prime search). In these cases algorithm runs in at most ${\displaystyle {\tilde {O}}((\log N)^{3})}$, or ${\displaystyle O((\log N)^{3+\epsilon })}$ time for all ${\displaystyle \epsilon >0}$. There is also an algorithm that runs in ${\displaystyle {\tilde {O}}((\log N)^{24/7})}$ time.[1][5]

As of 2019, the largest known Proth prime is ${\displaystyle 10223\cdot 2^{31172165}+1}$. It is 9,383,761 digits long.[6] It was found by Szabolcs Peter in the PrimeGrid distributed computing project which announced it on 6 November 2016.[7] It is also the largest known non-Mersenne prime.[8]

The project Seventeen or Bust, searching for Proth primes with a certain ${\displaystyle t}$ to prove that 78557 is the smallest Sierpinski number (Sierpinski problem), has found 11 large Proth primes by 2007, of which 5 are megaprimes. Similar resolutions to the prime Sierpiński problem and extended Sierpiński problem have yielded several more numbers.

As of December 2019, PrimeGrid is the leading computing project for searching for Proth primes. Its main projects include:

• general Proth prime search
• 321 Prime Search (searching for primes of the form ${\displaystyle 3\times 2^{n}+1}$, also called Thabit primes of the second kind)
• 27121 Prime Search (searching for primes of the form ${\displaystyle 27\times 2^{n}+1}$ and ${\displaystyle 121\times 2^{n}+1}$)
• Cullen prime search (searching for primes of the form ${\displaystyle n\times 2^{n}+1}$)
• Sierpinski problem (and their prime and extended generalizations) – searching for primes of the form ${\displaystyle k\times 2^{n}+1}$ where k is in this list:

k ∈ {21181, 22699, 24737, 55459, 67607, 79309, 79817, 91549, 99739, 131179, 152267, 156511, 163187, 200749, 202705, 209611, 222113, 225931, 227723, 229673, 237019, 238411}

As of December 2019, the largest Proth primes discovered are:[9]

Small Proth primes (less than 10²⁰⁰) have been used in constructing prime ladders, sequences of prime numbers such that each term is "close" (within about 10¹¹) to the previous one. Such ladders have been used to empirically verify prime-related conjectures. For example, Goldbach's weak conjecture was verified in 2008 up to 8.875 × 10³⁰ using prime ladders constructed from Proth primes.[28] (The conjecture was later proved by Harald Helfgott.[29][30])

Also, Proth primes can optimize den Boer reduction between the Diffie-Hellman problem and the Discrete logarithm problem. The prime number 55 × 2²⁸⁶ + 1 has been used in this way.[31]

As Proth primes have simple binary representations, they have also been used in fast modular reduction without the need for pre-computation, for example by Microsoft.[32]