Geoffrey Reynolds' srsieve
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
 
program 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):
L190, p196, p201, p202, p203 ... ... L4696, L4698, L4699, L4700, L4703
E-mail address:
g_w_reynolds(at)yahoo(dot)co(dot)nz
Web page:http://sites.google.com/site/geoffreywalterreynolds/programs/
Username: Srsieve (entry created on 07/04/2006)
Database id:905 (entry last modified on 11/29/2017)
Program Does *: sieve
Active primes:on current list: 4273, rank by number 2
Total primes: number ever on any list: 26307
Production score: for current list 54 (normalized: 42564), total 54.5442, rank by score 3
Largest prime: 10223 · 231172165 + 1 ‏(‎9383761 digits) via code SB12 on 11/06/2016
Most recent: 2899 · 21462634 + 1 ‏(‎440301 digits) via code L2117 on 12/09/2017
Entrance Rank: mean 1384.18 (minimum 7, maximum 69138)

Descriptive Data: (report abuse)

A 'fixed k' sieve for multiple integer sequences in n of the form k*b^n+c, where k < 2^64, |c| < 2^63, b < 2^32.

Srsieve was originally developed to speed up sieving for the Sierpinski/Riesel base 5 projects, which seek primes of the form k*5^n+/-1 for certain even values of k.

Some specialised versions of the program are faster in certain cases:

sr1sieve: A single sequence k*b^n+/-1 with k < 2^64, b < 2^32.

sr2sieve: Multiple sequences k*b^n+/-1 or b^n+/-k with k < 2^32, b < 2^32.

sr5sieve: Multiple base 5 sequences k*5^n+/-1 with k < 2^32.

I administer Geoffrey Reynolds' srsieve and I would like to
Edit this page
Surname: Srsieve (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.