Mockslopdrop.ai — concept mockup only · Not live · Not published · No domainMock
AI breakthroughs, checked — the hype and the hold-up, side by side.

Every big AI claim gets two columns: advancements & doom.

Slopdrop tracks what AI is claimed to have done — and what still hasn't been verified. No victory laps without a status box. No doom without a piece to back it.

3 categories3 draft advancements0 doom pieces yetMockup — Oct 2026 drafts

Browse by category

Doom and advancements sit side by side — by design.

Math

Proofs, prizes, and paper drops at a scale maths has never had to verify before.

01 / MATH

Physics

Fundamental claims, complexity crossovers, and headlines that need slowing down.

02 / PHYSICS
Doom
No doom pieces yet

This column is intentionally empty in the mockup.
No article has been written for it — we won't invent one.

Art

What AI is making, and what it means for the people who make things.

03 / ART
Coming soon
Art hasn't launched in this mockup yet. Both columns — advancements and doom — arrive together when they do.
Advancements
Coming soon

No art advancements pieces yet.

Doom
Coming soon

No art doom pieces yet.

How to read Slopdrop: every advancements article carries a verification-status box at the top. “Claimed” means someone announced it. “Verified” would mean independent experts confirmed it. Most of what's below is still in between — and the box will say so, even when the headline is exciting.

← Back to home Math · Advancements · Draft — Mock

722 papers landed overnight. That is not the same as 722 problems solved.

On October 6, 2026, OpenAI uploaded 722 maths manuscripts at once — the “mathpocalypse.” Headlines rounded it to “~700 problems solved.” The manuscripts themselves tell a slower, more interesting story.

✓ Verification status — Read this first

Status: Manuscripts published, not verified solutions.

  • OpenAI's own catalogue claims ~42% formalized.
  • An independent count puts Lean-formalized results at ~22% — about 162 of 722.
  • 3 manuscripts were withdrawn within ~48 hours and 14 were repaired.
  • No claimed Millennium Prize solution was in the drop itself (per Nature).

Imagine waking up to 722 new maths papers. Not 722 tweets about papers — 722 manuscripts, organised into 372 “result families,” posted to a public repository in a single upload on October 6, 2026.

That's what OpenAI did. And almost immediately, the internet did what the internet does: it rounded “722 manuscripts” up to “700 problems solved.”

Those are not the same sentence. A manuscript is a claim with working shown. A solved problem is a claim other mathematicians have checked, stress-tested, and accepted. Between those two things lies peer review, formal checking, and time — and for most of the 722, that work hasn't happened yet.

722Manuscripts uploaded
~162Lean-formalized (indep. count)
3 + 14Withdrawn + repaired

What “formalized” actually means here

Some of the results come with a Lean formalization — a version of the proof written so a computer can check each logical step. That's genuinely new at this scale, and it's a big part of why this drop matters.

But even the numbers disagree with each other. OpenAI's catalogue says roughly 42% are formalized. An independent count lands closer to 22% — about 162 of the 722. And within two days, three manuscripts were withdrawn (a sign error broke one, and two depended on it) while fourteen more were repaired. That doesn't make the drop fake. It makes it a first draft at industrial scale.

The headline claims inside the batch

Even with the caveats, the list of claimed results is startling. Treat every item below as “claimed in the drop,” not “settled”:

  • Quasi-Riemann hypothesis — no Dirichlet L-function zeros with Re(s) > 7/8, with the Landau–Siegel zero eliminated. Lean-formalized per the repo, with a human-polished write-up. This is not the Millennium Riemann Hypothesis.
  • Rational Hodge conjecture for CM abelian varieties — a special case, with no Lean formalization.
  • BSD leading-term formula — for special Selmer cases only.
  • Plus claimed results on the Unique Games Conjecture, Mahler conjectures, a Kaplansky zero-divisor disproof, L = RL = BPL, a Hadwiger disproof, the 4D Kakeya maximal conjecture, Hilbert's tenth problem over ℚ, and a 9/4 matrix-multiplication exponent bound.

Any one of those, confirmed, would be a career headline. All of them arriving in one upload is exactly why verification — not announcement — is now the bottleneck in maths.

So what is the actual story?

Not “AI solved 700 problems.” It's this: AI can now produce plausible, sometimes machine-checked mathematics faster than humans can verify it. Scale arrived before checking did.

That's still a historic shift. It just isn't 722 settled solutions — and Slopdrop won't call them that until the checking catches up.

