

Latest News
SPEEDUP: NEW SB CLIENT v28.5 AVAILABLE
(posted by Louie Helm)

Thursday, 03 Jul 2014

There's a new version of SB available thanks to even more great work by George Woltman.
Enhancements Include
 Reduced memory usage.
 Supports Intel's new fused multiply add instruction introduced with the Haswell CPU. This results in faster FFTs.
 Minor optimizations may give a very small performance boost for AVX CPUs.
 Benchmarking improvements, mostly on multicore machines.
As always, drop by the forums if you run into any trouble or have questions about the new client.

NEW SB CLIENT v27.9 AVAILABLE
(posted by Louie Helm)

Wednesday, 14 May 2014



Friday, 22 Nov 2013

What do Newcomb's Problem, Sierpiński Numbers, and Chaos Theory have in common? According to "The Math Book", they are each one of history's 250 major milestones in mathematics.
The Math Book notes for Sierpiński Numbers that, "As of February 2008, there were a mere six candidate numbers that had not been eliminated."
"If mathematicians are able to find a prime of the proper form for all the remaining k, the Sierpiński problem will be solved and the [over] 50year quest ended."
So how can we hasten the end of our quest? I suggest people start crunching SB really hard again  for at least the next couple months. Why? Because now is a "lucky" time! No, really! This is historically the luckiest season for SB finding primes:
 64% of the primes found by SB have been found between Thanksgiving and New Years, including the first 7!
BONUS: I currently have 6 copies of "The Math Book" and will be mailing a signed copy to every discoverer of the next 6 primes. So get crunching! Let's make another brilliant end of year find!

SPEEDUP: NEW SB CLIENT v27.7 AVAILABLE
(posted by Louie Helm)

Wednesday, 16 May 2012

There's a new version of SB available thanks to even more great work by George Woltman.
Major Enhancements
 25% speed increase on Intel i5/i7 processors
 Better multithreaded performance
 Faster FFT for Core 2 w/ 1MB L2 cache
 Mac OS X client now GUI instead of CLI
Also, it's worth mentioning that Seventeen or Bust recently had its 10 year anniversary! Congratulations to everyone who has stuck with us over the years and continues to crunch for SB! This occasion was marked by being featured in Cliff Pickover's The Math Book as one of the "250 Milestones in the History of Mathematics".
As always, drop by the forums if you run into any trouble or have questions about the new client.

(See all news articles)
You Could Be Famous!
If you're
lucky enough to eliminate a multiplier, not only will you receive credit
for the mathematical discovery, but you'll also have discovered an
extremely large prime number: large enough to get your name in
the annals of mathematical history! Eleven lucky participants have
helped to discover some of the largest primes ever uncovered! You
could be next!
What Is It?
SB (Seventeen or Bust) is a distributed computing system working on the
Sierpinski problem. We utilizes the spare computational power
of hundreds of computers around the world, creating a powerful network
of machines working together on the problem. Anyone can participate:
we provide software that installs on your computer and uses
its "spare time" to help make mathematical discoveries. You won't even notice
it's running, since it only uses your processor if it would otherwise
be sitting unused.
The Sierpinski problem itself deals with numbers of the form N
= k * 2^n + 1, for any odd k and n >
1. Numbers of this form are called Proth numbers. If, for some specific
value of k, every possible choice of n results in a
composite
(nonprime)
Proth number N, then that k is called a
Sierpinski number. The Sierpinski problem itself is: "What is the
smallest Sierpinski number?" (For a more rigorous mathematical
discussion of the problem, see prothsearch.net's
Sierpinski Problem
page.)
John Selfridge proved, 45 years ago, that k = 78,557 is a
Sierpinski number. Most number theorists believe that this is the smallest,
but it hasn't yet been proven. In order to prove it, we have to show that
every single k less than 78,557 is not a Sierpinski number,
and to do that, we have to find some n that makes k *
2^n + 1 prime. When Seventeen or Bust was started, this had already
been done for all but 17 values of k; hence the name of the
project. After 7 years of computation, we have eliminated 11 multipliers:
eleven down, six to go.
Who Are You Guys?
The project was started in March of 2002 as a collaboration between
Louie Helm,
at the University of Michigan, and
David
Norris at the University of Illinois.
Countless individuals have also contributed to the project, most notably
George Woltman (author of the GIMPS project), who contributed
blindinglyfast squaring routines, and Michael Garrison, who maintains the
project's central server. To these individuals and all the participants that has helped
make this project possible, we sincerely thank you.

