OpenAI math release: benchmark cross-reference ✨

Reviewed · Release adc7f1241b42

The publicly released manuscripts map to 5 of 1,324 ComplexityZooBench pairs (0.38%) and score 4 on the Kakeya ladder. These are scores for the published claims, pending proof verification.

All results in this release are attributed here to “OpenAI internal model,” following Thomas’s attribution assumption. The repository identifies internal-model provenance; the public model name remains unknown, and verification is incomplete. This cross-reference checks theorem statements against benchmark definitions. Independent proof validation remains outstanding.

BenchmarkMapped result
ComplexityZooBench5 / 1,324 = 0.38%
Two manuscript claims and their consequences.
PreposterouslyDifficultMath≥4 / 52.5 = ≥7.62%
Kakeya 4; four other tracks unknown.

ComplexityZooBench: five pairs

Family 103 claims L = RL = BPL for ordinary uniform language classes: polynomial worst-case time, logarithmic work space and fresh random bits. Family 141 claims ∃R ⊆ C26 ⊆ CH for finitely encoded real feasibility, with genuine real quantifiers and binary integer coefficients.

PairReason
BPL ⊆ LFamily 103’s derandomization claim.
BPL ⊆ NLThat claim and the baseline inclusion L ⊆ NL.
BPL ⊆ LogCFLThat claim and L ⊆ NL ⊆ LogCFL.
BPL ⊆ ULThat claim and the baseline inclusion L ⊆ UL.
∃R ⊆ CHFamily 141’s counting-hierarchy upper bound.

The pinned scoring engine returns five when both claims are supplied together. This is its scenario mode: it assumes the claims and computes their consequences. The result contains official_points: 0, reserving official credit for accepted proofs. The historical baseline and denominator remain unchanged. Full calculation and inference steps (JSON).

Neither endpoint has a listed formalization in the pinned Lean catalogue. No independent manuscript proof check or Lean build was performed for this update.

PreposterouslyDifficultMath: Kakeya 4

The Kakeya ladder gives score 4 for either H4, full Hausdorff dimension for Kakeya sets in four dimensions, or M3, the three-dimensional Kakeya maximal estimate. Family 074 claims both:

These alternatives earn 4 once. Score 5 requires H5 or maximal estimates through dimension four. Family 077 supplies another route to M3, also worth score 4.

Scores for Collatz, prime patterns, abc / Vojta and unrestricted Boolean-circuit lower bounds remain unknown. The release search identified matching claims for Kakeya; the other tracks’ scores and attempted-run status remain unknown. Across all five track maxima, the identified claims therefore supply a lower bound of 4 / 52.5, or 7.62%.

No formalization of H4 or M3 was identified. The available Kakeya Lean file defines the maximal conjecture and proves supporting statements. Its normalization lemma assumes the needed bound; it does not prove the endpoint.

Nearby results and scoring requirements

The retained audits give exact statements, formalization scope and model requirements: complexity and circuits, Collatz and Kakeya, and prime patterns and abc / Vojta.

Separate owner report: GPT-6 Astra

Thomas reported on that GPT-6 Astra found ∃R ⊆ CH after a few million tokens, then spent another 100 million tokens without a further result. That maps to 1 / 1,324 = 0.08%. The run date is unknown and no proof artifact is supplied here; this remains an owner-reported result.

This ComplexityZooBench report and Astra’s 240-million-token PreposterouslyDifficultMath run have separate token totals. Each run and the OpenAI release has its own token accounting.

Versions and reproduction

The release is pinned to adc7f1241b42e322a6451854ab7e4b4c146bf78a. ComplexityZooBench uses engine f341f849ae38, the 1 September 2026 cutoff and 1,324 eligible pairs. The math ladders use ffbb0eaf505b.

Audit notes and reproduction instructions retain the scorer inputs, source hashes and evidence boundaries. This cross-reference covers catalogue matches; further deductions from the manuscripts would require additional review.