The Institute for Applied Ontological Mathematics

Math Proof Program Physics


Artificial intelligence is now writing the systems that run markets, science, infrastructure and judgment — and it is writing them faster than anyone can check them. Not slightly faster. Faster than any review process that has ever existed. What comes out is unverifiable, because nobody can re-check what it claims to have done; uninterpretable, because not even the people who built it can honestly explain its internal structure; and uncontrollable, because optimization walks away from intent and there is no lever left that still means anything.


Our ethos is computation using platonic forms. Our engineering ideal is formal math running on bare metal. Every layer machine-checked. Every claim verifiable.


our ethos, and the engineering ideal it sets

Hoping that larger AI models become self-explanatory is not enough. A plan is needed. We seek to formalize the entire stack: idea theory mathematical description formal proof program runtime hardware physical reality. Most people still do not know that a proof written appropriately is equivalent to a program, and programs already move real things: circuits, protocols, control systems, chemistry, deployed models, cars, and robotics. Formalize that span and verifiability, interpretability and controllability stop being brand promises and become engineered properties an auditor can confirm from the artifacts alone. Design the stack the proper way and humans can check, understand and control the whole system. That is the one thing the Institute is dedicated to, above all else.

one instrument, as an example

What a formal verdict actually is

To say a sentence is established is to exhibit a term of its type. To say it is false is to exhibit a term of the negation — which, constructively, means producing a witness. To say it needs a hypothesis is to exhibit a function whose domain is that hypothesis, made explicit. To say it cannot be assessed is to report that no interpretation is determined at all.

These are not four confidence levels. They are four positions in a type system, and the difference between them is exactly the difference between P, ¬P, H → P, and the absence of any interpretation whatsoever.

Because the evidence a record must carry is a function of its verdict, the ledger is a dependent sum rather than a labelled tuple — and a record that carries the wrong kind of evidence for its verdict does not typecheck.

Fig. I the division of a sentence

total · unique

THE GENUSa sentencein a source textsproved⊢ ⟦s⟧a term inhabiting the statementrefuted⊢ ¬⟦s⟧a term inhabiting its negationconditional⊢ H → ⟦s⟧a function from a named hypothesisnonformalizable⟦s⟧ undefinedno term, because no predicate
Note. The brace is the period’s device for a division, and it is the honest one here: it asserts that these four are one exhaustive, disjoint division of a single thing, which is what the coverage theorem proves. The first three verdicts are proof-theoretic and the fourth is not — a nonformalizable sentence is not one that no proof reaches, but one that never became a proposition, so its entry is ruled broken. Swatches are hatched after Petra Sancta (1638): azure horizontal, gules vertical, or dotted, purpure diagonal, so the four stay distinct without color.

the chain, carried out

Proof-carrying quantum

Quantum hardware is metered, queued and noisy, so when a run comes back wrong you cannot tell whether your mathematics was wrong or the hardware was. Separating those two is the whole problem, and it is the one place the Institute has taken the chain all the way down: exact algebraic amplitudes, a machine-checked proof, a certificate anyone can re-check, and runnable code that cannot drift from the proof it came from.

    Ino physics required

    See what a circuit does

    Six questions about quantum computing answered in pictures and nothing else. Start here if the phrase “exact amplitude” meant nothing to you.

    Start with a question

    IInine questions

    See what is actually proved

    Nine questions a result has to survive, the layer that answers each, its honest trust state, and a live lab for every one. It states where each answer stops.

    See what it proves

    IIIcontent-addressed

    Read the certified corpus

    The circuits already carrying certificates, each with its claim, its evidence, and the address that names it. Re-checkable without asking us for anything.

    Open the corpus

    IVruns in your browser

    Build one yourself

    Place a gate and watch thirteen views recompute in your browser on the verified core. The interface simulates nothing; when a view is out of range it says so.

    Open the designer


what the world is allowed to believe

Every claim names its rung

Reward hacking and hallucination are serious threats. The technology we are entrusting our lives to has to work reliably. It cannot be treated as magical, or as sentient before that is proven. For it to be trusted with our planet, our futures and our children, we have to understand and control it.

Praise is not evidence. Local green gates, flashy demonstrations and endless papers are evidence — and nothing more than evidence. None of them is a license to call a result finished, in science, in math, or anywhere else. So the Institute publishes against a ladder of ten named rungs, ordered weakest to strongest, and every claim must name the rung it stands on and meet it. Overclaiming becomes a checkable error rather than an opinion, a social media post, or even an academic paper.

Fig. II the trust ladder

ten rungs · climbing is earned

