Keno (2 picks · Low)

All-time

first round 32d ago · last 32d ago

How it's built

Pick 1–10 numbers from 40; the sealed tree tracks hits and misses through up to ten draws, using the remaining selected and unselected counts as each node's weights. Each conditional is quantized to 10,000 probability units, preserving rare hit counts that a single coarse payout histogram would lose. Low, medium and high risk select different payout tables; one pick has the same distribution across all three. The terminal state records the actual hit count even when several counts pay zero, and the renderer reconstructs ten distinct numbers consistent with that count and the exact settled award.

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.