Many-Worlds Mission Control

What you are looking at

A synthetic mission written as frames. Each frame contains the exact SHA-256 hash of its parent, so history is a structure—not a story someone asks you to trust.

Do this

Run the guided proof, or select any canonical frame and fork the three mission policies manually. Merge them, then mutate one parent hash.

Watch for

Every branch begins from the selected parent state. Compatible claims converge. Contradictory objectives stay side by side. One mutation turns only its branch red.

What this demonstrates

Counterfactual histories can be deterministic, independently verifiable, and mergeable by dimension without erasing genuine disagreement.

Scope: This is a deterministic teaching model with synthetic telemetry, simplified kinematics, unsigned frames, and an equal-weight claim comparison. It demonstrates content addressing, provenance, replay, and merge mechanics—not flight safety, cryptographic identity, consensus, or physical mission feasibility.

Historical fork point

Canonical streamBuilding…

Counterfactuals0 / 3 minted

Merge fidelityNot attempted

Hash engineWeb Crypto SHA-256

01 / canonical present

Parent-state observatory

Telemetry is replayed from frame events; no independent mutable state is stored.

RHEA-7
OBJECTIVE

SABLE-2
DISTRESS

Awaiting canonical replay…

02 / choose a moment

Canonical frame chain

Every arrow is a recorded parent hash. Selecting a frame never rewrites it.

03 / branch geometry

Branching timeline

Each lane begins with the same explicit parent stream, sequence, hash, and replayed state digest.

04 / inspect the evidence

Visible frame ledger

The verifier canonicalizes each payload again and recomputes every digest independently.

Stream / seq	Event	Recorded parent	Stored hash	Verifier

Copy an any-LLM independent proof prompt

Paste this into any capable coding model. It asks for an independent implementation rather than an explanation of this page.

Build a single self-contained HTML proof with no libraries or network calls. Model a synthetic spacecraft mission as an append-only frame chain. Define recursive canonical JSON by sorting every object key lexicographically, preserving array order, and serializing primitives with JSON.stringify semantics. Hash each complete frame payload (excluding its stored hash field) with the browser Web Crypto SHA-256 API.

Create a canonical mission stream of at least four event frames. Let the reader select any historical frame and deterministically fork three policy streams from that exact replayed parent state: conserve fuel, rescue a synthetic stranded craft, and accelerate toward the objective. The first frame of every branch must explicitly record parent stream, sequence, SHA-256 hash, and a SHA-256 digest of the replayed parent state. Every later frame must reference the preceding frame in its own branch.

Derive every displayed state by replaying event deltas from frame histories. Implement an independent verifier that recomputes hashes, sequence continuity, parent links, and the fork-state digest. Implement a deterministic dimension-aware merge: unanimous claims merge; contradictory claims remain as named parallel alternatives. Compute merge fidelity as pairwise equal claims divided by pairwise comparable claims, showing numerator, denominator, reduced fraction, and exact terminating decimal where possible.

Add a failure control that mutates only the rescue branch's recorded parent hash without recomputing that frame or descendants. The verifier must mark rescue invalid while conserve and accelerate remain valid. Include visible frame ledger rows and live assertions. Do not hard-code PASS/FAIL outcomes: derive them from verifier results. Include reset and replay controls, keyboard-accessible 44px controls, aria-live feedback, responsive 390px layout, dark/light theme variables, and reduced-motion support.

Initializing the canonical mission with real Web Crypto SHA-256…