every claim names the rung it stands on — and may not stand higherlead01Informal insightsketch, conjecture, narrativetin02Formal statementa precise claim in a kernel languageiron03Kernel-checked proofaccepted by a named verifier, axiom footprint explicitsteel04Hostile survivalsubstitution, mutation and counterexample suites fail closedcopper05Translation preservationmeaning survives transport between kernels without collapsebrass06Runtime performancethe declared computation actually runs on the admitted routesilver07Readback & provenanceartifact identity and trust tier agree with the source claimelectrum08Clean-room reproductionthe verdict follows from durable artifacts alone, elsewheregold09Production minimareliability, failure injection, recovery, offline checker floorsdiamond10Fixed-point closureno unresolved dependency, no scope contraction, no stale authority
Note. A rung cannot be reached except through the one below it, which is why this is a ladder and not a scale. The metals are borrowed, not believed: the old ordering by nobility is the most legible sequence anyone has devised for each step costs more than the last, and it is used here for that and nothing else. It does carry the alchemists’ own lesson, though — they had the ordering right and the mechanism catastrophically wrong. Lead does not become gold because someone wants it to, and a demonstration does not become a proof because it was announced as one. Diamond takes the head of the ladder because the last rung is not a better alloy; it is a different kind of thing. Broad phrases — “production-ready”, “fully realized” — require the whole contracted envelope, not a collage of local successes.

the mandate

Three properties, and what each one buys

Formalization is not an academic preference. It is the only durable way through the crisis of artificial intelligence at industrial scale, and each pillar pays for itself in a currency you can name.

Iis derivable

Verifiable — which buys trust

An auditor takes the artifacts alone and reproduces the verdict in a clean environment, without trusting us. Without it you get simulation theater, reputation, and hope.

IIhas a stated meaning

Interpretable — which buys knowledge

The structure is stated, not inferred from behavior, so a failure is readable and a success is explicable. Without it you get opaque success and unusable failure.

IIIresponds to a handle

Controllable — which buys value

There is a steering surface that still means something under optimization. Without it you get optimization without a lever anyone can hold.


theorem to world

How a theorem reaches the world

Mathematical truth that travels without trust theater: kernel-checked meaning, through translation and runtime, to hardware — and re-checkable at the far end by someone who does not trust us.

    step 1

    Formal meaning

    A claim is stated in a kernel language and proved there, with its axiom footprint in the open. The kernel checks the term; nothing is taken on description.

    step 2

    Program

    A proof written appropriately is provably equivalent to a program. That is the Curry–Howard bridge, and it is why this is an engineering path and not an analogy.

    step 3

    Substrate

    The program is lowered to a runnable, receipt-bearing computation, and the receipt says which route actually ran rather than which route was intended.

    step 4

    Physical consequence

    Software already produces physical results — circuits, protocols, control, chemistry, cars, robots, autonomous learning systems. The chain ends in the world, re-checkable by someone who does not trust us.


operating virtues

The four refusals

These govern how the work is done, and they exist to protect the mandate rather than to decorate it. Each is enforced by a formally designed control-system gate that AI cannot interfere with.

    I

    Truth above convenience

    The kernel, the type checker, or the contracted gate is the arbiter. Not the deadline, not the deck, not the organization or Institution, and not the person who wants the answer.

    II

    Scope integrity

    Results should be reported from the kernel with a cryptographic seal whenever possible. If a mistake is made it should be instantly identifiable, so that the system can quickly and continually improve.

    III

    Audit ruthlessly, try to break it

    Then repair it. Build it better. Make it antifragile. Proactively find problems before you have to reactively bug-hunt. Document everything: full disclosure, so the lessons do not need to be repeated.

    IV

    Demand applied value

    Your work and your time deserve better than a green check mark or an emotionally charged reply. Renaming a theorem, softening a status label, or adding an honest-sounding note changes nothing in the world. Ask what the system can now do that it could not do before.

Improve your life, improve the world. Refuse false closure. Demand authenticity, demand value — not theater.


the colophon

The Institute

Our Technology is Ontological. Our Engineering is Constructive.

Standing
A Michigan nonprofit corporation, recognized by the IRS as tax-exempt under Section 501(c)(3) and classified as a private operating foundation. Nothing on this page is tax advice; a donor's own adviser should confirm how a particular gift is treated.
What we publish
Formal-methods mathematics — kernel-checked theorems and executable mirrors — into the public scholarly commons, free to academic readers and individuals.
How the work moves
Discover · Build · Grow · Learn · Teach. Each stage leaves an artifact the next one can check, which is what stops a research program becoming folklore.
Where the software comes from
Apoth3osis Labs (Equation Capital LLC) owns the underlying software and licenses it to the Institute royalty-free for research and publication; Equation Capital hosts this site at no charge. The Institute is a separate entity.
Published work
The research record behind this work is public and predates this domain. Papers and preprints on ResearchGate →

over to youTake nobody’s word for it — ours includedSend a claim nobody can check: a system whose behavior cannot be reproduced, a body of mathematics nobody has separated into what is proved and what is assumed, or a result that has to survive contact with hardware. What comes back is a verdict, the evidence it rests on, and the rung it stands on.