View Single Post
Old 2021-01-22, 16:45   #8
kriesel's Avatar
Mar 2017
US midwest

2×7×359 Posts
Default Large exponents

Here, large is defined as an exponent beyond the limit, currently 109, which is almost 230
Before considering larger exponents, it's useful to consider the scale of effort needed near the limit of

TF to recommended bit levels for near the 109 limit takes days per exponent on the fastest gpus and best software.
P-1 testing to recommended bounds near the 109 limit takes ~4 days per exponent in GpuOwL on fast gpus such as Radeon VIIs.
Primality testing near the 109 limit takes around 6 months per exponent with GpuOwL on a Radeon VII. Prime95 benchmarks indicate about 13 months each primality test near 109 on a Xeon Phi 7250 (68 cores 1 worker at ~1.4-1.5 GHz clock and 16GB 7200MHz MCDRAM in same chip package).

ONLY PRP should be considered for such long tests. (LL testing lacks the Gerbicz error check in all existing software and lacks even the weak Jacobi symbol check in some software, so is unlikely to complete correctly for very long runs.)

Primality testing effort scales as roughly exponent2.1. P-1 effort and TF effort scale similarly, with a smaller proportionality constant, ~1/40 that of primality testing, each. Conversely, the probability of finding a prime diminishes per test as exponent increases.

Software support for large exponents is limited, and the more so as exponent increases. There is little reason to exert effort in software development for large exponents soon, since the remaining work in will take more than a century at currently projected rates.

A summary of software support is available in the attachment at
Interim residues for a limited wide ranging variety of fft lengths and specified exponents are available at covers status for exponents up to 1010, and coordinates trial factoring for exponents over 109 up to 232.

Gigadigit Mersennes are covered in subforum Operation Billion Digits
Assignment reservation and result submission page, and display of status for trial factoring is at
I do not know of any software currently capable of P-1 factoring such large numbers in a reasonable amount of time or with acceptable reliability. See for discussion of run time scaling and requirements. It's likely Mlucas will have sufficient P-1 capability implemented as a byproduct of the coming F33 attempt.
Gigadigit primality tests are technically possible now in Mlucas or certain versions of Gpuowl, but the duration per test on available hardware is longer than the likely hardware lifetime.So the hardware would need to be replaced and work in progress migrated, and great care exerted with backups of work in progress and error checking along the way.

There's a forum thread regarding 10-gigadigit numbers, in which even larger are also mentioned. Only trial factoring is feasible for these. There's little or no point in doing so, other than as an amusement.

Double Mersennes: For Mersenne numbers with Mersenne numbers as exponents, see the Operazione Doppi Mersennes subforum: Also There's a thread discussing when it might be feasible to primality test MM61. Assuming Moore's law continues, over 100 years. But Moore's law is slowing and faces hard physics limits.
Some of the challenges and changes required are discussed briefly in and

There's also a bit of discussion of the difficulty of even attempting TF on the triple Mersenne MMM127.

Top of reference tree:

Last fiddled with by kriesel on 2021-02-28 at 20:18
kriesel is online now