Just throwing an idea out there.

I fell down the rabbit hole of the limits of computing:
https://en.wikipedia.org/wiki/Limits_of_computation

Where the following is stated:
"In The Singularity is Near, Ray Kurzweil cites the calculations of Seth Lloyd that a universal-scale computer is capable of 10^90 operations per second. The mass of the universe can be estimated at 3 × 10^52 kilograms. If all matter in the universe was turned into a black hole, it would have a lifetime of 2.8 × 10^139 seconds before evaporating due to Hawking radiation. During that lifetime such a universal-scale black hole computer would perform 2.8 × 10^229 operations"

Suppose there is a theoretical optimal primality test which, even for special cases which might be confirmable is less time than most, together with the theoretical number of computational operations, would suggest an absolute limit to the size of any prime which could be confirmed within the physical constraints of our universe.

Could this, or a similar approach with a lower theoretical limit, be an end-all of sorts for this endless pursuit of a larger prime numbers?

I'd be interested in hearing other ideas for lowering the theoretical limit, or if someone has already done this, a link to the paper/discussion