The one-sentence version

722 manuscripts is a production record, not a verification record — and the distance between those two records is the whole story.

Sources & grounding

Reporting on OpenAI's Oct 6, 2026 upload of 722 manuscripts (372 result families) to github.com/openai/math, including Nature's coverage (“OpenAI posts 700 maths preprints online”), the repo's own formalization catalogue, and the Oct 7 withdrawal/repair history (3 withdrawn, 14 revised). Full paper trail: research notes on file with Slopdrop (mock).

← Back to home Math · Advancements · The big-money problem · Draft — Mock

The big-money problem: Navier–Stokes and the $1 million claim

One Millennium Prize problem carries a $1 million bounty and a claim from September 8, 2026: that a fluid can blow up in finite time. Claimed is the operative word.

⚠ Verification status — Claimed, not verified

Status: CLAIMED — NOT VERIFIED. OpenAI announced a finite-time blowup on Sept 8, 2026. As of this draft:

  • The Clay Mathematics Institute still lists the problem as active — no submission filed, no prize awarded.
  • Clay's requirements — including ≥2 years and general community acceptance — are unmet. Its process is, in its own framing, “deliberately unhurried.”
  • A published critique says the Lean proof doesn't correspond to the natural-language proof (see below).

The Navier–Stokes existence and smoothness problem asks a deceptively simple question about the equations that describe flowing fluids: if you start with a smooth flow, does it always stay smooth — or can it “blow up,” with velocities racing to infinity in finite time?

It's one of the Clay Millennium Prize problems, which means there's $1 million attached to a correct, accepted solution. That's why this is the big-money article.

What was actually claimed — and what wasn't

On September 8, 2026 — note the date, this was not part of the October 6 paper drop — OpenAI announced that its system had produced a finite-time blowup for 3D Navier–Stokes with a smooth external force.

That qualifier matters. In Clay's official formulation, the forced versions are statements C and D. The unforced question — statements A and B, whether unforced flows always stay smooth — is untouched by this claim. “Navier–Stokes solved” without that qualifier would be wrong even if the forced claim holds up.

The claim arrived with serious-looking apparatus: a 166-page paper plus a Lean formalization — a machine-checkable version of the proof.

Three blockers standing in the way

  • “Lost in translation.” Bastounis, Circelli & Hansen — “Navier-Stokes lost in translation” (arXiv:2610.08144, Oct 6, 2026) — argue that OpenAI's Lean proof doesn't correspond to its natural-language proof. In plain terms: the computer may have checked a proof, but not necessarily the proof in the paper. The authors are careful — they don't say the paper's proof is wrong, or that it's right. They say the two don't match.
  • A credit and priority dispute. Buckmaster and Alpöge published a related result on September 7 — the day before OpenAI's announcement — and who got what from whom is contested.
  • Clay hasn't moved. No formal submission has been filed, the problem remains listed as active, and the clock on Clay's multi-year acceptance process hasn't even started.

How we got here so fast

Sept 1, 2026
OpenAI begins large-scale runs on all Millennium problems, after rumours a rival had solved two.
Sept 4–5, 2026
Anthropic announces a Lean formalization of Fermat's Last Theorem — ~13 million lines. Kevin Buzzard called it an “extraordinary autoformalization achievement” but “mathematically empty”: a translation of an existing proof, not new mathematics.
Sept 7, 2026
Buckmaster–Alpöge publish their related blowup result.
Sept 8, 2026
OpenAI announces the forced Navier–Stokes blowup claim.
Oct 6, 2026
“Lost in translation” critique posted (arXiv:2610.08144) — the same day as the separate 722-paper drop.

That context cuts both ways. The Fermat formalization shows these systems really can do machine-checking at staggering scale. It also shows scale isn't the same as novelty — translation isn't discovery, and a Lean file isn't automatically the proof you think it is. Navier–Stokes is where those two lessons collide.

What would change our status box?

Independent experts confirming the natural-language proof, a Lean proof that demonstrably matches it, and Clay's process actually starting. Until then: claimed, not verified — and the $1 million stays unclaimed.

Sources & grounding

Clay Mathematics Institute problem listing (still active); OpenAI's Sept 8, 2026 announcement (166-page paper + Lean formalization, forced statements C/D); Bastounis–Circelli–Hansen, arXiv:2610.08144 (Oct 6, 2026); Buckmaster–Alpöge related result (Sept 7, 2026); Anthropic Fermat's Last Theorem formalization coverage incl. Kevin Buzzard's assessment (Sept 4–5, 2026). Full paper trail: research notes on file with Slopdrop (mock).

