![]() |
![]() |
#56 |
"Curtis"
Feb 2005
Riverside, CA
2·3·19·41 Posts |
![]()
18k at 11e7 is a t55, so it makes sense to increase B1.
At 2e8, a t55 is just under 10,000 curves, while a t60 is 54,000 curves. If I have the standard ECM-depth effort correct, 57 digits is called for here; that would be something in the range of 2.5 to 3t55 (how does aliqueit determine this precisely?). One t55 is already done, so I would say 15k to 20k curves at 2e8 would be about right, or 12k to 15k curves at 26e7. Excitement, indeed. |
![]() |
![]() |
![]() |
#57 | |
"Ed Hall"
Dec 2009
Adirondack Mtns
1110001010012 Posts |
![]() Quote:
Of the 2000@2e8 that got assigned, due to various reasons, only 1295 succeeded. ![]() I'll have to see if I can get a better return rate on upcoming attempts, if we're to reach 15k anytime "soon." ![]() |
|
![]() |
![]() |
![]() |
#58 |
Sep 2008
Kansas
327610 Posts |
![]()
Finished 4900 or a grand total of 12400 @ 11e7 for me.
Everything switched to 26e7. >440 @ 26e7. |
![]() |
![]() |
![]() |
#59 |
"Ed Hall"
Dec 2009
Adirondack Mtns
53·29 Posts |
![]()
The scripts are rewritten to try to take advantage of maxmem. I've restarted another 2000 for the next run at 2e8.
My total at restart was 1937@2e8 (including the 1295 from my previous post). |
![]() |
![]() |
![]() |
#60 |
"Ed Hall"
Dec 2009
Adirondack Mtns
53·29 Posts |
![]()
Hmmm...
![]() Last fiddled with by EdH on 2013-09-23 at 22:34 |
![]() |
![]() |
![]() |
#61 |
Sep 2008
Kansas
327610 Posts |
![]()
Final total of 935 @ 26e7 (for now).
More news to follow... |
![]() |
![]() |
![]() |
#62 |
"Ed Hall"
Dec 2009
Adirondack Mtns
53·29 Posts |
![]()
add in 1400@2e8 - (total: 3337@2e8)
|
![]() |
![]() |
![]() |
#63 |
"Ed Hall"
Dec 2009
Adirondack Mtns
53×29 Posts |
![]()
Current total: >4500@2e8
|
![]() |
![]() |
![]() |
#64 |
Sep 2008
Kansas
22·32·7·13 Posts |
![]()
2^3 * 3^2 * ... * c141
Thanks to ryanp for providing the factors to the previous term. Code:
reading relations for dependency 3 read 2718047 cycles cycles contain 7872638 unique relations read 7872638 relations multiplying 7872638 relations multiply complete, coefficients have about 473.59 million bits initial square root is modulo 314559659 sqrtTime: 5855 prp83 factor: 56960881403397061621785603475065215970545570822071466142103110861622834387932666377 prp90 factor: 136422320204898039096444081329949382185465109323804778945638910201287987372904996665572699 elapsed time 01:37:36 |
![]() |
![]() |
![]() |
#65 |
Sep 2008
Kansas
CCC16 Posts |
![]()
-pm1 4e9 - nothing
> 600 @ 11e6 > 400 @ 43e6 |
![]() |
![]() |
![]() |
#66 |
"Ed Hall"
Dec 2009
Adirondack Mtns
70518 Posts |
![]()
>1000@11e7...
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Primes in n-fibonacci sequence and n-step fibonacci sequence | sweety439 | And now for something completely different | 17 | 2017-06-13 03:49 |
Team sieve #41: C165 from 3366:i2098 | RichD | Aliquot Sequences | 36 | 2013-11-29 07:03 |
80M to 64 bits ... but not really reserved | petrw1 | Lone Mersenne Hunters | 82 | 2010-01-11 01:57 |
What's the next in the sequence? | roger | Puzzles | 16 | 2006-10-18 19:52 |
Sequence | Citrix | Puzzles | 5 | 2005-09-14 23:33 |