![]() |
![]() |
#34 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3×7×479 Posts |
![]()
After I've sent you my chunk, overnight, these two were found, among others:
Code:
28152 2433318054942868451855 59348574860231999861973541552374022242 28548 2081574749379320822615 59210567327921655077067385512778121094 Code:
# norm 3.700525e-17 alpha -12.717535 e 3.865e-17 rroots 6 skew: 2215723154.54 c0: -970448320646021694578949129049604330614610062721667730848000 c1: -607988932569976140706327616966599745391523757192640 c2: 5204413519179595844548686880742975397398856 c3: -957395753955967142796892206448982 c4: -2284007410820213764514977 c5: -26254608635612 c6: 28152 Y0: -59348575238455548493933386598544474147 Y1: 2433318054942868451855 Last fiddled with by Batalov on 2011-04-26 at 18:06 Reason: (forgot that with c6, we need "grep -A10"! lost Y1) |
![]() |
![]() |
![]() |
#35 |
"Nancy"
Aug 2002
Alexandria
1001101000112 Posts |
![]()
Running on 5 cpus at the moment; I'll add more as other jobs finish. By when would you like people to submit their results?
|
![]() |
![]() |
![]() |
#36 |
Jun 2003
Ottawa, Canada
3×17×23 Posts |
![]()
I will fire this up on 8 cores, and some GPUs as well. Running in the 90M range for some and probably try 500M for some others just for variety.
Jeff. |
![]() |
![]() |
![]() |
#37 |
Tribal Bullet
Oct 2004
32·5·79 Posts |
![]()
Thanks for the extra firepower; give it a month at most.
I should hasten to add that I can be emailed results directly, but try to keep them under 2MB or so. Otherwise you can use sendspace or rapidshare if there's no other private upload space available. |
![]() |
![]() |
![]() |
#38 |
Jun 2003
Ottawa, Canada
3×17×23 Posts |
![]()
One of my clients is giving a crap line after every poly for one value. The latest selection:
Code:
poly 500170440 564278859499206943266134866747651758733433332176819829531102537646614 crap poly 500170440 678622847917999215471734866747651758691398744483671458326649864185588 crap poly 500170440 987491663354360211383934866747651758698994091051914427681031386455062 crap poly 500170440 633811608938069509018934866747651758617066475863472582786648055154877 crap poly 500170440 675221726908452533905334866747651758726298637432616667350438814822345 crap poly 500170440 990676115270466648342734866747651758620947140824681217655780335645732 crap The last good line in the .dat.m file is: 500164740 9248931170384508488537 11618305638489772424973270084719459548 Should I just let it keep going and hope it de-crapifies itself or should I kill it and restart after that bad value? Jeff. Last fiddled with by Jeff Gilchrist on 2011-04-27 at 23:56 |
![]() |
![]() |
![]() |
#39 |
Jun 2003
Ottawa, Canada
3×17×23 Posts |
![]()
The client de-crapified itself, now working on 500174136 without any crap warnings.
Jeff. |
![]() |
![]() |
![]() |
#40 |
May 2008
3·5·73 Posts |
![]()
Thanks. I'll look at it.
|
![]() |
![]() |
![]() |
#41 |
May 2008
3×5×73 Posts |
![]() |
![]() |
![]() |
![]() |
#42 | |
Jun 2003
Ottawa, Canada
3×17×23 Posts |
![]() Quote:
I guess there is a big difference in speed depending on the range you are searching and what is found? |
|
![]() |
![]() |
![]() |
#43 |
Jun 2003
Ottawa, Canada
3×17×23 Posts |
![]()
It is amazing the hashtable size from different 50k runs, 6552 for one, 55104 for another, 41546 for another, and 16367 for another. All taking about the same amount of time to run.
I'm now running svn 564 and will let you know if I see any more crap. Jeff. |
![]() |
![]() |
![]() |
#44 |
Tribal Bullet
Oct 2004
DE316 Posts |
![]()
Well, the number of leading coefficients (A6's) searched goes down as the size of those A6's goes up (this optimization is to favor A6 values with lots of small factors, to boost the projective root scores of the resulting polynomials). So there is a time difference based on where in the range you start.
The size of the hashtable depends on the number of 'other' entries computed at the beginning of each A6, and on where in the special-q range the current special-q lies. Last fiddled with by jasonp on 2011-04-28 at 12:16 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Polynomial selection | Max0526 | NFS@Home | 9 | 2017-05-20 08:57 |
Improved NFS polynomial selection | jasonp | Operation Kibibit | 5 | 2014-09-07 11:02 |
Call for volunteers: RSA896 | jasonp | Operation Kibibit | 134 | 2013-09-03 22:08 |
2^877-1 polynomial selection | fivemack | Factoring | 47 | 2009-06-16 00:24 |
Polynomial selection | CRGreathouse | Factoring | 2 | 2009-05-25 07:55 |