Game
reading the chain…
Game
reading the chain…
Game #66 · set #1
The first coupled-state decision game — heat makes your history matter.
All-time
first round 2d ago · last 1d ago
How it's built
State is (floor, heat, loot tier) — 836 shared DAG nodes. Per floor you pick a route (vent/hall/blast award +1/+3/+5 tiers on a ×11/10 grid) or extract from floor 3; each route resolves over a committed 5-outcome table AT THE CURRENT HEAT — spotted advances with less loot and raises heat, which degrades every later table; a 0.6–2% master key resets it; bribe pays ⌊2·M̂(t)/5⌋. Clearing floor 5 auto-plays the vault tumbler (×1 to ×10, capped 50×). The anchor M̂(t) = ⌊anchor·11ᵗ/10ᵗ⌋ is Newton-tuned so the Snell (optimal-play) root seals at exactly 985000ppm; the committed values make pushing cold ≈ EV-neutral, pushing hot EV-losing, and the last floor always worth finishing. Every heuristic play style clears 90% RTP — the strategy is real but never a fleece.
Build one yourself — the SDK seals any distribution the edge band admits.
Sealed on-chain
These numbers are read from the sealed tree itself, not from this site's copy of it. Sealing is one-way: the contract verified the optimal-play return against its edge band once, and the tree has been immutable since — every round below settled against exactly these words.
The committed game tree
The whole game as the contract holds it, reconstructed from the sealed on-chain words at render time. Hover any node: green-filled nodes are chance (the seed decides), outlined nodes are decisions (you decide), colored endpoints are payouts. This object is what was submitted for edge-checking — the contract never learned the rules, only this shape.
Recent rounds
Each round's roll is re-derived from the revealed seed on its channel's proof page — nothing here is read from a private database of outcomes.