Game
reading the chain…
Game
reading the chain…
4 sealed trees · set #1
The 80-cell scatter-pays tumble — the largest committed board in the catalog.
All-time
first round 43d ago · last 1d ago
How it's built
A 10×8 spread with no paylines: ten-or-more of a dish anywhere pays (three count bands), winners clear, survivors sink, refills drop, and the spin keeps paying until no dish clears the threshold. Specials ride the same simulation: a wild that joins every dish's count (also the tuning knob), a ×2–×100 multiplier symbol summed over a paying spread, and a scatter that triggers a multi-spread feature whose multiplier pot carries across spreads without resetting. Four sealed tables off one engine — three stake rungs (25× / 80× / 250× tops; the stake picks the deepest rung the pool seats) plus the feature as its own atomic buy, priced by an exact integer divisor of the pay grid. Each table is a 12-million-spin extraction, largest-remainder quantized and clamped into a [98.30%, 98.45%] commit window so the ladder carries one flat edge; the clamp's moved mass is recorded in the artifact. The engine survives client-side as presentation, replayed conditioned on the settled tier — the cascade recipe at 80 cells.
Build one yourself — the SDK seals any distribution the edge band admits.
Rungs
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.