You could use pfgw to test the number for Fermat divisibility. You’ll want to use the -gxo flag (which does the tests without testing to see if the number is prime). An appropriate command line for Windows would be

Congratulations to Ryan Propper.
He really earn this prime: but I cannot even imagine what resources he has.
If we make initial sieve , then assume sieve depth, from last prime we have at least 100000 candidates from 2.8M digits and above :)
And he process 100000 those candidates in 34 days. Some supercomputer must be behind scene.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.A copy of the license is included in the FAQ.