SEXTANT: a kernel-checked referee for quantum and physical claims (FORCED / FREE / IMPOSSIBLE)

SEXTANT is a kernel-checked referee that classifies claims about quantum and physical systems into three exhaustive verdicts — FORCED (a theorem), FREE (a label) or IMPOSSIBLE (a no-go) — and never predicts values: the executable form of the constraint-first theory of everything. It holds a catalog of 28 claims (CHSH <= 2*sqrt2, Clifford circuits classically simulable, matchgates = Pfaffians, no-cloning, the MERA area law D^m, Mermin contextuality, SM anomaly cancellation, the D3-tadpole uniqueness theorem, and more), each with a Lean 4 + Mathlib theorem name and a falsifier; a falsifier loop runs every claim's falsifier against a live oracle (a simulated quantum computer: numpy/Stim/Quimb); and a hypothesis registry holds 11 open questions (6 answered this arc), each decomposed into forced vs open with candidate answers. A self-contained node (web/node.html + src/pacland/sextant_node.py) lets anyone download, browse claims, run falsifiers and contribute. python scripts/validate_sextant.py reports 'catalog OK: 28 claims', CHSH control exact at 2*sqrt2.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-08
DOI
https://doi.org/10.5281/zenodo.24062190
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

SEXTANT: a kernel-checked referee for quantum and physical claims (FORCED / FREE / IMPOSSIBLE)

Rob Mitchell
2 links
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

SEXTANT: a kernel-checked referee for quantum and physical claims (FORCED / FREE / IMPOSSIBLE)

Rob Mitchell
preprint en

Abstract

SEXTANT is a kernel-checked referee that classifies claims about quantum and physical systems into three exhaustive verdicts — FORCED (a theorem), FREE (a label) or IMPOSSIBLE (a no-go) — and never predicts values: the executable form of the constraint-first theory of everything. It holds a catalog of 28 claims (CHSH <= 2*sqrt2, Clifford circuits classically simulable, matchgates = Pfaffians, no-cloning, the MERA area law D^m, Mermin contextuality, SM anomaly cancellation, the D3-tadpole uniqueness theorem, and more), each with a Lean 4 + Mathlib theorem name and a falsifier; a falsifier loop runs every claim's falsifier against a live oracle (a simulated quantum computer: numpy/Stim/Quimb); and a hypothesis registry holds 11 open questions (6 answered this arc), each decomposed into forced vs open with candidate answers. A self-contained node (web/node.html + src/pacland/sextant_node.py) lets anyone download, browse claims, run falsifiers and contribute. python scripts/validate_sextant.py reports 'catalog OK: 28 claims', CHSH control exact at 2*sqrt2.

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
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