Primality testing 10^50000+10^25000+69363 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Generic modular reduction using generic reduction FMA3 FFT length 16K, Pass1=256, Pass2=64, clm=2 on A 166097-bit number
Running N-1 test using base 5
Generic modular reduction using generic reduction FMA3 FFT length 16K, Pass1=256, Pass2=64, clm=2 on A 166097-bit number
Running N+1 test using discriminant 13, base 1+sqrt(13)
Generic modular reduction using generic reduction FMA3 FFT length 16K, Pass1=256, Pass2=64, clm=2 on A 166097-bit number
Calling N+1 BLS with factored part 0.01% and helper 0.01% (0.04% proof)
10^50000+10^25000+69363 is Fermat and Lucas PRP! (273.6854s+0.0410s)

To be completed...