![]() |
|
|
#375 |
|
May 2008
109510 Posts |
From line 2431:
Code:
Using B1=250000, B2=128992510, polynomial Dickson(3), sigma=3423068688 Step 1 took 805ms Step 2 took 482ms ********** Factor found in step 2: 70421951056571174298407161 Found probable prime factor of 26 digits: 70421951056571174298407161 Composite cofactor 101604430095248107007562678598950397409062296407427396953273974341582170484206305218451473255594781352991727576633457 has 117 digits |
|
|
|
|
|
#376 |
|
May 2008
3×5×73 Posts |
Who wants to do the c117?
|
|
|
|
|
|
#377 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2×33×109 Posts |
Should i be surprised that you got to 2*t25 and missed a 26 digit factor?
|
|
|
|
|
|
#378 | |
|
Nov 2008
91216 Posts |
Quote:
jrk, have you fully ECM'd the c117? (Just in case you haven't, I'll run a few curves myself) Edit: seen Serge's post, aborted. Last fiddled with by 10metreh on 2009-08-15 at 07:08 |
|
|
|
|
|
|
#379 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9,497 Posts |
I've run more than enough 3e6 curves. Do go ahead. Anyone?
(I am bound with 552150.) |
|
|
|
|
|
#380 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
About how long would that c117 take on two cores of my Athlon 2.5 GHz? (using factMsieve.pl, since I don't know enough to do it manually) If it's not too long, (either for my or this forum's patience) I'll take it.
For comparison, a c109 with the same setup took about 7.5 hours for the GNFS.
Last fiddled with by Mini-Geek on 2009-08-15 at 13:30 |
|
|
|
|
|
#381 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
426710 Posts |
Ah, why not. I'm starting the GNFS now.
|
|
|
|
|
|
#382 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
status update: poly selection took 2:46:46 (h:mm:ss), first q=100k chunk (started at 1.8M) took about 66 minutes and found 772526 relations, and it wants at least 5737340 before filtering. (this is factMsieve.pl with the MINRELS factor changed from 0.2 to 0.4) If I find this many relations each time, it'll take about 8 hours before the first factoring run. I doubt it'll work with that few relations, though. A c109 I ran the other day took 7168224 before being solvable. I'll guestimate that it'll need 10M relations (anyone got a better approximation?). This puts it at 13 runs, or about 13 hours. Plus an hour or two for finishing. So maybe 15 hours total.
So I should have the factors when I wake up tomorrow morning, (about 6 AM CDT / 11 AM GMT) unless I'm grossly wrong about anything. (I'm safe by about 3 hours, by my estimates) |
|
|
|
|
|
#383 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
Code:
prp48 factor: 101787819775835948918733316910809569438934603559 prp69 factor: 998198314091099356256123369104680179895991846742675659120420684192423 Line 2432 is 2^5*3*p32*p128 and was already known as of when I put in the factors for the c117. Did someone beat me to the c117 and the next line without reporting the c117? Anyway, now we're on Line 2433 and we lost a power of 2! And gained a digit. ![]() Cofactor is c145. Not much ECM has been done yet, (AFAIK, but the one who found that p32 may have worked on this c145 as well) but I'm keeping my status updated in the DB. Currently running 430@25e4. Just in case the DB has any more problems, here is the status:Code:
2431. 41315209076258805980822819038600045201318969211789936794591428435375396599518680455218805759776349083356322831874886489751735221707037749030973936818492662199712 = 2^5 * 3 * 17 * 29 * 12641 * 33107 * 291521 * 70421951056571174298407161 * 101787819775835948918733316910809569438934603559 * 998198314091099356256123369104680179895991846742675659120420684192423 2432. 77489885742951318531011281537865398594576052855381059201245310474765450507848421490566102008207088378549525045932279226875927249701083945747558616485194709781088 = 2^5 * 3 * 28280105441052726736468878788089 * 28542549514354358893458915993662819655625753028398499312865912186369663866315908702072428978933749287812332066919759250319256377 2433. 125921064332295892612893332499038465438663703188435372848854032552047074765016841343996757973207483770437289808632875995776073092711376690665933668709679310599952 = 2^4 * 3 * 263 * 348407 * 6799769 * c145 c145 = 4210371029436746497837158825490947314990186258843761539738301861157299913528382593744449951063933548780440298195483979139600003150433674869074931 Last fiddled with by Mini-Geek on 2009-08-16 at 12:59 |
|
|
|
|
|
#384 |
|
Nov 2008
44228 Posts |
That must be the highest ever escape from 2^5 * 3! (161 digits)
|
|
|
|
|
|
#385 | |
|
Jul 2003
So Cal
11·193 Posts |
Quote:
Of course it got stuck on the C145. Overnight, the C145 survived 4500 curves at B1=3M. It automatically started the GNFS. If you want to do it as a team effort, I'll stop. Otherwise, I'll finish it by tomorrow.
|
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Reserved for MF - Sequence 3366 | RichD | Aliquot Sequences | 470 | 2021-04-22 02:17 |
| Reserved for MF - Sequence 3408 | RichD | Aliquot Sequences | 474 | 2021-03-07 20:28 |
| Reserved for MF - Sequence 276 | kar_bon | Aliquot Sequences | 127 | 2020-12-17 10:05 |
| Assignments are reserved but not showing up | prism019 | GPU to 72 | 6 | 2020-09-21 22:11 |
| 80M to 64 bits ... but not really reserved | petrw1 | Lone Mersenne Hunters | 82 | 2010-01-11 01:57 |