Game
reading the chain…
Game
reading the chain…
Game #61 · set #1
Crash without the trusted clock — the gates are the game.
All-time
first round 3d ago · last 1d ago
How it's built
32 altitude gates: hazard is flat 6% per gate through ~2.07× (fine cash-out resolution where most rides die), then ramps linearly to 20% at the ~37× top; multipliers satisfy M(k) = ⌊anchor · Π(1/(1−hᵢ))⌋ so every continue is EV-neutral and the edge is charged once, at launch. Continuous-counter crash (Stake's) is a trusted-clock game — the operator decides when your click 'arrived'. Here a cash-out is a signed action committed before the next reveal, so cash-out resolution equals information-release resolution equals tree depth. The number on screen is always exactly what cashing out pays.
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.