As expected, my double-check came back matching!

[QUOTE]2^9092392+40291 is a probable prime! We4: 16576B3B,00000000[/QUOTE]

[QUOTE=enderak;251993]As expected, my double-check came back matching![/QUOTE]

:george:

A very nice find. Congratulations to all those involved. It is by far the largest PRP found to date. If it were proven prime it would rank [URL="http://primes.utm.edu/primes/lists/all.txt"]13th largest prime[/URL], but as it can not be (in a reasonable amount of time) it tops [URL="http://www.primenumbers.net/prptop/prptop.php"]Henri Lifchitz's PRP database[/URL] along with Five or Bust's other two Mega PRPs.

[QUOTE=enderak;251993]As expected, my double-check came back matching![/QUOTE]
[pedantic]Re: the thread title. Capt.Obvious reports that We1 (Wd4, etc) values (i.e. "We1: 16576B3B") are workunit hashes; these values will match (they are a hash of the [I]input[/I], not the [I]output[/I]) -- regardless of the test result (which in this case of course [B]did[/B] match, too; it was a 0 in all bits). [/pedantic]
Anyway, :lock::wacky::wblipp:

Congrats! Just out of curiosity, will this forum be placed in the "Archived projects" section when all doublechecks are complete?

:george:
Congratulations on (probably :wink:) proving the conjecture this project set out to prove! Next step is to wait for incredibly fast computers, or maybe quantum computer factoring for N-1/N+1, or maybe a new primality proving algorithm that makes ECPP look slow, and you can actually prove that these PRPs are all prime and that the conjecture is proven. :sleep: Well, you can always keep edging up the lower end of proving the PRPs up slowly in the mean time.

Fantastic work! I come back from holidays to find that the project has (almost certainly) been wrapped up!
My workunits have finished (no PRPs, no ninja'ing), and have just been emailed off to Phil. I had some ROUNDOFF errors, which I'll ask Phil's advice on, but once they've been cleared, I think it's only unconnected, engracio and Phil with tests below the magic number.

I have started strong probable prime tests, but I realize now that it will take me 5 weeks to finish all 20 tests on my Pentium D. Justin, how on earth did you finish your double-check so fast? I know I am running on old technology, but I did not realize that I was so out-of-date!

I am running a test on pfgw using a SCRIPT file. If anyone wants to volunteer to run some of these tests and speed up the verification, more power to you! The problem is basically to compute base^(2^9092391+20145) mod 2^9092392+40291 and see if the result is equal to 1 or -1 mod 2^9092392+40291. I am running these tests using pfgw and a SCRIPT file. The other tests have been run with all prime bases from 2 to 73, I have queued bases 2, 3, 5, and 7, but if anyone wants to run another base, post here and I can reserve it for you. I will also post my SCRIPT file tomorrow in case you want to use this method, but you may also be able to use pfgw by running an Euler test. I am not sure of what the current pfgw capabilities are.

[QUOTE=philmoore;252018]I have started strong probable prime tests, but I realize now that it will take me 5 weeks to finish all 20 tests on my Pentium D. Justin, how on earth did you finish your double-check so fast? I know I am running on old technology, but I did not realize that I was so out-of-date!

I am running a test on pfgw using a SCRIPT file. If anyone wants to volunteer to run some of these tests and speed up the verification, more power to you! The problem is basically to compute base^(2^9092393+20145) mod 2^9092394+40291 and see if the result is equal to 1 or -1 mod 2^9092394+40291. I am running these tests using pfgw and a SCRIPT file. The other tests have been run with all prime bases from 2 to 73, I have queued bases 2, 3, 5, and 7, but if anyone wants to run another base, post here and I can reserve it for you. I will also post my SCRIPT file tomorrow in case you want to use this method, but you may also be able to use pfgw by running an Euler test. I am not sure of what the current pfgw capabilities are.[/QUOTE]
What about just using:

pfgw -tc -q2^9092392+40291

That will perform a combined N-1/N+1 primality test, which of course will not totally succeed since neither N-1 or N+1 can be trivially factored, but the test still produces strong Fermat and Lucas PRP verification.

@Jeff I hear you about being lucky.:smile:

@enderak and paleseptember my rerun on a different computer for the prime won't be done until Fri morning. Several hours of power outage (only my block) did not help All other wu below the prime should be done by then too.

I am sure as others that the prime will be verified, just when.:unsure: Still happy we have found it sooner than later.:grin:

Phil, my double-check was done on an Intel i7 965 running on all 4 cores at once. If you can give me direction I would be happy to help with the pfgw tests. (Running 64-bit Windows OS)

Should I run it per mdettweiler's suggestion or can you e-mail your script file with directions to use? If the various tests can be split up, I have a few i7's available that could greatly reduce the test time. (Who ever said that patience is a virtue?)

Here's one factor of PRP-1: 2425284208751 (edit: aside from the trivial 2 and 7)

Nothing to write home about but it's a start.