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 ... ... L2541, L3202, L3345, L3413, L3489
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 04/08/2013)
Active primes:on current list: 740, rank by number 2
Total primes: number ever on any list: 3752
Production score: for current list 50 (normalized: 2993), total 51.0598, rank by score 4
Largest prime: 1271 · 24850526 - 1 ‏(‎1460157 digits) via code L1828 on 10/22/2012
Most recent: 4135 · 21221887 - 1 ‏(‎367829 digits) via code L1959 on 05/17/2013
Entrance Rank: mean 841.80 (minimum 27, maximum 45070)

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.