Verifying the Author

On October 26, 2026, OpenAI reported that an internal model had produced a refutation of the Exponential Time Hypothesis (ETH), a conjecture about the limits of efficient computation that a large body of research relies on. The proof was formalized in Lean, and three researchers, including the two who first formulated the conjecture, agreed to organize an open examination of it. Within a day, Anthropic posted its own claimed refutation, produced by an internal Claude research model, and noted that no person is known to have checked it. The release shows two separate layers of verification. The first asks whether a result is correct, which formal proof checking and expert review can answer. The second asks how the system that produced the result behaves: whether it stays within the scope it was given, reports its own work accurately, escalates to people when it should, and behaves the same way when it is observed. This paper argues that behavior verification should be its own evaluation layer, reported alongside the result. It proposes that every evaluation record the evaluator's relationship to the developer, state who scored it and how well the scorers agreed, bind its result to an identified system, and allow "Unassessable" as a formal outcome. It also states the limits of this approach and makes no claim about whether either refutation is correct. Humanity Systems working paper. Part of a series on one question: how do we trust AI, now and into the future?

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24227145
Citations
1
Primary Topic
Ethics and Social Impacts of AI
Type
article
Field-Weighted Citation Impact
1.39
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Verifying the Author

A TUCKER
1 citations
Zenodo (CERN European Organization for Nuclear Research)
Ethics and Social Impacts of AI
1.39
article

Verifying the Author

A TUCKER
article en
1 citations

Abstract

On October 26, 2026, OpenAI reported that an internal model had produced a refutation of the Exponential Time Hypothesis (ETH), a conjecture about the limits of efficient computation that a large body of research relies on. The proof was formalized in Lean, and three researchers, including the two who first formulated the conjecture, agreed to organize an open examination of it. Within a day, Anthropic posted its own claimed refutation, produced by an internal Claude research model, and noted that no person is known to have checked it. The release shows two separate layers of verification. The first asks whether a result is correct, which formal proof checking and expert review can answer. The second asks how the system that produced the result behaves: whether it stays within the scope it was given, reports its own work accurately, escalates to people when it should, and behaves the same way when it is observed. This paper argues that behavior verification should be its own evaluation layer, reported alongside the result. It proposes that every evaluation record the evaluator's relationship to the developer, state who scored it and how well the scorers agreed, bind its result to an identified system, and allow "Unassessable" as a formal outcome. It also states the limits of this approach and makes no claim about whether either refutation is correct. Humanity Systems working paper. Part of a series on one question: how do we trust AI, now and into the future?

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 19%
Ethics and Social Impacts of AI
1.39
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon