GP/PARI CALCULATOR Version 2.3.5 (released)
             amd64 running linux (x86-64/GMP-5.1.3 kernel) 64-bit version
           compiled: Jun 19 2015, gcc-4.8.3 (Gentoo 4.8.3 p1.1, pie-0.5.9) 
     (readline v6.3 enabled [was v6.2 in Configure], extended help not available)

                        Copyright (C) 2000-2006 The PARI Group

PARI/GP is free software, covered by the GNU General Public License, and comes 
WITHOUT ANY WARRANTY WHATSOEVER.

Type ? for help, \q to quit.
Type ?12 for how to get moral (and possibly technical) support.

parisize = 8000000, primelimit = 500000
   realprecision = 38011 significant digits (38000 digits displayed)

Welcome to the CHG primality prover!
------------------------------------

Input file is:  102936_21961.in
Certificate file is:  102936_21961.out
Found values of n, F and G.
    Number to be tested has 110076 digits.
    Modulus has 31817 digits.
Modulus is 28.904227166050317198% of n.

NOTICE: This program assumes that n has passed
    a BLS PRP-test with n, F, and G as given.  If
    not, then any results will be invalid!

Square test passed for F >> G.  Using modified right endpoint.

Search for factors congruent to 1.
    Running CHG with h = 6, u = 2. Right endpoint has 14627 digits.
        Done!  Time elapsed:  759360ms.
    Running CHG with h = 6, u = 2. Right endpoint has 13858 digits.
        Done!  Time elapsed:  781710ms.
    Running CHG with h = 6, u = 2. Right endpoint has 12704 digits.
        Done!  Time elapsed:  821240ms.
    Running CHG with h = 6, u = 2. Right endpoint has 10974 digits.
        Done!  Time elapsed:  918760ms.
    Running CHG with h = 5, u = 1. Right endpoint has 8999 digits.
        Done!  Time elapsed:  34670ms.
    Running CHG with h = 5, u = 1. Right endpoint has 7391 digits.
        Done!  Time elapsed:  486560ms.
    Running CHG with h = 5, u = 1. Right endpoint has 4177 digits.
        Done!  Time elapsed:  303750ms.
A certificate has been saved to the file:  102936_21961.out

Running David Broadhurst's verifier on the saved certificate...

Testing a PRP called "102936_21961.in".

Pol[1, 1] with [h, u]=[4, 1] has ratio=1.1023637980326456758 E-1554 at X, ratio=6.265057096261096300 E-5731 at Y, witness=19.
Pol[2, 1] with [h, u]=[4, 1] has ratio=2.497234539872269720 E-3215 at X, ratio=3.505358743852506737 E-3215 at Y, witness=2.
Pol[3, 1] with [h, u]=[4, 1] has ratio=1.5379572383820345602 E-1608 at X, ratio=4.329144573047502087 E-1608 at Y, witness=3.
Pol[4, 1] with [h, u]=[6, 2] has ratio=0.4804094507487863077 at X, ratio=2.780774057569179522 E-3951 at Y, witness=3.
Pol[5, 1] with [h, u]=[6, 2] has ratio=2.3725026694980425190 E-1731 at X, ratio=2.694719119456704628 E-3461 at Y, witness=17.
Pol[6, 1] with [h, u]=[6, 2] has ratio=1.7545751712564503972 E-1154 at X, ratio=9.001557466551037667 E-2308 at Y, witness=7.
Pol[7, 1] with [h, u]=[6, 2] has ratio=2.932290412794266239 E-770 at X, ratio=6.852746947886734428 E-1539 at Y, witness=5.

Validated in 2 sec.


Congratulations! n is prime!
Goodbye!