![]() |
|
|
#287 |
|
Aug 2020
3·5·19 Posts |
So it seems I should have taken the time to convert everything to msieve...
I had that problem with "no suitable prime" before, I think I used msieve and as you said, it worked. Going from cado *.gz files to msieve rels.dat is actually not that much of a problem using zcat, took some minutes for a 220M rels job. I usually have a script for factoring GNFS numbers that does sieving in cado and LA in msieve as msieve is apparently faster and more robust (as evident) for that step. So I can do the LA in msieve if cado fails, are you generally interested in the relations anyway? It's 22891 *.gz files, I can zip and upload them tomorrow. |
|
|
|
|
|
#288 | |
|
"Max"
Jun 2016
Toronto
11011111012 Posts |
Quote:
Code:
n: 763374743763081217914694138634486780344024237091539368674972788624046972741046710708718787293421106975357383724033172253608940141301420411687874833865804305796864727
Line 5 : {'c4': '1', 'c3': '0', 'c2': '8', 'c1': '-12', 'c0': '7', 'y1': '1419008023915103851777842927951067360939048893550', 'y0': '27465776209625260799657682734475139886128029362001'}
Skew, Murphy E:
3.0883 3.76142443e-12
Line 76 : {'c4': '4', 'c3': '8', 'c2': '14', 'c1': '4', 'c0': '1', 'y1': '28884784233540364651435525662426207247067078255551', 'y0': '1419008023915103851777842927951067360939048893550'}
Skew, Murphy E:
0.31637 3.72885133e-12
|
|
|
|
|
|
|
#289 |
|
Aug 2020
3×5×19 Posts |
It's getting funny. Cado failed at square root as expected. And msieve then decided it's too few relations to build a matrix and requested 1,000,000 more. For good measure I now have cado sieve 2M additional relations and then tomorrow morning I'll attempt to use msieve again.
Is it due to differences in taget density that msieve fails? At least one thing can't go wrong, A4 is a positve integer. I think msieve doesn't like a negative first coefficient. But who knows what'll happen next?! :D Last fiddled with by bur on 2021-06-15 at 17:49 |
|
|
|
|
|
#290 |
|
"Ben"
Feb 2007
3×1,171 Posts |
This post was probably not being monitored any longer... t40 is done with the above results.
|
|
|
|
|
|
#291 |
|
"Ben"
Feb 2007
3×1,171 Posts |
Test sieving the two difficulty 221 polys for the c198 on line 128. yafu spits out the following parameters (poly 2 is very similar):
Code:
n: 442480456268307355970377486465969784979730470279409306982158698829691328120816007497057176155135483213248563103903861494465722951888948657031409779919681670455655411204200835023769409621132838744169 # e = 2.41372557e-13 type: snfs skew: 1.16292 size: 221 c4: 1 c3: 0 c2: 2 c1: -12 c0: 10 Y1: 3105317578628153423506739578983437982692791417722955507 Y0: 1783785732675759131389551214804762300612349559114245473 rlim: 47442301 alim: 32751539 lpbr: 31 lpba: 29 mfbr: 89 mfba: 58 rlambda: 3.6 alambda: 2.6 Test sieving with 14e gives just barely over 1 rel/q over a range of q in the factor base, trailing off to < 0.9 rel/q when out of the factor base. Looks like it should be a 15e job. Code:
poly 1 total yield: 4120, q=24004021 (0.13340 sec/rel) vs. poly 2 total yield: 4209, q=24004021 (0.13017 sec/rel) poly 1 total yield: 4250, q=32004043 (0.13677 sec/rel) vs. poly 2 total yield: 4258, q=32004043 (0.13573 sec/rel) poly 1 total yield: 4222, q=40004011 (0.14301 sec/rel) vs. poly 2 total yield: 4174, q=40004011 (0.14686 sec/rel) poly 1 total yield: 3597, q=80004013 (0.15816 sec/rel) vs. poly 2 total yield: 3584, q=80004013 (0.15315 sec/rel) |
|
|
|
|
|
#292 |
|
Sep 2008
Kansas
64608 Posts |
|
|
|
|
|
|
#293 | |
|
"Ben"
Feb 2007
3·1,171 Posts |
Quote:
total yield: 3958, q=80004013 (0.17637 sec/rel) So the yield goes up 10% or so at larger Q ranges at about the same cost to sec/rel. If using 14e then I think it makes sense to maintain higher yields over the 120MQ range I'd probably need to sieve. If using 15e then I think a smaller rlim will have less of an impact. I should probably test sieve it. Last fiddled with by bsquared on 2021-06-15 at 21:18 |
|
|
|
|
|
|
#294 |
|
Apr 2020
11×31 Posts |
NFS@home has run quartics of similar difficulty as 31-bit jobs, so it might be worth bumping the lpbs up by 1 and increasing mfb/lim correspondingly.
|
|
|
|
|
|
#295 |
|
"Ben"
Feb 2007
3×1,171 Posts |
|
|
|
|
|
|
#296 |
|
Apr 2020
11·31 Posts |
|
|
|
|
|
|
#297 |
|
"Max"
Jun 2016
Toronto
19×47 Posts |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| factoring 2ⁿ-2 equivalent to factoring 2ⁿ-1(I think) | baih | Miscellaneous Math | 9 | 2020-09-21 07:11 |
| OpenCL GPU P-1 Factoring and ECM Factoring | xx005fs | GPU Computing | 3 | 2018-10-27 14:49 |