Game
reading the chain…
Game
reading the chain…
Game #0 · set #1
The unit cell — one Bernoulli node, the whole protocol in miniature.
All-time
first round 3d ago · last 2d ago
How it's built
A two-leaf chance tree: 50% pays 1.97×, 50% pays 0. The root value is exactly the win mass times the win multiplier — the edge is visible in one multiplication, which is why this is the reference game for the whole catalog. Every other game here is this same object with more leaves: a probability-weighted tree whose root value the contract checked once, at sealing, against the protocol's edge band.
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.