Quote:
Originally Posted by ewmayer
I then separately computed 3^(2^(2^m  1)) mod p and q via (2^m1) = 1073741823 iterated squarings modulo p and q, separately, and the results match, which anyone can confirm on even quite modest hardware.

Trivial note: it is faster to reduce the exponent mod (p1) [use Fermat's little theorem].