The original Sierpinski and Riesel problems counted the number of primes found in intervals f_m: 2^m <= n < 2^(m+1). See:

http://www.prothsearch.net/rieselprob.html
http://www.prothsearch.net/sierp.html
We just completed phase 14, by testing all of our candidates past n=32768. By my count, we have 275 k values (mostly Riesels) to test up to n=65536, before we complete f15.

Anyone want to conjecture how long it will take us? Anyone want to help? There's a lot of low-hanging fruit around here...