20220614, 14:13  #67 
"Curtis"
Feb 2005
Riverside, CA
13000_{8} Posts 
Weird; two digits easier than the C165 from a few posts ago, with the same params, yet needed 10M more raw relations, more unique relations, and took the same amount of time as a poly that scored 20%+ worse.

20220614, 15:27  #68  
"Ed Hall"
Dec 2009
Adirondack Mtns
146F_{16} Posts 
Quote:
Edit: Msieve runs filtering to test for a matrix success and then waits a short time and tests again. Last fiddled with by EdH on 20220614 at 15:29 

20220614, 16:48  #69 
"Curtis"
Feb 2005
Riverside, CA
1600_{16} Posts 
No, I think your way is actually more accurate, since it measures when a matrix can be built of a certain density rather than using userset guesses for number of relations to find.

20220720, 02:15  #70 
"Ed Hall"
Dec 2009
Adirondack Mtns
12157_{8} Posts 
One more:
Code:
N = 164... <160 digits> tasks.I = 14 tasks.lim0 = 50000000 tasks.lim1 = 40000000 tasks.lpb0 = 31 tasks.lpb1 = 31 tasks.qmin = 7000000 tasks.sieve.lambda0 = 1.83 tasks.sieve.mfb0 = 58 tasks.sieve.mfb1 = 89 tasks.sieve.ncurves0 = 20 tasks.sieve.ncurves1 = 10 tasks.sieve.qrange = 5000 Polynomial Selection (size optimized): Total time: 480487 Polynomial Selection (root optimized): Total time: 27393 Lattice Sieving: Total time: 3.16854e+06s (all clients used 4 threads) Lattice Sieving: Total number of relations: 166474932 Found 113244194 unique, 35828316 duplicate, and 0 bad relations. cownoise Best MurphyE for polynomial is 1.62682689e12 
20220723, 22:59  #71 
"Ed Hall"
Dec 2009
Adirondack Mtns
5,231 Posts 
And, a c172:
Code:
N = 237... <172 digits> tasks.I = 14 tasks.lim0 = 65000000 tasks.lim1 = 40000000 tasks.lpb0 = 31 tasks.lpb1 = 31 tasks.qmin = 7000000 tasks.sieve.mfb0 = 58 tasks.sieve.mfb1 = 89 tasks.sieve.ncurves0 = 19 tasks.sieve.ncurves1 = 10 tasks.sieve.qrange = 5000 Polynomial Selection (size optimized): Total time: 985587 Polynomial Selection (root optimized): Total time: 10003 Lattice Sieving: Total time: 1.28816e+07s (all clients used 4 threads) Lattice Sieving: Total number of relations: 240648323 Found 151223351 unique, 81169538 duplicate, and 0 bad relations. cownoise Best MurphyE for polynomial is 3.16608561e13 
20220818, 13:38  #72 
"Ed Hall"
Dec 2009
Adirondack Mtns
5,231 Posts 
Here's a c173:
Code:
N = 107... <173 digits> tasks.A = 28 tasks.lim0 = 65000000 tasks.lim1 = 40000000 tasks.lpb0 = 31 tasks.lpb1 = 31 tasks.qmin = 7000000 tasks.sieve.adjust_strategy = 2 tasks.sieve.mfb0 = 59 tasks.sieve.mfb1 = 89 tasks.sieve.ncurves0 = 19 tasks.sieve.ncurves1 = 10 tasks.sieve.qrange = 5000 Polynomial Selection (size optimized): Total time: 994417 Polynomial Selection (root optimized): Total time: 9945.86 Lattice Sieving: Total time: 1.28671e+07s (all clients used 4 threads) Lattice Sieving: Total number of relations: 233696828 Found 145036125 unique, 73955642 duplicate, and 0 bad relations. cownoise Best MurphyE for polynomial is 2.69267673e13 Last fiddled with by EdH on 20220818 at 13:41 
20220818, 14:03  #73  
Apr 2020
925_{10} Posts 
Quote:
Presumably strategy 2 was removed because of the occasional CADO filtering crashes. But with your script setup that shouldn't be an issue, as long as CADO filtering doesn't run until msieve can build a matrix. Apart from increasing qmin, the other thing to try for small c17x would be raising lpb1 to 32, and correspondingly mfb1 to 92. Last fiddled with by charybdis on 20220818 at 14:07 

