I extended the search to all 2^n where n < 10^15 https://github.com/tdunning/EvenDigits https://github.com/tdunning/EvenDigits This uses much higher order sie

I extended the search to all 2^n where n < 10^15 https://github.com/tdunning/EvenDigits https://github.com/tdunning/EvenDigits This uses much higher order sieves so that it runs about 32000 times faster than the naive algorithm and was able to search to this point on a single core. It is also possible to thread this algorithm relatively easily.