OSTOE — open-source theory of everything, claims registry
Established The m = 1500 displacement campaign — d(1500) certified to [42, 45], both ends solver-free (unsat tree below, witnessed cover above)
id: m1500-bracket-42-45 · filed: 2026-10-27 · depends: prime-tread-wheel · falsifier: a reproducible cover engaging ≤ 41 rings, or an independently verified proof that no 45-ring cover exists — either collapses the bracket
Mechanism
Same object as m1500-sparse-milp-bracket and m1500-phaseb-48-certified —
the rotation-priced covering of layer 1500: 1,124,250 consecutive ticks,
177 candidate rings (the primes p ≤ ⌊√T(1499)⌋ = 1060). d(1500) is the
minimum number of rings that can be engaged while every tick stays covered.
What is certified (2026-10-27, both ends solver-free)
- [E] d(1500) ≤ 45 — a witnessed cover engaging 45 of the 177 rings,
verified by pure-integer recomputation (uncovered = 0 over all
1,124,250 ticks). This demotes the 48 incumbent of
m1500-phaseb-48-certified from incumbent to history.
- [E] d(1500) ≥ 42 — a pure-integer branch-and-bound certificate that
no cover engages 41 or fewer rings: 13,740 leaves / 14,770 nodes,
independent verifier PASS in ~180 s (
verify/cbb_verify.py). No LP
solver stood in the loop at either end.
- [E] Predecessor brackets retained per registry rules: [26, 49]
(
m1500-sparse-milp-bracket), then [38, 48]
(m1500-phaseb-48-certified) — each true when certified, each
superseded, not erased.
Downstream
- [G] The exact integer in {42, 43, 44, 45} remains open; every notch
from either side, once certified, is permanent.
- The full public package — whitepaper, Lean 4 formalization of the
covering theory, solver-free certificates, verifiers — lives at
github.com/Cosmolalia/prime-tread-wheel and is archived at
DOI 10.5281/zenodo.24266492 (published 2026-11-16).