CADO-NFS Data Harvesting

[EdH]

C167:

N = 352... <167 digits>
tasks.I = 14
tasks.lim0 = 60000000
tasks.lim1 = 80000000
tasks.lpb0 = 31
tasks.lpb1 = 31
tasks.qmin = 7000000
tasks.sieve.lambda0 = 1.89
tasks.sieve.mfb0 = 59
tasks.sieve.mfb1 = 61
tasks.sieve.ncurves0 = 21
tasks.sieve.ncurves1 = 25
tasks.sieve.qrange = 5000
Polynomial Selection (size optimized): Total time: 513998
Polynomial Selection (root optimized): Total time: 31835.6
Lattice Sieving: Total time: 8.10951e+06s (all clients used 4 threads)
Lattice Sieving: Total number of relations: 229517725
Found 131275178 unique, 73397071 duplicate, and 0 bad relations.
cownoise Best MurphyE for polynomial is 5.36680137e-13

[EdH]

It's still a couple hours from LA completion, but here are the details for the current c173 from 18528:

N = 301... <173 digits>
tasks.I = 15
tasks.lim0 = 80000000
tasks.lim1 = 130000000
tasks.lpb0 = 31
tasks.lpb1 = 32
tasks.qmin = 500000
tasks.sieve.lambda0 = 1.87
tasks.sieve.lambda1 = 1.865
tasks.sieve.mfb0 = 58
tasks.sieve.mfb1 = 60
tasks.sieve.ncurves0 = 20
tasks.sieve.ncurves1 = 25
tasks.sieve.qrange = 2500
Polynomial Selection (size optimized): Total time: 1.55379e+06
Polynomial Selection (root optimized): Total time: 41095.6
Lattice Sieving: Total time: 1.69564e+07s (all clients used 4 threads)
Lattice Sieving: Total number of relations: 276649798
Found 122644730 unique, 53361072 duplicate, and 0 bad relations.
cownoise Best MurphyE for polynomial is 2.68623478e-13

[VBCurtis]

Thanks, Ed!
I have a C172 I'm about to run; I'll compare some of the data to see what I can improve on C175-sized jobs.
I think 3 large primes is faster starting around C160; sieve is faster but matrix is tougher. At C160 the changes cancel out, so by 165 the sieve speed should outweigh the matrix difficulty.

I'll post a new suggested params here for 170 and 175 after I run my next job, 2-3 weeks.