![]() |
M3321929563 results
[QUOTE=lfm;142489]Trial-factoring M3321929563 in [2^72, 2^73-1]
M3321929563 has 0 factors in [2^72, 2^73-1]. I will continue on with this exponent to 76 bits.[/QUOTE] OK, results.txt is now ... Trial-factoring M3321929563 in [2^72, 2^73-1] M3321929563 has 0 factors in [2^72, 2^73-1]. Trial-factoring M3321929563 in [2^73, 2^76-1] M3321929563 has 0 factors in [2^73, 2^76-1]. and I am returning this machine to gimps, at least for now. good luck guys... |
If, in the very distant future, GIMPS ever got to LL testing exponents in this range, what would be the TF limit?
|
1 Attachment(s)
[QUOTE=jinydu;144023]If, in the very distant future, GIMPS ever got to LL testing exponents in this range, what would be the TF limit?[/QUOTE]Based on the current breakeven points in Prime95, extrapolated forward, probably somewhere around 2^90. But, I suspect that new breakeven points would probably be calculated based on performance of current hardware at that time (like you can see the shift in the graph between the PII-era breakeven points and the Core2 era ones) and TF limits would likely be closer to 2^95 or even 2^100. My own speculation, of course.
|
My old Pentium Pro chugs along.
M3321929197 no factor from 2^72 to 2^73. |
3321932443 no factor from 2^71 to 2^72. I completed the range of Curtis.
Luigi |
3321929927 and 3321929929 both complete to 75. No factors.
|
M3321929789 has 0 factors in [2^71, 2^75-1].
(after 2 years... I decided to run Rde reservation to clear it up) Luigi |
M3321931819 has 0 factors in [2^71, 2^72-1].
I will take this exponent up to 75 bits |
M3321931819 has 0 factors in [2^72, 2^73-1].
continuing up to 75 bits. |
M3321931819 has 0 factors in [2^73, 2^74-1].
continuing to 75 bits |
M3321928381 has 0 factors in [2^73, 2^78-1]
|
| All times are UTC. The time now is 22:32. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.