← Back to home Physics · Advancements · Draft — Mock

“OpenAI just broke physics…” — except this one isn't really physics

That headline comes from a Wes Roth video the Slopdrop reader sent in. The video is worth watching — but what it actually covers is a computer-science claim about how hard problems can get, and it hasn't been verified yet.

● Verification status — Uncertain / Awaiting verification

Status: UNCERTAIN — AWAITING VERIFICATION.

  • No independent expert has publicly confirmed the claim, and no specific error has been identified either. It sits genuinely in between.
  • The Lean-formalized bound is weaker than the paper's sharper bound — both are subexponential, so the weaker one would still refute ETH if correct.
  • Lean checks the encoded statement. Whether that encoding faithfully matches the classical ETH is a human check — and it's still pending.

First, the honest framing note, because Slopdrop exists for exactly this: “broke physics” is hype. The Exponential Time Hypothesis — ETH — is a claim in complexity theory, the branch of computer science that studies how hard problems are. It's a fascinating claim with physics-adjacent consequences down the line, but disproving it would not break physics, rewrite the laws of nature, or change how the physical world works. We're filing this under Physics because that's the conversation it arrived in — and saying so, out loud, in the article.

The source for this piece is the video a reader sent us:

▶ Source video

Wes Roth — “OpenAI just broke physics...”
youtube.com/watch?v=lskEzJ7ixw0

What ETH says, in plain English

Take 3-SAT: a puzzle made of yes/no conditions, each involving at most three variables. Can they all be satisfied at once? Brute force means trying every combination — and ETH says, roughly, that there's no shortcut dramatically better than that: no algorithm can solve 3-SAT in subexponential time. For decades, hundreds of other hardness results have been built on top of that assumption.

OpenAI's claim is that its system found the shortcut ETH says shouldn't exist: a deterministic algorithm that exactly counts the satisfying assignments of fixed-width CNF formulas in subexponential time and polynomial space. Counting is harder than just deciding, so if that theorem is right, the 3-SAT case refutes ETH outright.

Oct 16, 2026
The disproof is produced.
Oct 17, 2026
Lean formalization follows.
Oct 25, 2026
Manuscript revised.
Oct 26, 2026
Announced publicly.
Oct 26–27, 2026
Anthropic independently publishes a 2o(n) 3-SAT algorithm — corroboration, not verification.

Why the experts are being careful — in their own words, paraphrased honestly

The designated examiners — Impagliazzo, Paturi, and Williams, who include two of ETH's originators — said in an open letter that their involvement should not be taken as certification. That's not a dismissal; it's what careful checking looks like before it finishes.

Two names in the video's orbit need untangling, too. Scott Aaronson merely reported the claim on his blog — reporting is not endorsement. And Emanuele Viola's “I believe P=NP” post is an older post, not a reaction to this proof. Citing either as confirmation would be wrong, so we won't.

Anthropic arriving at a similar algorithm independently on Oct 26–27 does make the claim harder to wave away. Two labs, similar result. But “two claims” is still not “one verification” — both await the same human statement-to-meaning check.

✕ What this does NOT mean — even if it's true

ETH false does not equal P = NP. Subexponential is still vastly slower than polynomial — the claimed algorithm sits between the two, it doesn't collapse them.

ETH false does not mean encryption is broken. Modern encryption doesn't rest on ETH, and a subexponential SAT counter is not a factoring attack. Anyone telling you your bank account is at risk from this paper is selling something.

So where does that leave us? With one of the most consequential claims in computer science sitting in the most honest box there is: uncertain, awaiting verification. If it holds, textbooks on conditional hardness get rewritten. If it falls, ETH survives another challenge. Either outcome is news. Pretending we already know which one it is would not be.

Sources & grounding

Source video: Wes Roth, “OpenAI just broke physics...” — https://www.youtube.com/watch?v=lskEzJ7ixw0. OpenAI repository history & ETH manuscript (disproof Oct 16, Lean Oct 17, revised Oct 25, announced Oct 26, 2026); Impagliazzo–Paturi–Williams open letter; Aaronson blog post (Oct 26, 2026, reporting only); Anthropic 2o(n) 3-SAT publication (Oct 26–27, 2026). Full fact-check: research notes on file with Slopdrop (mock).