Seems to work

0.1.0

• fixed issue with gwstartnextfft false-negatives
• selftest success at least up to n=150000 (for k<300)
• print LLR64 compatible residue
• automatic niceness 19 (not configurable)
• extra logging when errors happen (won't catch all)
• result output says 'maybe' if errors were seen
• speed still on par with LLR64

Usability and selfchecks

automatic comprehensive selftest
usable commandline arguments
check (and warn on) FFT overflow
refactored code to smaller files
readme has examples
lots of other cleanup

0.0.3 allows automatic threadcount

./rpt_release_linux64_0_0_3 39547695 3664175 0
=== RPT - Riesel Prime Tester v0.0.3 [GWNUM: 29.8 GMP: 6.2.0] ===
LLR testing: 39547695*2^3664175-1 [1103035 digits] on 0 threads
step #1 find U0 ...
found V1 [11] using Jacobi Symbols in 1ms
found U0 using Lucas Sequence in 390ms
step #1.5 benchmark threadcount ...
threads 1 took 1319ms for 1000 iterations
threads 2 took 770ms for 1000 iterations
threads 3 took 552ms for 1000 iterations
threads 4 took 489ms for 1000 iterations
threads 5 took 514ms for 1000 iterations
threads 6 took 543ms for 1000 iterations
threads 7 took 513ms for 1000 iterations
threads 8 took 466ms for 1000 iterations
using fastest threadcount 4
FFT size 384KB
step #2 LLR test ...

./rpt_release_linux64_0_0_3 39547695 506636 0
=== RPT - Riesel Prime Tester v0.0.3 [GWNUM: 29.8 GMP: 6.2.0] ===
LLR testing: 39547695*2^506636-1 [152521 digits] on 0 threads
step #1 find U0 ...
found V1 [11] using Jacobi Symbols in 0ms
found U0 using Lucas Sequence in 65ms
step #1.5 benchmark threadcount ...
threads 1 took 159ms for 1000 iterations
threads 2 took 155ms for 1000 iterations
threads 3 took 149ms for 1000 iterations
threads 4 took 164ms for 1000 iterations
threads 5 took 162ms for 1000 iterations
threads 6 took 169ms for 1000 iterations
threads 7 took 174ms for 1000 iterations
threads 8 took 192ms for 1000 iterations
using fastest threadcount 3
FFT size 50KB
step #2 LLR test ...

Version 0.0.2 matches the speed of LLR64

v0.0.2

tweaks