When I run this command on large numbers (about 10^350),very commonly i get an error of the form:
PrimeQCertificate::qrsqrtmod: Failure of elliptic curves certificate for p = "some number here"
Unable to find quadratic representation v^2 due to failure of SqrtMod[-7, p].
yet when I put in the last prime candidate that the algorithm had into ProvablePrimeQ, it runs to completion without any problems.
1) why is this error occuring?
2) is there a way to fix it so that that PrimeQCetificate can generate a certificate for large primes?