The title buries the lede quite a bit:

> The Exponential Time Hypothesis is false

I understand that the Exponential Time Hypothesis being false doesn't necessarily mean P=NP, but for people who are a lot more knowledgeable about complexity theory, does this update your priors significantly in the direction of P=NP?

In the Star Trek Voyager capstone episodes titled "Scorpion" parts 1 & 2, Chakotay explains to Janeway the behavior of the Borg through the parable of the fox and the scorpion making a transactional deal to cross the river together. After reaching the shore, the scorpion stings the fox, and the dying fox asks why. The scorpion replies, "Because it is in my nature."

(Upside of the story is Captain Janeway's trusted crew works together to formulate a trick up their sleeve precisely in case of predicted contingency...)

Title is no doubt crafted to get ahead of the usual online backlash, but here’s the actual announcement:

> We are announcing three new discoveries in mathematics, computer science, and physics about harmonic analysis, complexity theory, and quantum field theory.

1. Local smoothing and the Kakeya conjecture

2. The Exponential Time Hypothesis is false

3. Existence of quantum chromodynamics and completions of the Standard Model

Working with academic communities lol.

I looked over the announcement for any substantial contribution, and found they're donating $5 million to a research foundation.

$5 million might sustain 5-10 PhD students for 5 years.

Maybe it's just me but I think they should contribute more in exchange for forcing the scientific community into paying for tokens to generate slop and then pouring their time into verifying or falsifying the slop.

I just did it guys, def solve_riemann_hypothesis() -> bool: pass in Python and issuing a press release that Python solved the Riemann Hypothesis.

The proof appears to be a sub-exponential algorithm for #3-SAT not just 3-SAT, I think this is considered a much stronger result?