Riesel Prime Search
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
 
project 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 reflect on the primes currently on the list. (Many of the terms that are used here are explained on another page.)

Proof-code(s):
L137, L138, L139, L140, L141 ... ... L3764, L3887, L3933, L3967, p390
E-mail address:
kosmaj(at)yahoo(dot)com
Web page:http://www.mersenneforum.org/forumdisplay.php?f=59
Username: RPS (entry created on 10/30/2005)
Database id:819 (entry last modified on 07/31/2015)
Active primes:on current list: 721.5, rank by number 2
Total primes: number ever on any list: 4363.5
Production score: for current list 51 (normalized: 3205), total 52.0169, rank by score 5
Largest prime: 3343 · 27166019 - 1 ‏(‎2157191 digits) via code L1884 on 09/29/2016
Most recent: 49 · 24365175 - 1 ‏(‎1314051 digits) via code L1959 on 09/18/2017
Entrance Rank: mean 765.61 (minimum 25, maximum 4344)

Descriptive Data: (report abuse)
The "Riesel Prime Search" project is searching for Riesel primes k*2^n-1, k>1. We have three subprojects as follows.
(1) k's that can produce many primes in the given range of exponent n,
(2) low-weight k's that produce a very small number of primes [opposite to (1) above],
(3) small k < 300 (with exception of those k's already reserved by other projects).

How To Join
Everybody is welcome to join the project. Just visit the forum link given above, have a look what's going on, and reserve your first file to test!

Software Used
Primality Testing: LLR. pfgw and Proth.exe used for small exponents (less than 10k or 20k) and for double-checking.
Sieving: srsieve and NewPGen.

I administer Riesel Prime Search and I would like to
Edit this page
Surname: Rieselprime (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.