EMsieve Files

These files summarise the results for the search for EM26 
(the 26th prime Eisenstein Mersenne Norm: 3^2237561+3^1118781+1).
==================================================================

All primes between 534827 <= p < 2300000 are either in the file with known factors (prefactored with EMsieve to variable depths: up to 2^55, as shown in "EM_to_3M_factoring_depth.png"), or in the file of candidates (and the file of results).
The candidates were checked using LLR N-1 test (with FBase=2 setting and a modification for the a^b+a^c+1 form) up to ~1000000, and later with the re-implemented Berrizbeitia-Iskra test [1].
Using the FFT mod 3^3p+1 (because EM(p) | 3^3p+1) allowed this test to be approximately two times faster.

N-1 RES64 are not to be compared with Berrizbeitia-Iskra RES64 values.
The latter results are marked with "Iskra RES64", which is the lowest 64-bit of a difference of the power mod and the expected value as follows:
RES64 = |res1 - res2| (mod 2^64), where 
res1 = 2^((EM-1)/3) (mod EM(p)) and
res2 = 3^p-1 (mod EM(p)).
Note that res2 = 3^((p+1)/2)-2 for p = {1, 11} (mod 12)

[1] Pedro Berrizbeitia and Boris Iskra, Math. Comp. 79 (2010), 1779-1791. MSC (2010).