20220818, 15:28  #74 
"Ed Hall"
Dec 2009
Adirondack Mtns
5,231 Posts 
Thanks! I've been trying to adjust rels_wanted to make sure it exceeds Msieve matrix build relations needed, so I'll stick with strategy 2. Part of this is so the CADO filtering isn't fighting for resources while Msieve filtering is testing for a matrix. I'll adjust qmin to 15M, and raise lpb1 and mfb1 for my next c17x run, whenever I do another one.
I do run CADO filtering briefly at the end to gather the data for this thread. At that point, if it crashes, it doesn't bother my scripts, but I might miss some of the values in these posts. I can look at that later if it does occur. 
20220822, 13:11  #75 
"Ed Hall"
Dec 2009
Adirondack Mtns
5,231 Posts 
Here's another c160:
Code:
N = 126... <160 digits> tasks.I = 14 tasks.lim0 = 50000000 tasks.lim1 = 40000000 tasks.lpb0 = 31 tasks.lpb1 = 31 tasks.qmin = 7000000 tasks.sieve.lambda0 = 1.83 tasks.sieve.mfb0 = 58 tasks.sieve.mfb1 = 89 tasks.sieve.ncurves0 = 20 tasks.sieve.ncurves1 = 10 tasks.sieve.qrange = 5000 Polynomial Selection (size optimized): Total time: 488894 Polynomial Selection (root optimized): Total time: 25992.8 Lattice Sieving: Total time: 3.49294e+06s (all clients used 4 threads) Lattice Sieving: Total number of relations: 172663455 Found 118538364 unique, 41243958 duplicate, and 0 bad relations. cownoise Best MurphyE for polynomial is 1.50177701e12 BTW, I have been harvesting all my runs for a while now. If you have some specific sizes you'd be interested in, let me know and I'll post them. 
20220822, 13:28  #76 
Apr 2020
39D_{16} Posts 
Comparing with earlier in the thread, it looks to me like 3LP is slower at c160.

20220823, 18:56  #77 
"Ed Hall"
Dec 2009
Adirondack Mtns
5,231 Posts 
Here's a c165:
Code:
N = 322... <165 digits> tasks.I = 14 tasks.lim0 = 60000000 tasks.lim1 = 40000000 tasks.lpb0 = 31 tasks.lpb1 = 31 tasks.qmin = 12000000 tasks.sieve.lambda0 = 1.83 tasks.sieve.mfb0 = 58 tasks.sieve.mfb1 = 89 tasks.sieve.ncurves0 = 18 tasks.sieve.ncurves1 = 10 tasks.sieve.qrange = 5000 Polynomial Selection (size optimized): Total time: 513630 Polynomial Selection (root optimized): Total time: 34447.3 Lattice Sieving: Total time: 5.58991e+06s (all clients used 4 threads) Lattice Sieving: Total number of relations: 174610477 Found 128257371 unique, 38152963 duplicate, and 0 bad relations. cownoise Best MurphyE for polynomial is 7.81486672e13 I had less duplication with 12M, but I can't say how time turned out. It seems to be a bit longer than a c163, as expected. You think I should increase qmin some more and/or take mfb1 down a bit? 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
CADO help  henryzz  CADONFS  6  20220913 23:11 
CADO NFS  Shaopu Lin  CADONFS  522  20210504 18:28 
CADONFS Timing Data For Many Factorizations  EdH  EdH  8  20190520 15:07 
CADONFS  skan  Information & Answers  1  20131022 07:00 
CADO  R.D. Silverman  Factoring  4  20081106 12:35 