![]() |
|
|
#1618 | |
|
"Brian"
Jul 2007
The Netherlands
326910 Posts |
Quote:
Are you sure you're not just estimating the time until all exponents under 79.3M have been tested? |
|
|
|
|
|
|
#1619 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
3·17·193 Posts |
It 2014 it dropped by 0.205 . Use that figure instead. I can give you a lot more data to play with if you want.
|
|
|
|
|
|
#1620 |
|
"Nathan"
Jul 2008
Maryland, USA
5×223 Posts |
That would give 365/0.205 = ~1,780 days, or just under 5 years. Back when Davieddy was stalking the forum, he was consistently getting right around 4 years. So either GIMPS is slowing down (possible but the throughput numbers seem to say differently), or (more likely) we are seeing the effects of (1) the DC tail being cut down to size and (2) the greater computational expense of LL tests in the highest part of the "classical" range.
|
|
|
|
|
|
#1621 |
|
"Brian"
Jul 2007
The Netherlands
7·467 Posts |
|
|
|
|
|
|
#1622 | |
|
"Nathan"
Jul 2008
Maryland, USA
5·223 Posts |
Quote:
Assuming a Poisson distribution, we can then calculate the probability of finding a prime in a given interval of exponents (e.g. between 2 and 79,300,000, the classical GIMPS upper limit; or between 50,000,000 and 60,000,000, etc.). From this, we can calculate the number of primes that we might expect to find in such an interval. Right now, for instance, between exponents 2 and 79,300,000, we presently expect to find 0.496 primes, per this report. (Keep in mind that this is making that all-important, nontrivial, unproven assumption that the distribution of Mersenne primes is a Poisson process!) Well, from the change in this expected number of primes over a time interval, we can estimate the time interval in which we would expect to find exactly one prime. This is a calculation that Davieddy would frequently make and from which he would infer the increase (or decrease) in GIMPS throughput (whether this is a valid metric for measuring GIMPS throughput is another argument for another time). Anyway, the logic is as follows: If the expected number of primes in an interval decreases by some amount To calculate this, we simply invert Finally, an example, just to make things as clear as mud. As Uncwilly posted upthread, the expected number of primes dropped by 0.205 in 2014. This gives Hope this helps. Let me know if you still have questions.
Last fiddled with by NBtarheel_33 on 2015-02-02 at 22:01 |
|
|
|
|
|
|
#1623 |
|
"Brian"
Jul 2007
The Netherlands
7·467 Posts |
Thanks very much for the very detailed description. What I didn't understand, but I think I do now thanks to your explanation, is how it was justified to use the decrease in the expected number of primes in a particular arbitrary interval (up to exponent 79.3M in the example). But now I see that you use a gradient (rate of decrease) of expected number of primes over that same interval and assume that it will apply over any larger interval (Poisson distribution).
Thanks for your patience with me. Last fiddled with by Brian-E on 2015-02-03 at 01:48 |
|
|
|
|
|
#1624 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
13×479 Posts |
And as expected the last of the <10M digit exponents was indeed finished by someone other than the registered
|
|
|
|
|
|
#1625 | |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
2×67×73 Posts |
Quote:
Code:
20141115 33185861 D LL, 54.90% 143 26 2014-06-25 2014-11-14 2014-11-15 2014-12-11 nranks 20141123 33185861 D LL, 54.70% 151 27 2014-06-25 2014-11-23 2014-11-24 2014-12-20 nranks 20141210 33185861 D LL, 53.50% 168 28 2014-06-25 2014-12-09 2014-12-10 2015-01-07 nranks 20150101 33185861 D LL, 58.20% 221 18 2014-06-25 2015-01-30 2015-01-31 2015-02-19 nranks |
|
|
|
|
|
|
#1626 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
13×479 Posts |
I doubt that "Mike Neurohr" could get the assignment and then finish the test in 0.0 days. The Recent Cleared report was very clear about the timespan of 0.0 days.
|
|
|
|
|
|
#1627 |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
2×67×73 Posts |
As I said, I don't have enough information to say for sure. But I can tell you that many of my machines can clear two DCs in less than 24 hours.
|
|
|
|
|
|
#1628 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
13×479 Posts |
I'm not sure about the rounding used but I suppose at the most it could be 0.099999... days, i.e. just under 2.4 hours. Is such a time possible with current technology?
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Newer X64 build needed | Googulator | Msieve | 73 | 2020-08-30 07:47 |
| Performance of cuda-ecm on newer hardware? | fivemack | GMP-ECM | 14 | 2015-02-12 20:10 |
| Cause this don't belong in the milestone thread | bcp19 | Data | 30 | 2012-09-08 15:09 |
| Newer msieves are slow on Core i7 | mklasson | Msieve | 9 | 2009-02-18 12:58 |
| Use of large memory pages possible with newer linux kernels | Dresdenboy | Software | 3 | 2003-12-08 14:47 |