Conjectures 'R Us

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):

E-mail address:

gbarnes017

(at)

gmail

(dot)

com

Web page:

http://www.mersenneforum.org/forumdisplay.php?f=81

Username

CRUS

(entry created on 1/16/2008 00:08:15 UTC)

Database id:

1372

(entry last modified on 11/13/2025 15:30:19 UTC)

Active primes:

on current list: 367, rank by number 2

Total primes:

number ever on any list: 1250

Production score:

for current list 53 (normalized: 1849), total 53.3983, rank by score 4

Largest prime:

6962 · 31^2863120 - 1 ‏(‎4269952 digits) via code L5410 on 2/29/2020 08:27:37 UTC

Most recent:

241 · 24⁹⁸⁰⁸⁸¹ - 1 ‏(‎1353826 digits) via code A80 on 11/1/2025 21:05:02 UTC

Entrance Rank:

mean 1704.92 (minimum 20, maximum 4743)

Unprocessed:

prime submissions still untested or inprocess: 2.

Descriptive Data: (report abuse)

Our project aims to prove many of the Riesel and Sierpinski conjectures for bases 2 thru 1030 that are not currently being worked on by other projects or efforts.

Definition:
For every base (b) for the forms k*b^n+1 and k*b^n-1, there is a k-value for each form that has been conjectured to be the lowest 'Sierpinski value' (+1 form) or 'Riesel value' (-1) that is composite for all values of n >= 1.

Conjectures must have a finite covering set. k-values are not considered in instances where all n's are covered by one trivial factor, all n's are covered by algebraic factors or by a combination of algebraic factors and trivial factor(s), or make Generalized Fermat #'s.

We also have a BOINC effort named SRBase that helps greatly in working on the project. Details can be found at: https://srbase.my-firewall.org/sr5/

Surname: CRUS (used for alphabetizing and in codes).
Unverified primes are omitted from counts and lists until verification completed.

I administer Conjectures 'R Us and I would like to