Game
reading the chain…
Game
reading the chain…
Game #38 · set #1
12 rows of pegs, a binomial in a costume.
All-time
first round 3d ago · last 1d ago
How it's built
The ball's terminal bucket under 12 rows is a binomial(12, ½) draw — the committed distribution IS those 13 bucket masses, with the payout curve (edges rich, center poor) shaped per risk variant up to 50× on the high setting. The bounce animation is a presentation path sampled conditional on the settled bucket. Three variants are three separate sealed trees, not one tree with a knob — a sealed distribution has no knobs.
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 distribution
This is the entire game — every outcome, its exact chance, and its exact payout, reconstructed from the sealed on-chain words at render time. This table is what was submitted for edge-checking; a roll does nothing but pick a spot on this line.
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.