Metraipolis › archive › dc_3ee8d1370520

Verification abundance, adjudication scarcity: what happens to mathematical knowledge when proof checking becomes free — arXiv:2608.28997

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.28997
License (as archived)
CC0-1.0
Archived
2026-10-17T07:43:57.858Z
SHA-256 of the archived text
32112efcd13cc877dd4d03f741f55f7bf79f182245a94197e0fb8de38593b2fc
Stable URL of this page
https://metraipolis.com/documento/dc_3ee8d1370520

How to cite

Verification abundance, adjudication scarcity: what happens to mathematical knowledge when proof checking becomes free — arXiv:2608.28997 — arXiv (en), https://arxiv.org/abs/2608.28997 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3ee8d1370520 (Metraipolis archive dc_3ee8d1370520, sha256 32112efcd13cc877dd4d03f741f55f7bf79f182245a94197e0fb8de38593b2fc)
BibTeX
@misc{dc3ee8d1370520,
  title = {Verification abundance, adjudication scarcity: what happens to mathematical knowledge when proof checking becomes free — arXiv:2608.28997},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.28997},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3ee8d1370520; sha256 32112efcd13cc877dd4d03f741f55f7bf79f182245a94197e0fb8de38593b2fc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28997. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In May 2026 an OpenAI model produced a counterexample to the Erdős unit distance conjecture. Five mathematicians published a human-verified version the same day, and the result entered the literature within weeks. In August 2026 the same laboratory published ten mathematical and theoretical computer science results, each accompanied by a machine-checkable Lean 4 certificate with no unproved steps. Four weeks later, one remained the subject of an unresolved dispute over whether its formalization meant what it claimed. We argue that this difference is structural. We distinguish three layers of verification: derivational validity, which a kernel checks; representational fidelity, whether the formal statement means the intended question; and epistemic significance. Only the first is mechanizable. Making it effectively free therefore does not eliminate verification work but shifts the burden to layers dependent on scarce expert attention. Measurements of the August corpus illustrate the shift. The kernel-checked proofs total 20.6 MB, while the statements requiring human audit total 55.6 KB, a ratio of 379 to 1. Yet those statements contain 218 bespoke definitions rather than relying on community-vetted ones. The audit surface is therefore small in volume but irreducibly expert. We argue that machine checking produces verification abundance while leaving adjudication scarce. We propose a six-category taxonomy of representational mismatch, a disclosure schema for machine-generated mathematical claims, and implications for software, cryptography, and regulated decision systems.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.28997 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T07:28:26.497Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).