Seventeen or Bust

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):	No proof-code has created for this entry yet, use the link below to create one.
Active wild codes:	^SB\d+
Code prefix:	SB
E-mail address:	(e-mail address unpublished)
Web page:	http://www.seventeenorbust.com/
Username:	SB	(entry created on 12/26/2002)
Database id:	429	(entry last modified on 07/16/2017)
Active primes:	on current list: 6.5, rank by number 14
Total primes:	number ever on any list: 11.5
Production score:	for current list 53 (normalized: 6427), total 53.0185, rank by score 3
Largest prime:	10223 · 2^31172165 + 1 ‏(‎9383761 digits) via code SB12 on 11/06/2016
Most recent:	10223 · 2^31172165 + 1 ‏(‎9383761 digits) via code SB12 on 11/06/2016
Entrance Rank:	mean 6.57 (minimum 4, maximum 10)

Descriptive Data: (report abuse)

Seventeen or Bust is a distributed computing project aimed at solving the Sierpinski problem. With the aid of several thousand computers, run by public participants around the world, Seventeen or Bust is searching for primes in sequences of the form k(2ⁿ) + 1, for fixed k. Our goal is to exhibit primes for the remaining candidates k < 78,557, and thereby prove that k = 78,557 is the smallest Sierpinski number.

The project was conceived in March of 2002 by two college undergraduates. After some planning and a lot of programming, the first public client was released on April 1. The project is now administered by:

Louis Helm, a computer engineer in Austin, Texas.
David Norris, a software engineer in Urbana, Illinois.
Michael Garrison, a Computer Science undergraduate at Eastern Michigan University in Ypsilanti, Michigan.

The project's number crunching core is contributed by George Woltman of GIMPS. Countless others have made contributions in the form of time, code and logistics.

The name of the project is due to the fact that, when founded, there were seventeen values of k for which no primes were known. As of January of 2005, Seventeen or Bust has eliminated seven of those seventeen candidates. The project might now be styled "Ten or Bust," but the original name will be kept for consistency.

Seventeen or Bust's seven prime discoveries are:

28433(2^7830457) + 1 with 2,357,207 decimal digits, discovered December 30, 2004. Crunched by a member of Team Prime Rib.
5359(2^5054502) + 1 with 1,521,561 decimal digits, discovered December 6, 2003. Crunched by Randy Sundquist.
54767(2^1337287) + 1 with 402,569 decimal digits, discovered December 23, 2002. Crunched by Peter Coels.
69109(2^1157446) + 1 with 348,431 decimal digits, discovered December 6, 2002. Crunched by Sean DiMichele.
44131(2⁹⁹⁵⁹⁷²) + 1 with 299,823 decimal digits, discovered December 5, 2002. Crunched by an anonymous participant.
65567(2^1013803) + 1 with 305,190 decimal digits, discovered December 2, 2002. Crunched by James Burt.
46157(2⁶⁹⁸²⁰⁷) + 1 with 210,186 decimal digits, discovered November 27, 2002. Crunched by Stephen Gibson.

You can help this project by downloading our client software and letting your computer crunch numbers in its spare time!

Error in data above: HTML_Tidy reports: line 32 column 181 - Warning: inserting implicit <p> line 7 column 1 - Warning: trimming empty <p> line 32 column 181 - Warning: trimming empty <p>

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

I administer Seventeen or Bust and I would like to