![]() |
|
|
#188 |
|
Apr 2010
Over the rainbow
50568 Posts |
Code:
R0: -697013904459768580991097397641011 R1: 5606793472754501 A0: -1847971520796502134306506190386798968500 A1: 40821386607537415162180472039027730 A2: 65031139921790296595480109002 A3: 11389536971489005146365 A4: -2922818243778546 A5: 105066936 skew 4418742.30, size 5.992e-017, alpha -7.710, combined = 2.022e-013 rroots = 5 |
|
|
|
|
|
#189 |
|
I moo ablest echo power!
May 2013
13·137 Posts |
Hahahaha, nice!
|
|
|
|
|
|
#190 |
|
Jul 2003
So Cal
212210 Posts |
|
|
|
|
|
|
#191 | |
|
"Curtis"
Feb 2005
Riverside, CA
10011000010012 Posts |
Quote:
Are the CADO root-opt tools better for deg 6? Perhaps someone could collect the best few hundred hits for a CADO root-opt run? |
|
|
|
|
|
|
#192 |
|
Apr 2010
Over the rainbow
2·1,303 Posts |
after running for the night, I got
Code:
R0: -696455968474482254849269323572607 R1: 348684257076673921 A0: 214663815990857477983089978209004516580928 A1: 177424600277632306484616564575041074 A2: -34342254092265056219064954433 A3: -8565004414637263688679 A4: 546856311911345 A5: 105488460 skew 6382404.47, size 6.264e-017, alpha -7.953, combined = 2.130e-013 rroots = 3 |
|
|
|
|
|
#193 | |
|
Tribal Bullet
Oct 2004
3×1,181 Posts |
Quote:
My anecdotal experience is that the best output from the CADO root-opt tools is noticeably better than what you get with Msieve, but on average they work equivalently well. Even among same-degree polynomials, the definition of E-value would make one think that a polynomial with X percent better E-value would sieve X percent more efficiently, but experience with RSA768 shows the difference is much smaller than that. i.e. we found lots of degree-6 polynomials with half the E-value score of the one actually used for RSA768, that sieved maybe 15-20% slower. |
|
|
|
|
|
|
#194 | |
|
Jun 2005
lehigh.edu
20008 Posts |
Quote:
Code:
Input number is 47684588221623639056961705608173079138153779302378955848869404 42648307317037627130989942393222503668627639186419734789253370 97393792502082005378750936019951281361678639264962841236093010 58482691872665246622667910987254487 (221 digits) Using B1=400000000, B2=15892277350966, polynomial Dickson(30), sigma=4180268258 Step 1 took 3510272ms Step 2 took 1859204ms ********** Factor found in step 2: 482632031053134403896770035981249734273506307638396123269389497006923 Found probable prime factor of 69 digits: 482632031053134403896770035981249734273506307638396123269389497006923 Probable prime cofactor 98801126227724201982197175315480431013249163755336329531650444 70656245838965370494907444192757868193236504714266221744759846 9879406843807465214724901669 has 152 digits of a new 7t55. Ah, there was another 1.8t55 of left-overs from last weekend's count. Looks like my total curve count is c. 23.3t55*, out of 25t55 for t65. Wow! a new highest count for me; not so much luck, as sustained effort. Please apply this to the account with the two p62's "not found" for not having run enough on the NFS@Home 3+ gnfs's! -Bruce *PS - OK, that's 127,215 curves with B1=400M, default B2, to be precise. This p69 is just short of my previous, the current 10th-of-the-top10, 482... -vs- 563... |
|
|
|
|
|
|
#195 |
|
Jul 2003
So Cal
2×1,061 Posts |
|
|
|
|
|
|
#196 |
|
I moo ablest echo power!
May 2013
13·137 Posts |
If I might ask a slightly stupid question, does "t55" refer to running the number of curves suggested by GMP-ECM to find a factor of a given digit length? If so, does "7t55" refer to doing this 7 times? Thanks!
|
|
|
|
|
|
#197 |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
3·5·719 Posts |
|
|
|
|
|
|
#198 | |
|
Sep 2010
Scandinavia
11478 Posts |
Quote:
Code:
R0: -11708475821133910619711215298497638 R1: 4937254133390405269 A0: -802914511260679636038420993144191107255975 A1: 374850392085650921707293481711138160 A2: 191485557559647650556457788274 A3: -14221948389865248927299 A4: -1608862500793698 A5: 20456280 skew 11155110.94, size 1.875e-017, alpha -7.644, combined = 1.030e-013 rroots = 5 |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| GIMPS wiki account request thread | ixfd64 | mersennewiki | 169 | 2018-09-21 05:43 |
| Polynomial Discriminant is n^k for an n-1 degree polynomial | carpetpool | Miscellaneous Math | 14 | 2017-02-18 19:46 |
| Lost Prime Raider password request thread | cheesehead | Forum Feedback | 6 | 2009-07-28 13:02 |
| Polynomial | R.D. Silverman | NFSNET Discussion | 13 | 2005-09-16 20:07 |
| Deutscher Thread (german thread) | TauCeti | NFSNET Discussion | 0 | 2003-12-11 22:12 |