Listed on Makoto Kamada s site: http://hpcgi2.nifty.com/m_kamada/f/phin10.cgi?p=904#P90312

Primality testing Phi(90312,10)/90313 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 5
Generic modular reduction using generic reduction Pentium4 type-0 FFT length 10K, Pass1=40, Pass2=256 on A 96719-bit number
Running N-1 test using base 7
Generic modular reduction using generic reduction Pentium4 type-0 FFT length 10K, Pass1=40, Pass2=256 on A 96719-bit number
Running N+1 test using discriminant 13, base 12+sqrt(13)
Generic modular reduction using generic reduction Pentium4 type-0 FFT length 10K, Pass1=40, Pass2=256 on A 96719-bit number
Calling N+1 BLS with factored part 0.05% and helper 0.02% (0.17% proof)
Phi(90312,10)/90313 is Fermat and Lucas PRP! (512.3687s+0.3063s)

To be completed...