![]() |
|
|
#34 |
|
Jun 2012
22·13·59 Posts |
Reserving the following composites for ECM to t50
C211_148_116 C211_149_41 C211_149_66 C211_148_132 |
|
|
|
|
|
#35 |
|
Jun 2012
22×13×59 Posts |
|
|
|
|
|
|
#36 |
|
Jun 2012
57748 Posts |
prp51 = 118671714253506293806214421648236802627617998799567
B1=43000000 sigma=3697783381 total of 772 curves run so far I will continue ECM up to the full t50 on the remaining C161. |
|
|
|
|
|
#37 |
|
Jun 2012
57748 Posts |
|
|
|
|
|
|
#38 |
|
Jun 2012
22·13·59 Posts |
Ryan just reported another ECM hit. See http://factordb.com/index.php?id=1000000000044726137 for the full factorization. Scary log file follows.
Code:
GMP-ECM 6.4.4 [configured with GMP 6.0.0, --enable-asm-redc] [ECM] Input number is 8660520333296968026466765229346235565748559024030231699271727214399902510243896807959331579004984928668557445761746606949540739300582755090331863570764560881327765427778585403516721734958090278881993236668181942831061757749 (223 digits) Using MODMULN [mulredc:2, sqrredc:2] Using B1=30000000000, B2=2287343438660298, polynomial Dickson(30), sigma=3690357484 dF=1048576, k=176, d=11741730, d2=19, i0=2536 Expected number of curves to find a factor of n digits: 35 40 45 50 55 60 65 70 75 80 6 14 35 100 311 1036 3684 13923 55617 233694 Step 1 took 161382809ms Using 27 small primes for NTT Estimated memory usage: 5209M Initializing tables of differences for F took 5689ms Computing roots of F took 149366ms Building F from its roots took 84675ms Computing 1/F took 32110ms Initializing table of differences for G took 4176ms Computing roots of G took 122402ms Building G from its roots took 101099ms Computing roots of G took 121003ms ... Reducing G * H mod F took 16847ms Computing roots of G took 118064ms Building G from its roots took 88965ms Computing G * H took 15694ms Reducing G * H mod F took 16243ms Computing polyeval(F,G) took 152948ms Computing product of all F(g_i) took 555ms Step 2 took 44233429ms ********** Factor found in step 2: 294951068738514887536552946855239450016709315051696527249 Found probable prime factor of 57 digits: 294951068738514887536552946855239450016709315051696527249 Probable prime cofactor 29362566375288648292115687567600143802366254515637240144576648329159724819719048203289914679709305876033996063505472236444945426410020476830954763880217173634509894501 has 167 digits |
|
|
|
|
|
#39 |
|
Jun 2012
306810 Posts |
I'd like to reserve the following for ECM to t50:
C239_150_41 C165_137_50 C282_140_137 C218_137_42 C175_137_48 Thanks. |
|
|
|
|
|
#40 |
|
Jun 2012
BFC16 Posts |
|
|
|
|
|
|
#41 |
|
Jun 2012
22·13·59 Posts |
ECM hit on the 7600th curve! The absolute last curve. Patience is a virtue after all...
prp51=111090281168868098837722942438483591759347786948097 B1=43000000 sigma=3132212140 eta: B2=240490660426 Last fiddled with by swellman on 2014-07-23 at 12:00 |
|
|
|
|
|
#42 | |
|
Jun 2012
306810 Posts |
Quote:
|
|
|
|
|
|
|
#43 |
|
Jun 2012
22×13×59 Posts |
I would like to reserve the following numbers for ECM to t50:
C186_148_33 C216_150_44 C172_137_52 C202_138_41 C164_138_56 C178_140_114 |
|
|
|
|
|
#44 |
|
Jun 2012
1011111111002 Posts |
Code:
p49=2241981785157541920039471348044414427337869377753 p115=4557980596387462355585858476686199843555788140547677025065122231157104799468776790779585825778858205844000297609717 Found by ECM with B1=43M, sigma=996836351. |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Reservations | ET_ | FermatSearch | 226 | 2021-04-25 19:47 |
| Linear algebra reservations, progress and results | wombatman | NFS@Home | 2768 | 2018-06-02 15:06 |
| NFS results and reservations | XYYXF | XYYXF Project | 348 | 2017-09-08 04:38 |
| Reservations | kar_bon | Riesel Prime Data Collecting (k*2^n-1) | 129 | 2016-09-05 09:23 |
| Where are my reservations | fivemack | PrimeNet | 3 | 2016-02-08 17:58 |