Jean Penné's LLR

A titan, as defined by Samuel Yates, is anyone who has found a titanic prime. This page provides data on those that have found these primes. The data below only reflects on the primes currently on the list. (Many of the terms that are used here are explained on another page.)

Proof-code(s):	p132, p136, p146, p153, p182 ... ... g427, p377, CH8, p378, SB12
Active wild codes:	^L\d+
Code prefix:	L
E-mail address:	(e-mail address unpublished)
Web page:	http://jpenne.free.fr/index2.html
Username	LLR	(entry created on 12/27/2002 15:11:16 UTC)
Database id:	431	(entry last modified on 11/7/2023 03:37:45 UTC)
Program Does *:	special, plus, minus
Active primes:	on current list: 4721, rank by number 1
Total primes:	number ever on any list: 53286
Production score:	for current list 56 (normalized: 98647), total 56.7030, rank by score 3
Largest prime:	516693^2097152 - 516693^1048576 + 1 ‏(‎11981518 digits) via code L4561 on 10/2/2023 00:29:30 UTC
Most recent:	42781592²⁶²¹⁴⁴ + 1 ‏(‎2000489 digits) via code L5460 on 11/19/2024 22:38:50 UTC
Entrance Rank:	mean 1319.86 (minimum 7, maximum 78740)
Unprocessed:	prime submissions still untested or inprocess: 1.

Descriptive Data: (report abuse)

LLR takes an input file from Paul Jobling's NewPgen, and proves the primality of numbers of the form k^.2ⁿ± 1 with k < 2ⁿ. It implements the Lucas-Lehmer-Riesel and Proth algorithms, using George Woltman's gwnums and assembly code routines for fast multiplications and squarings.

(Get llrxx.zip for Windows, llrxxlinux.zip or llrxxslinux.zip for Intel/Linux, where xx is the version number.)

Surname: LLR (used for alphabetizing and in codes).
Note that the prime search page will not display more than 16,000 primes.
Unverified primes are omitted from counts and lists until verification completed.

I administer Jean Penné's LLR and I would like to