MIZAN · EXPLAINED

The Machine,
In Pictures

Ten pictures. Three minutes. After them, you understand what a MIZAN credential is,
what it proves — and, just as exactly, what it does not.

Mohammad Muavia · mizan.market · August 2026
PICTURE 1

The whole machine: a sealed glass room

A quant walks up with two things: their data and their strategy. Before anything happens, both get fingerprinted (next picture). Then the backtest runs inside a sealed glass room — a special computer where the calculation itself produces a mathematical receipt. Nobody, including us, can reach in and change a number. What comes out is a tiny 220KB receipt. Anyone on earth can check that receipt on a laptop in a blink (~81ms) — without trusting us, and without ever seeing the strategy.

QUANT data + strategy FINGERPRINT commit first SEALED ROOM (the zkVM guest) backtest runs statistics run verdict decided no hands reach inside RECEIPT 220 KB verify ~81ms

The strategy goes into the room but never out of it — the receipt proves what happened without containing the recipe. That's the whole trick: proof travels, secrets don't.

In one sentence
"Imagine a glass room where math itself is the witness. Your backtest runs inside; a tiny receipt comes out; anyone can check the receipt in a blink. Your strategy never leaves the room."
PICTURE 2

The fingerprint: how data becomes un-fakeable

Take every price bar. Hash each one (a hash = a fingerprint: change one digit anywhere, the fingerprint changes completely). Pair the fingerprints up and fingerprint the pairs, again and again, until one single fingerprint sits at the top. That top one is the Merkle root — the DNA of the whole dataset in 32 bytes.

ROOT = the DNA hash of pair hash of pair bar #1 hash bar #2 hash bar #3 hash bar #4 hash change ONE price anywhere ⇒ the ROOT changes ⇒ everyone sees it instantly each bar's position is baked into its hash — you can't even reorder history

The room refuses to run unless the data it's fed matches a committed root. And when someone verifies later, they rebuild the root from their own copy of the data — if it matches, the proof was about data identical to theirs. We are not in that trust loop at all.

In one sentence
"Every dataset has a DNA fingerprint. The proof binds to the DNA. You check it against your own copy of the data — so you never have to trust mine."
PICTURE 3 · OUR INVENTION

The trial ledger: the monkey counter

A thousand monkeys flip coins; one flips ten heads. Every anti-luck statistic corrects for how many monkeys there were — but that number was always self-reported by the monkey seller. Our fix: every strategy you try becomes a numbered leaf on a committed tree, before any evaluation. Now N isn't a claim — it's the leaf count. And the room forces your "winner" to actually be the best leaf on that tree.

THE OLD WORLD "How many did you try?" "Umm… ten." (he tried 1,000 — the correction evaporates) THE MIZAN WORLD LEDGER ROOT · N = 1,000 #1 #2 #317★ #1000 N counted by the tree · winner ★ forced to be the tree's true best "A thousand honest backtests with only the winner published is a lie that contains no lie." — the lie this tree kills

Honest boundary, always said out loud: the tree counts the committed search. Trials someone ran and never committed are invisible — closing that fully needs pre-registration (commit the ledger before the out-of-sample data even exists).

In one sentence
"Twenty years of brilliant corrections all depended on one self-reported number. We made that number structural — it's counted by a tree, not typed by a person."
PICTURE 4

What actually runs inside the sealed room

Everything that matters happens inside — where nothing can be fudged. The room trades only in whole numbers (no decimals — every value ×1,000,000), and wherever rounding could flatter someone, it rounds against the submitter.

INSIDE (in-circuit — unfudgeable) ✔ the whole backtest, bar by bar ✔ every trade charged its committed costs ✔ Sharpe, drawdown, worst bar ✔ Deflated Sharpe — N from the tree ✔ PSR & SPA (both schools of honesty) ✔ PBO — all 12,870 splits, each trial its own proof ✔ CPCV leakage test, worst-path headline ✔ "no time-travel" check on annualization OUTSIDE (the checker) • re-runs the STARK check • rebuilds data DNA from ITS OWN copy of the data • re-derives the statistics, demands bit-equality • checks the cost floor • checks track-length rule • names the engine era

Why split it this way? The room proves "this computation happened, exactly." The checker proves "…and it happened on MY copy of reality, under the published rules." Two honest halves; neither trusts the other.

In one sentence
"The backtest and every honesty statistic run inside the proof. The verifier then re-derives everything it can from its own data and demands exact agreement. Belt, and suspenders — and neither is mine to loosen."
PICTURE 5

Verification: seventeen doors, and one honest lamp

When anyone verifies a credential, it walks through 17 doors. Every door is about trust — is the proof real, is the data mine, is the engine the named one, were the costs floored, was anything tampered. The verdict — PASS or FAIL — is not a door. It's the lamp above the exit: a cryptographically real FAIL walks through all 17 doors just as proudly as a PASS.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 PASS FAIL the lamp, not a door real proof? · untampered? · my data? · allowlisted? · published gate? · costs floored? · era named? … an honest-FAIL shows 16 green doors + the red lamp — and verifies perfectly chained credentials walk 3 extra doors (same strategy? window truly grew? parent intact?) → 20
In one sentence
"Seventeen checks are about trust — none of them is the verdict. A FAIL that's cryptographically real passes all seventeen. On our wall, a refusal is a first-class citizen; that's why our passes mean something."
PICTURE 6

