Take a list $L$ of roots of the $\zeta$ function, like the ones provided by Andrew Odlyzko and plug it into the Prime Counting Function $\pi(x)$ given by $$ \pi(x) \approx \operatorname{R}(x^1) - \sum_{\rho\in L}\operatorname{R}(x^{\rho}) \tag{1} $$ with $ \operatorname{R}(z) = \sum_{n=1}^{\infty} \frac{ \mu (n)}{n} \operatorname{li}(z^{1/n})$ . By that we can somehow determine primes up to certain extend and accuracy.
Now, projects like GIMPS and others provide us with a bunch of exceptionally large prime numbers, see the largest here.
$\hskip.5in$ Can these large prime numbers be used to get information on the roots of $\zeta$?
And I can imagine that information might come in many ways. For example:
- accuracy of known roots
- bounds on the imaginary part of yet unknown $\rho$'s
- bounds on the real part
- ...
No.
The different zeros cancel out each others' contributions almost entirely, making it almost impossible to get information on any one root with all the noise. Even if we knew not only the large prime but its index we would not be able to do this, and since we don't have the indices of the Mersenne primes we couldn't even get started.