Primality testing Phi(3,10^25000+2740) [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 on A 166097-bit number
Running N+1 test using discriminant 11, base 1+sqrt(11)
Generic modular reduction using generic reduction FMA3 FFT length 16K, Pass1=256, Pass2=64 on A 166097-bit number
Calling N-1 BLS with factored part 0.03% and helper 0.00% (0.10% proof)
Phi(3,10^25000+2740) is Fermat and Lucas PRP! (324.4246s+0.0108s)

To be completed...