realprecision = 10018 significant digits (10000 digits displayed)

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

Input file is:  13117_9151.in
Certificate file is:  13117_9151.out
Found values of n, F and G.
    Number to be tested has 37679 digits.
    Modulus has 11166 digits.
Modulus is 29.634095778965868862% 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 4182 digits.
        Done!  Time elapsed:  43520ms.
    Running CHG with h = 5, u = 1. Right endpoint has 3342 digits.
        Done!  Time elapsed:  20330ms.
    Running CHG with h = 5, u = 1. Right endpoint has 2961 digits.
        Done!  Time elapsed:  25840ms.
    Running CHG with h = 5, u = 1. Right endpoint has 2105 digits.
        Done!  Time elapsed:  32240ms.
    Running CHG with h = 5, u = 1. Right endpoint has 488 digits.
        Done!  Time elapsed:  27370ms.
A certificate has been saved to the file:  13117_9151.out

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

Testing a PRP called "13117_9151.in".

Pol[1, 1] with [h, u]=[5, 1] has ratio=5.358859357070458499 E-2656 at X, ratio=3.866583952329853871 E-3143 at Y, witness=13.
Pol[2, 1] with [h, u]=[4, 1] has ratio=2.2471341023966250040 E-1618 at X, ratio=4.370762972034567292 E-1618 at Y, witness=11.
Pol[3, 1] with [h, u]=[5, 1] has ratio=0.07904323746801880062 at X, ratio=1.4455000008714257753 E-856 at Y, witness=11.
Pol[4, 1] with [h, u]=[4, 1] has ratio=2.2059668080930449452 E-381 at X, ratio=2.2249896383119031638 E-381 at Y, witness=11.
Pol[5, 1] with [h, u]=[6, 2] has ratio=1.0875863470447360695 E-841 at X, ratio=7.042634925429985100 E-1682 at Y, witness=2.

Validated in 1 sec.


Congratulations! n is prime!
Goodbye!