Compare Elliot Glazer a month-ish ago:
> I occasionally talk to experts on all the MP's. Their rough summaries on what is needed to solve them usually go:
> Hodge: not a clue
> BSD: not a clue
> RH: not a clue
> P vs NP: not a clue
> Yang-Mills: "Well..."
https://news.ycombinator.com/item?id=50252673
So if we're in "not a clue" territory, maybe that's that.
I fear that it gets muddled again with e.g. the concurrent human announcement and that in retrospect RH turns out to be easier than expected, like many other problems before.
Math is hard, but how hard math is is also hard...
Langlands is interesting because it is most conjectural (and not completely clear what the precise statements are -- hence "program" and not "conjecture"), but proving special cases turn out to be tremendously powerful. One special case implied Fermat's Last Theorem, for example.
That being said, its probably going something akin to how experimental and theoretical physics have an interplay with each other.
Can we develop more and more all encompassing abstractions (theories) that explain and verify experimental results; translates to, can we come up with more and more theorems/abstractions that explain formal proofs (and perhaps provide explanations for other known proofs)? Probably yes, and likely will also be accelerated by AI.
How this fits into the discipline of mathematics is something we are currently finding out.
Yes.