Human-verified formal mathematics

Mathematics is being automated.
We check the math.

Millennium Research builds human-verified evaluations and certified datasets for formal mathematics. When a model translates a theorem into Lean, we measure whether the formal statement says what the mathematics says. The compiler can’t tell you. It turns out frontier LLM judges often can’t either.

SCROLL ↓
In brief

The field measures AI on benchmarks whose statements don’t always say what the math says. We ran the census that proves it, by hand, one flag at a time.

3,299
formal statements audited: three public benchmarks and four open autoformalizers. Full census, no sampling.
156
human-confirmed faithfulness defects — and 139 of 139 counterexample-backed flags upheld on review.
886
frozen human verdicts calibrate our automated judges. Error rates published, not implied.
What we build

The faithfulness eval

Two frontier LLM judges under strict consensus, a numeric counterexample probe, and a detection ladder that shows, pair by pair, what the compiler missed, what single judges missed, and what only a human caught.

Calibrated, not claimed. Judge error rates are measured against 886 frozen human verdicts and published with confidence intervals.

Explore the full eval suite →

  • independent judges per pair2, strict consensus
  • evidence per flagback-translations + counterexamples
  • calibration set886 frozen human verdicts

The certified dataset

Informal–formal statement pairs from open-licensed mathematics, machine-verified in Lean 4 and certified faithful by human reviewers. Automated screens can only reject. Only a human can certify.

Firewalled by construction. The certified product never ships proof text. License-gated at ingest. Audited before every publish, with a tamper-evident history.

  • verification oracleLean 4 + mathlib
  • certificationhuman-only
  • licenses in corpusCC0 / CC-BY
The horizon

The endgame is a prover that moves open problems.

Evaluations and certified data are not the destination. They are the supply chain for machines that do mathematics and can prove it. Faithful formalization is the prerequisite; verified search is the method; a bound on an open problem, machine-checked end to end, is the kind of result we intend to put our name on.