Hacker News Reader

I recall a successful 'highest prime' search using a system that checked numbers of the form 2^n - 1 (or something like that)

Those are called Mersenne Primes, and are in the form 2^p - 1, where p is a prime number.