It's 2025, if you want to publish grand claims, and you're initially the only one who understands your own proof, publish a machine readable proof in say MetaMath's .mm format.
You say that like it’s even remotely feasible at the frontier of mathematics and not a monumental group effort to turn even established proofs into such.
Most groundbreaking proofs these days aren’t just cross-discipline but usually involve one or several totally novel techniques.
All that to say: I think you’re dramatically underestimating the difficulty involved in this, EVEN if the author(s) were a(n) expert(s) in machine readable mathematics, which is highly UNlikely given that they are necessarily (a) deep expert(s) in at LEAST one other field.
My knowledge here is very limited, so this isn't a "why has no one tried this one weird trick"-type question. I assume there is in fact a good reason that I don't yet understand :P
In the first, you can’t really do anything but just keep watching it not halt but it isn’t telling you anything about the infinity to go. (Say a program that spits out twin primes, we expect an infinite number but we don’t really know)
And in the second case we’d just have to keep trying larger and larger inputs making this just an extension of the first category if we wrote a program to do that for us. And if we did find an example where it goes on forever without repeating states, how would you even know? It’d be like the first situation again.