This project tests primality of Mersenne numbers 2^p-1 using the Lucas-Lehmer test, squaring numbers mod 2^p-1 using irrational base discrete weighted transform. That gets slow for large p, so for p over 400 this project tests possible factors (always of the form 2pk+1) under 2^26 to avoid some Lucas-Lehmer tests. The highest prime I have waited for this project to find is 2^1279-1.
