δ framework
The actual mathematics: forced structures, certificates, and proof transformations that enter OSMM as a versioned world.
Source mathematics inside an installed world, not the OS kernel.
PROVED RESULTS: THEOREMOSMM is the operating system that makes mathematics programmatic in physical reality. Forced math, checkable physical grammar, callable theorem tools, installable correspondence worlds: what is proved becomes something that can run.
Load exact declarations, hypotheses, targets, and source revision.
Attach exact inputs, outputs, premises, and callable roles.
Require a receipt whenever an object changes representation.
Bind the claim, state root, contract, judge, and authority.
Derive the registered residual frontier from frozen state.
One residual becomes one bounded, one-writer research contract.
Run fixed proof, axiom, anti-cheat, and anti-vacuity gates.
Atomically append accepted evidence, then recompute Cutset.
OPEN ≠ THEOREM Advice or a judge receipt alone cannot promote proof status.ATTEMPT ≠ WALL Unsuccessful search is not negative evidence.CHAT ≠ TRUTH Models propose. Frozen judges and Ledger admission decide.A proved theorem can sit forever as text. A physical claim can sit forever as metaphor. OSMM exists to close that gap with machinery: forced mathematical structure, a grammar that makes math→physics→meaning translations checkable, theorems typed as callable jobs, and installable correspondence worlds where those jobs can run.
In its final form, OSMM is the operating system that makes mathematics programmatic in physical reality: pure mathematical necessity forced into checkable instruments that compound across domains until open residuals shrink under evidence.
The spine is fixed. δ supplies the actual mathematics. δ forced is the boundary where that mathematics becomes physically applicable only through named correspondence. Under that boundary sit three instruments: Physicality Grammar (deposit-only translations with nouns, verbs, receipts, and squares), Theorem Tools (REWRITE, TRANSPORT, ENGINE, EXCLUSION, RESIDUAL), and Cutset (the residual viewer that banks kills and prints what still remains). Recognition Science Lean is the first rich installed correspondence world, with seeds such as primes-are-particles (an equivalence, not a proof of RH).
What makes this an operating system rather than a library is authority and composition. Worlds pin source truth. Tools are typed syscalls with exact premises. Grammar admits a crossing only when a deposited square clears. The Ledger alone appends status. Lean and lake alone write THEOREM. Empirical receipts are a separate certificate class. Runtime may propose; it may never admit.
Cutset answers one question inside that machine: what remains? Its tagline, “Write down every kill so you never forget it,” is the instrument’s vow, not OSMM’s identity. Lead with forced math made physical. Put Cutset where it belongs: under δ forced, beside Grammar and Theorem Tools.
OSMM is the join of that stack. Cutset, Physicality Grammar, and Theorem Tools are instruments under δ forced. Recognition Science Lean is the first rich correspondence world. None of those alone is the operating system.
The actual mathematics: forced structures, certificates, and proof transformations that enter OSMM as a versioned world.
Source mathematics inside an installed world, not the OS kernel.
PROVED RESULTS: THEOREMForced mathematical structure becomes physically applicable only through named, checked correspondence. Under that boundary sit the three instruments that make research compound.
The forced δ tower is theorem-grade. Calling every forced object physically real is a model boundary; universal physical realization remains open.
UNIVERSAL BRIDGE: OPENBank what died, the rule learned, and what survives. Then compute the registered open set that would finish the goal.
“Write down every kill so you never forget it.”
Open Cutset ↗Nouns, verbs, receipts, and commuting squares. Math → physics → meaning translations that are checkable, grown only by depositing real maps.
“Give math a physical vocabulary so translations are checkable.”
Each proved theorem becomes a typed job: REWRITE, TRANSPORT, ENGINE, EXCLUSION, or RESIDUAL.
“Treat each proved theorem like a tool with a job.”
The first rich world where selected mathematical structures already carry checked physical correspondence, for example the primes-are-particles dictionary (an equivalence, not a proof of RH).
OSMM's first rich installed world. A physical correspondence for all mathematics has not yet been proved.
UNIVERSAL CORRESPONDENCE: OPENThese are the surfaces a visitor can open today. Each answers one question the OS already asks. None of them owns admission, none of them replaces the Ledger, and none of them is OSMM by itself.
Read one frozen campaign snapshot and print the registered open obligations still blocking the goal. RH is the worked example.
What remains?
Explore Cutset ↗Train a model to discover a typed map between two worlds with bounded interventions, then verify the square under OSMM transport binding.
Is the crossing legal?
See the gym ↓Classify proved declarations by job so a campaign can ask for a rewrite, an engine, an exclusion, or a transport instead of searching a subject shelf.
What can this theorem do?
See Tool ABI ↓Physicality Grammar is the dictionary those tools and transports use. Reverse Mathlib is the Ledger that alone admits status changes. Foreman, TakeNext, and Maat sit on the private control plane. The full autonomous closure cycle remains OPEN.
The model chooses interventions that separate look-alike maps between finite dynamical worlds. It proposes once. The learned model never grades itself: the frozen simulator and OSMM C5 transport binding accept or refuse the scoped proposal.
MEASURED SOFTWARE ARTIFACT
Formal and synthetic worlds only. Transfer to empirical world models is an open experiment. Universal physical realization is not claimed.
Representations are content-addressed. The hidden bridge stays evaluator-only.
Choose operation words and partial observables that split remaining bridge classes.
Bind the map, scope, exact premise occurrences, preservation claims, and declared cost.
Exhaustive checks issue a scoped receipt. Rejection stays ATTEMPT and never becomes a WALL.
Implementation says whether code exists. Evidence says what a visitor can verify. “Recorded internally” is deliberately weaker than a public artifact.
A theorem library stores what passed. OSMM also types what a theorem can do, checks translations into physics and meaning, installs correspondence worlds, and admits status only through frozen judges. Models can improve or disappear while the institution keeps dual certificates: Lean theorems and empirical receipts stay separate.
A pinned mathematical universe: declarations, proofs, hypotheses, and open goals.
Callable theorem roles, exact premises, and checked receipts across representations.
Positive routes, scoped failures, visible obligations, and the frontier still open.
A human authorizes one bounded job. Models propose; Lean judges.
Mathlib, δ, Recognition Science, or another versioned world supplies exact declarations, proofs, hypotheses, models, open targets, and a revision identity. The world owns mathematical source truth.
REWRITE changes the form. ENGINE generates a usable invariant. EXCLUSION removes an illegal route. Exact premises stay attached. An open residual is work, not a callable tool.
A result crosses from math to physics or meaning only through a deposited map with exact premises, preservation evidence, and a receipt bound to that application.
Stores open obligations, attempts, admitted negative evidence, and every state root. It alone may admit and append: what died, the rule learned, and the surviving route.
Reads one frozen Ledger snapshot and returns its registered residual frontier with provenance. Cutset never owns memory and never admits status. “Minimum” needs a separate checked receipt.
See Cutset ↗Freezes one contract, isolates one writer, invokes a registered judge, and returns a proposal. Foreman can dispatch. It cannot admit or append canonical truth.
Agents search, derive, write proofs, attack candidates, and report typed blockers. They run outside the truth boundary and may never alter their frozen judge.
Surfaces one decision, binds approval to one exact proposal, and dispatches one bounded job through Foreman. The current private canary remains under completion testing.
Seals what the system observed and links successive states. Its signature proves provenance and continuity, never mathematical truth.
Every checked proof becomes a typed tool. Every deposited grammar square makes a translation checkable. Every admitted result leaves a permanent receipt. Every open obligation stays visible until evidence actually moves it.
At full depth, a human or machine can install a correspondence world, compose theorem tools through Physicality Grammar, run a bounded campaign under frozen judges, and shrink the residual frontier. Cross-domain compounding of that kind remains OPEN until a second independent world reuses the same interfaces without kernel changes.
Read the stack. Then open an instrument if you want a live surface. Cutset answers what remains. Grammar and Theorem Tools answer how a proof may cross into physics. Neither is the whole OS.