Frame 08 · executable proof

The Teleporting Roguelike

A tiny dungeon whose map, hero, monsters, inventory, combat, discoveries, and device hand-offs exist only as the deterministic projection of an append-only SHA-256 frame chain.

What you are looking at

A playable dungeon whose map, hero, enemies, inventory, combat, and discovered rooms are rebuilt by replaying one append-only hashed frame chain.

Do this

Use WASD or arrow keys, or run the guided proof. Pause A, transfer only its chain to B, continue C offline, and try both forgery controls.

Watch for

Every move becomes a frame; skew-clock B reconstructs identical world bytes, while C reattaches only when its declared reads remain compatible.

What this demonstrates

Parent hashes preserve dependency order across devices, and verification refuses forged items or provenance without disturbing the last good game.

Deterministic dungeon

LIVE · DEVICE A

Health—

Turns—

Rooms seen—

Inventory—

Enemies—

World SHA—

Minting the genesis frame…

Guided proof

STEP 0 / 8

Run the scripted proof or use every control manually. The demo uses the same public operations as the game.

Live assertions

Canonical SHA-256 chain verifies

World derives from frames only

A/B world bytes are identical

Skewed clocks cannot reorder parents

C reattaches by declared reads

Forgery refused; good head preserved

Three-device lab

CHAIN BYTES ARE THE ONLY TRANSFER

Device A LIVE

Clock: UTC. Start here, then pause before teleporting the chain.

—

Device B EMPTY

Clock: +07:23:00. Dependency order still follows parent hashes.

—

Device C EMPTY

Clock: −11:00:00. Continues offline from an older verified frame.

—

Replay + append-only ledger

0 FRAMES

Frame 1 / 1

#	device / event	frame SHA-256	parent	declared reads	device clock

Scope

What this proves

Canonical browser SHA-256 detects byte changes.
Parent links, not wall clocks, define total dependency order.
Independent devices reconstruct the same canonical world bytes.
An offline branch can be replayed onto a newer head when its declared reads remain ancestors.

Boundary

What this does not prove

This is a deterministic, synthetic, single-browser model. It does not model signatures, hostile key custody, network transport, consensus among competing writers, or production persistence. Device identities and clocks are synthetic. The chain is kept in memory and intentionally disappears on reset or refresh.

Copyable independent-build prompt

Build a single offline HTML deterministic roguelike. Store no mutable game snapshot: derive the map, player, enemies, inventory, combat rolls, and discovered rooms solely by replaying an append-only canonical SHA-256 frame chain. Simulate Device A, a badly skewed-clock Device B that receives only chain bytes and reconstructs an identical world, and Device C continuing offline from an older frame before declared-read compatibility reattachment. Include valid-hash semantic inventory forgery and parent-provenance mutation paths; reject each without replacing the last verified game. Make it keyboard playable, responsive at 390px, accessible with aria-live and 44px controls, reduced-motion aware, dependency-free, and explicit about scope.