![]() |
|
|
#265 |
|
Jun 2012
1011111111002 Posts |
|
|
|
|
|
|
#266 |
|
Jun 2012
22×13×59 Posts |
http://factordb.com/index.php?id=1000000000044746152
Sorry I didn't reserve it - he was too quick! Code:
GMP-ECM 6.4.4 [configured with GMP 6.0.0, --enable-asm-redc] [ECM] Input number is 34577319614301949072226953733076740960028533352717779631632823963537012692759168035110629333557256976716309275984192092520826858616921456630178475830426918177713734504997772576829301136420735961745516889747 (206 digits) Using MODMULN [mulredc:0, sqrredc:2] Using B1=850000000, B2=15892628251516, polynomial Dickson(30), sigma=2560958095 dF=524288, k=5, d=5705700, d2=17, i0=132 Expected number of curves to find a factor of n digits: 35 40 45 50 55 60 65 70 75 80 15 47 168 661 2867 13623 69471 381778 2221086 1.4e+07 Step 1 took 4501488ms Using 25 small primes for NTT Estimated memory usage: 2365M Initializing tables of differences for F took 4726ms Computing roots of F took 70808ms Building F from its roots took 39526ms Computing 1/F took 15008ms Initializing table of differences for G took 501ms Computing roots of G took 60290ms Building G from its roots took 43940ms Computing roots of G took 59098ms Building G from its roots took 44625ms Computing G * H took 7966ms Reducing G * H mod F took 8431ms Computing roots of G took 60668ms Building G from its roots took 44693ms Computing G * H took 8179ms Reducing G * H mod F took 8181ms Computing roots of G took 59786ms Building G from its roots took 43479ms Computing G * H took 8006ms Reducing G * H mod F took 8297ms Computing roots of G took 60568ms Building G from its roots took 44684ms Computing G * H took 8281ms Reducing G * H mod F took 8469ms Computing polyeval(F,G) took 76523ms Computing product of all F(g_i) took 303ms Step 2 took 797585ms ********** Factor found in step 2: 508030470176711645980438714506206430031991945361861580531 Found probable prime factor of 57 digits: 508030470176711645980438714506206430031991945361861580531 |
|
|
|
|
|
#267 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
72×131 Posts |
I just noticed that I forgot to look at the log files properly for C200_139_113
It is now fully factored: Code:
-rw-rw-r-- 1 driver driver 50602 Aug 30 14:30 /home/nfsworld/XYYXF/139.113.e/X08/xaf.s2 Resuming ECM residue saved by pumpkin@pumpkin with GMP-ECM 7.0.4-dev on Tue Aug 23 03:37:12 2016 Input number is 43083799152135331267335113025253722564325494880350443825084369839588656763691829705291873665259394367002381807367554752803746000845172841142500162985075503053421570820224466034106747921674543904908321 (200 digits) Using B1=300000000-300000000, B2=3299108824840, polynomial Dickson(30), sigma=3:1095877588 Step 1 took 1ms Step 2 took 710164ms ********** Factor found in step 2: 291290712147810660576816305207371715184951008952889589 Found prime factor of 54 digits: 291290712147810660576816305207371715184951008952889589 Prime cofactor 147906532393223608896484321599614967734218866291734315801956453590386102142676753091461574009839754044383182944268595956539274874847533751639784189 has 147 digits |
|
|
|
|
|
#268 |
|
Jun 2012
22×13×59 Posts |
Reserving C286_149_93 for ECM but using a strategy suggested by the Baysian analysis tool. Wombatman will run a series of increasing B1 (Stage 1). I'll run Stage 2. Curve count follows.
2300 @B1=110e6 5300 @B1=850e6 ~800 @B1=2.9e9 Really hoping we get a hit. NFS will not be pretty! Last fiddled with by swellman on 2016-10-04 at 00:13 Reason: correction to B1 |
|
|
|
|
|
#269 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
144238 Posts |
C190_147_80 succumbed to ECM: http://mersenneforum.org/showpost.ph...&postcount=153
|
|
|
|
|
|
#270 |
|
Jun 2012
57748 Posts |
Reserving the C134 stub remaining when yoyo found a p55 factor for C188_121_115. Thanks.
|
|
|
|
|
|
#271 |
|
Jun 2012
1011111111002 Posts |
Reserving C296_149_100 for ECM to t55.
|
|
|
|
|
|
#272 |
|
Jun 2012
22×13×59 Posts |
Reserving C297_146_121 with wombatman for full ECM using Bayesian approach.
|
|
|
|
|
|
#273 |
|
Jun 2012
22·13·59 Posts |
|
|
|
|
|
|
#274 |
|
Jun 2012
22×13×59 Posts |
Running some ECM on C202_140_102 towards a partial t55, in preparation for NFS@Home.
|
|
|
|
|
|
#275 |
|
Jun 2012
22·13·59 Posts |
C286_149_93 was run through the following
2800 curves @ B1=11e7 - Completed 5400 curves @ B1=85e7 - Completed Ready for NFS per the Bayesian tool. Not sure if this NFS job is within any individual's resources or it would require a 16e effort by NFS@Home/Ryan/etc. Anyway, ECM is complete. |
|
|
|
![]() |
| 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 |