![]() |
![]() |
#1 |
Apr 2020
929 Posts |
![]()
This is one of only two remaining unambiguous GNFS numbers from the 1987 edition of the Cunningham book (base 2 <1200 bits), the other being 2,1109+ c225.
Bob Silverman suggested that the forum run polynomial selection for this number, and Greg has agreed to sieve it with NFS@Home once a suitable poly is found. The composite is Code:
24023387191766184217094927222587025087468868508838209688355658860897738047963529318736265313199625192712082581481439831563094403250831892547179972207284600405234081309183045488404642574713121441527058807512178264038863337 For those who prefer to use CADO, the parameters used to find the aforementioned c220 record polynomial might be a useful starting point: these are P=12M, incr=420, nq=46656, sopteffort=10, ropteffort=100. I am not claiming that these are optimal. The (pre-sizeopt) leading coefficient was in the 35M-40M range; unlike with degree-5, there did not appear to be a significant decrease in average polynomial quality with larger leading coefficients, so there was no need to move to higher values of incr. NFS@Home have a number of SNFS jobs queued up, so don't worry if you've been sieving 3,748+ for the last month and would like a break: there's no rush. It'll probably be about a week before I start any searching myself. |
![]() |
![]() |
![]() |
#2 |
Jun 2012
74128 Posts |
![]()
Sounds fun. Love your recipe for CADO, though I may increase ropteffort and sopteffort a bit.
One question - is tasks.wutimeout = 24000 (default) sufficient? Reserving 1e3 < c6 < 2e6. ETA: adrange = 1680 Last fiddled with by swellman on 2021-11-27 at 00:55 Reason: Add adrange |
![]() |
![]() |
![]() |
#3 | |
Apr 2020
929 Posts |
![]() Quote:
Your adrange is small enough that the length of the stage-1+sizeopt tasks won't be an issue. |
|
![]() |
![]() |
![]() |
#4 |
Jun 2012
385010 Posts |
![]()
FWIW, msieve is looking for an e-score of at least 2.71e-16 to > 3.12e-16. I’m running some msieve-GPU for c6 < 1M. Not expecting much from msieve on a C221 but blind squirrels etc.
CADO is running on one of my old quad core laptops. It is SLOW but fingers crossed a flare pops up. ![]() Thank you for the advice @charybdis! |
![]() |
![]() |
![]() |
#5 | |
"Curtis"
Feb 2005
Riverside, CA
10110000010112 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#6 | |
Apr 2020
16418 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#7 |
Apr 2010
2×53 Posts |
![]()
3.5e-16 is possible:
Code:
# norm 7.406551e-16 alpha -9.691472 e 3.501e-16 rroots 6 skew: 7000972.35 c0: 53635249950771487474963143079350712070525911980 c1: 34662949307835344131518242206719949955943 c2: -72498102600242091149685770153699749 c3: 3018341741417463336008367359 c4: 7813123654476017869721 c5: 45283110042666 c6: -25200 Y0: -1113552721024727138053628986496268142 Y1: 1434019800661087662503 |
![]() |
![]() |
![]() |
#8 |
Jun 2012
2·52·7·11 Posts |
![]() ![]() Very nice! A new record for C221, but can an even higher score be found? 3.7-3.8e-16 perhaps? I’ll keep searching but you’ve set the high water mark! |
![]() |
![]() |
![]() |
#9 |
Apr 2020
92910 Posts |
![]() |
![]() |
![]() |
![]() |
#10 |
"Curtis"
Feb 2005
Riverside, CA
160B16 Posts |
![]()
Would Greg like some test-sieving done?
I can try to quantify the tradeoff between 34LP and 34/35 for this job, for instance. This poly is "good enough", but this is a very big job and saving even 1-2% of sieve time is quite a few workunits from the elves; a 2% savings is roughly a C190 sieve job in time saved! So, we should continue to look for a 3.6. There's some chance of "spin" still, too. Edit: I'm busy with ECM pretesting a couple jobs for 15e queue to meet the upcoming "challenge" demand, I'll work on CADO select on this job in a couple weeks once I get two jobs posted to 15e. Last fiddled with by VBCurtis on 2021-11-29 at 23:45 |
![]() |
![]() |
![]() |
#11 |
Jun 2012
2×52×7×11 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Polynomial selection | Max0526 | NFS@Home | 9 | 2017-05-20 08:57 |
msieve 1.52 with GPU polynomial selection | cgy606 | Msieve | 16 | 2016-10-06 14:16 |
Improved NFS polynomial selection | jasonp | Operation Kibibit | 5 | 2014-09-07 11:02 |
2^877-1 polynomial selection | fivemack | Factoring | 47 | 2009-06-16 00:24 |
Polynomial selection | CRGreathouse | Factoring | 2 | 2009-05-25 07:55 |