Comment by throwaway150

That's not comparable to finding Goldbach NON-counterexamples.

With Goldbach, claiming a "world record" just means checking one more number and seeing if it is still NOT a counterexample. It's easy. Contrast that with computing a new digit of pi - something you can't achieve by simply incrementing a value and running a check.

Finding each new digit of pi (the ones very far out) is not a trivial task. The computational effort increases by a lot as you go deeper. Something like O(n (log n)^k) for some k (usually k = 3).