CADO-NFS Data Harvesting

[VBCurtis]

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.

[EdH]

Originally Posted by VBCurtis

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.

Is all of this skewed because of my use of Msieve telling CADO-NFS when to stop sieving?

Edit: Msieve runs filtering to test for a matrix success and then waits a short time and tests again.

[VBCurtis]

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 user-set guesses for number of relations to find.

[EdH]

One more:

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.62682689e-12

[EdH]

And, a c172:

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.16608561e-13