Era law: every credential names its judge, forever

Engines improve. The danger: an issuer quietly changes the judge and yesterday's approvals silently mean something new. Our law: the engine's exact code has a fingerprint too (the era id), it's stamped into every credential, and old engines are archived forever — superseded, never revoked. A 2026 credential will still verify against its own 2026 judge in 2036.

era v9b9dc6846… era v10dafad185… era v11 · LIVE3ac3b10b… both schools in-circuit its credentials verify forever its credentials verify forever v12 → changing one byte of the judge = a NEW judge, by definition — no silent edits possible the era registry ships INSIDE the verifier binary — no server, no lookup, no MIZAN needed

This is governance for a world where the issuer must not be trusted either — including us, about our own engine. Weakness found in an old era? It's disclosed as status, never rewritten; the reader decides what the credential is worth.

In one sentence
"Every credential names the exact engine that judged it, by fingerprint. We upgrade by superseding, never by revoking — so nothing we do tomorrow can quietly change what your credential meant yesterday."
PICTURE 7

The black box: prove it without showing it

The oldest deadlock in quant: to be believed you must reveal; to reveal is to donate the edge. The sealed path breaks it. The model runs on the quant's own machine. It sends only its decisions — each one salted and fingerprinted into a growing chain. The room re-derives that chain and judges the performance. Verdict public; model never seen — not even by us.

THE MODEL stays on the quant's own hardware, forever never transmitted decisions only buy +salt flat +salt sell +salt each salted + chained to the last — can't be rewritten later SEALED ROOM rebuilds the chain, judges the record honest boundary: a FRESH track proves consistency, not no-hindsight — only a public time-anchor placed BEFORE the data existed proves the future wasn't peeked at
In one sentence
"Your model is a black box. Keep it that way. It runs on your machine, commits only its decisions, and the proof judges the record — verifiable AI performance, without verifiable AI exposure."
PICTURE 8

Chained tracks: history that grows and can't be rewritten

A backtest is a seal on the past. But the same sealed strategy can be re-proven every time new bars arrive — and each new credential must contain the old one's exact window as its prefix, same strategy fingerprint, parent bound to child. The result: a track record that grows forward in public. New bars arrived after the commitment — so they're forward evidence, un-backfillable, forever.

Link 1800 bars · sealed Link 21,096 bars — first 800 must equal Link 1 exactly Link 3 …same strategy, longer window every month, forever a LIVE track, verifiable a copycat starting today begins at link 0 — your chain's age cannot be purchased
In one sentence
"Not a quarterly PDF — a chain. The same sealed strategy, re-proven as reality arrives. And because each link is committed before the next bars exist, nobody — including me — can rewrite it."
PICTURE 9

If MIZAN vanishes tonight, every credential still works

The strongest question an allocator asks: "what if you're gone?" Answer: the verifier is a small program that carries everything inside itself — the engine fingerprints, the approved-data list, the whole era registry. A holder needs three things, none of them ours:

① the credential(220KB file they hold) ② market data fromANY source THEY trust (matching DNA = same data) ③ the era's verifiermirrored on GitHub, outside our control verified · ~81ms · in 2036

Even the timestamps are ours-free: OpenTimestamps anchors into Bitcoin itself. New minting dies with us; nothing already issued degrades. The asymmetry is deliberate — the artifact outlives the operator.

In one sentence
"The proof is portable and the issuer is irrelevant — and that's not a promise: the verifiers and bundles are mirrored on GitHub, and the timestamps live in Bitcoin. Our death is a non-event for your credential."
PICTURE 10 · THE MOST IMPORTANT ONE

The honest boundary: what the machine cannot see

A verification standard is defined by its refusals. Learn this page best of all — because naming these before anyone asks is what makes everything else believable.

WHAT THE PROOF COVERS the committed computation on the committed data net of committed costs deflated by the committed N ✗ the future — a seal on history, never a forecast ✗ trials run OFF the ledger (→ pre-registration) ✗ real fills & market impact beyond the cost model ✗ capacity — how much money it can absorb ✗ HFT — refused permanently, physics not policy ✗ that you should allocate a single dollar the boundary, stated out loud

And the proof of our sincerity is permanent: the first strategy this machine ever judged was mine. It said no. Deflated Sharpe 0.6779, below the bar, published forever beside every pass. The complete assertion set, stated with legal care: what a PASS actually asserts.

In one sentence
"Here's what a PASS does not mean: future returns, capacity, fills, or that you should invest. A machine that pretended to see those things would be lying — and a machine that will not lie for its own maker is the only kind fit to judge anyone else's numbers."
THE WHOLE STORY IN ONE BREATH

"Every number in finance is graded by the person selling it. We built a sealed room where the grading happens in mathematics instead: data fingerprinted, every trial counted by a tree instead of a promise, the whole honesty program of the last twenty years running inside the proof, judged by an engine that can never quietly change, refusing most of what it sees — starting with my own flagship. The receipt fits in an email and outlives the company. Prove the edge. Never reveal the strategy."

THE SEVEN ANCHORS · know them cold
0.6779 flagship DSR, not significant, shipped · 0.7226 PSR vs the 0.95 bar
12,870 PBO splits, all of them · 0.0759 flagship PBO · +0.003 worst-path Sharpe
0.84 vs 1.20 the PASS's own OOS, flagged in bold · 17 checks, verdict not among them