![]() |
![]() |
#23 |
Mar 2007
Germany
23·3·11 Posts |
![]()
1750 @ 3e6 are done - no factor
|
![]() |
![]() |
![]() |
#24 |
Sep 2008
Kansas
1101111010002 Posts |
![]()
Passing through.
2500 @ 11e6 - done 860 @ 43e6 |
![]() |
![]() |
![]() |
#25 |
Sep 2008
Kansas
DE816 Posts |
![]()
I'm passing through
1800 @ 43e6 |
![]() |
![]() |
![]() |
#26 |
"Ed Hall"
Dec 2009
Adirondack Mtns
106268 Posts |
![]()
Add in 1490 more @11e6
|
![]() |
![]() |
![]() |
#27 |
"Ed Hall"
Dec 2009
Adirondack Mtns
2×2,251 Posts |
![]() Code:
math55@math55:~/Math/ecmWork$ python ecm.py -threads 2 -c 2000 43000000 <ecmTest -> ___________________________________________________________________ -> | Running ecm.py, a Python driver for distributing GMP-ECM work | -> | on a single machine. It is Copyright, 2012, David Cleaver and | -> | is a conversion of factmsieve.py that is Copyright, 2010, Brian | -> | Gladman. Version 0.10 (Python 2.6 or later) 30th Sep 2012. | -> |_________________________________________________________________| -> Number(s) to factor: -> 158562617349742945209675705641056807898933509464973267150675418846057564672877363454894115116065225867039062557863618865761425909629304410855170704171 (150 digits) ->============================================================================= -> Working on number: 158562617349742945...304410855170704171 (150 digits) -> Currently working on: job0685.txt -> Starting 2 instances of GMP-ECM... -> ./ecm -c 1000 43000000 < job0685.txt > job0685_t00.txt -> ./ecm -c 1000 43000000 < job0685.txt > job0685_t01.txt GMP-ECM 6.4.4 [configured with GMP 5.1.2, --enable-asm-redc] [ECM] Using B1=43000000, B2=240490660426, polynomial Dickson(12), 2 threads Done 197/2000; avg s/curve: stg1 148.2s, stg2 43.34s; runtime: 18935s Run 197 out of 2000: Using B1=43000000, B2=240490660426, polynomial Dickson(12), sigma=354488151 Step 1 took 147205ms Step 2 took 43231ms ********** Factor found in step 2: 36471335428481436387054163147551565208686210066640946173017 Found probable prime factor of 59 digits: 36471335428481436387054163147551565208686210066640946173017 Probable prime cofactor 4347595597662628436638238052393245639270024035804982296756254715893080250256191319569347363 has 91 digits math55@math55:~/Math/ecmWork$ |
![]() |
![]() |
![]() |
#28 |
Sep 2008
Kansas
23×5×89 Posts |
![]()
Wow! A p59 at t50!!
As I was closing in on 4000 @ 43e6. |
![]() |
![]() |
![]() |
#29 |
Sep 2008
Kansas
23·5·89 Posts |
![]()
1000 @ 3e6 - nothing
passing through 500 @ 11e6 Edit: and -pm1 2e9 Last fiddled with by RichD on 2013-08-09 at 18:38 |
![]() |
![]() |
![]() |
#30 |
Sep 2008
Kansas
1101111010002 Posts |
![]()
2850 @ 11e6 - nothing
Passing through 50 @ 43e6 BTW, I intentionally don't complete a level incase others are working it and haven't reported their work. Backfilling can always be done at the end before starting GNFS. |
![]() |
![]() |
![]() |
#31 |
Sep 2008
Kansas
356010 Posts |
![]()
1300 @ 43e6 - nothing.
|
![]() |
![]() |
![]() |
#32 |
Sep 2008
Kansas
23·5·89 Posts |
![]()
Getting back into this one after needing all cores for an NFS job.
Passing through 800 @ 43e6 (Total of 2100 so far by me.) |
![]() |
![]() |
![]() |
#33 |
"Curtis"
Feb 2005
Riverside, CA
22×1,319 Posts |
![]()
Does the plan call for a full t50 for this one?
Rephrased: What ratio of ECM-test to digit-length is standard around here? I don't have threads to spare for a few days, so firejuggler might have to poly-select this one too. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Reserved for MF - Sequence 3366 | RichD | Aliquot Sequences | 535 | 2021-12-04 01:13 |
Reserved for MF - Sequence 4788 | schickel | Aliquot Sequences | 3149 | 2021-12-01 00:06 |
Reserved for MF - Sequence 276 | kar_bon | Aliquot Sequences | 136 | 2021-10-21 16:17 |
Team Sieve #37: 3408:i1287 | RichD | Aliquot Sequences | 14 | 2013-08-02 17:02 |
80M to 64 bits ... but not really reserved | petrw1 | Lone Mersenne Hunters | 82 | 2010-01-11 01:57 |