Game
reading the chain…
Game
reading the chain…
Game #26 · set #1
Dig or bank — a decision ladder over a 25-tile field.
All-time
first round 3d ago · last 5h ago
How it's built
A 5×5 field with 1, 3 or 5 mines depending on variant. Each dig is a chance node whose survival probability is the exact hypergeometric count of safe tiles remaining; each cash-out is a free decision edge to a leaf paying the current ladder value. Because cash-out edges add no stake, the optimal-play value the contract sealed is the max over your stopping strategies — you can't beat the band by quitting cleverly. Which tiles hide mines is presentation; how deep you dug is the money path.
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.