| log in |
|
1)
Message boards :
Number crunching :
Overall project progress?
(Message 4083)
Posted 4 Jan 2018 by gd_barnes For a good representation of the status of the project and other miscellaneous statistics, see the following links: http://www.noprimeleftbehind.net/crus/vstats_new/crus-stats.htm http://www.noprimeleftbehind.net/crus/vstats_new/crus-top20.htm http://www.noprimeleftbehind.net/crus/vstats_new/crus-unproven.htm http://www.noprimeleftbehind.net/crus/vstats_new/crus-proven.htm This link shows all bases, started and not started, and their corresponding conjectures: http://www.noprimeleftbehind.net/crus/tab/CRUS_tab.htm Thank you all for your contributions! |
|
2)
Message boards :
Number crunching :
Overall project progress?
(Message 1366)
Posted 28 Apr 2015 by gd_barnes [quote]Chances are anyone currently asking the question today won't live long enough to see the completion. And, of course, if any of the 2000+ conjectures comprising this project are false, the project length is effectively infinite and the project will never be able to prove all of the conjectures. This is not quite correct. All Riesel and Sierp bases on the project have a conjectured k-value that has a fully proven covering set of factors such that it is composite for all n's. None of the conjectures can be false. Hence the project is proven as not infinite; just very huge. What can be false is whether the conjectured k-value for each of these bases is the lowest one. That is what we have set out to do. So technically the project could be slightly smaller but no bigger than what it currently appears. So far we have proven that the k-value is the lowest one for about 36-37% of the bases. But in none of those proven cases is the conjecture > 2500, hence the difficulty of the larger-conjectured bases. No one here will be alive when all of these bases are proven. Further, likely no one here will be alive when simply Riesel base 2 is proven. It is likely to be several hundred (or thousand) years barring a new form of computing. At the current time for just that single base, all of the computers on earth running full time could not prove the conjecture in our lifetime. Both Riesel and Sierp base 2 were conjectured over 50 years ago. Great progress has been made but the amount of computing time already expended is only a small drop in the bucket of how much it will ultimately take to prove them. Finally, the project is grateful to have the help of the BOINC community. It puts the proof of many of these conjectures within our grasp that otherwise would not be. Gary |