Channel
verifying on-chain…
Channel
verifying on-chain…
v14 · Channel #5073
+$1.90
1 round · 6 steps · $4.03 wagered · won
✓ Provably fair — the seed was committed on-chain before play, the exact step stream was signed by the player's key, and every roll, decision, and payout below is re-derived from public inputs and matches the on-chain settlement.
Verified in your browser
Re-deriving every check from chain reads in this browser — reconstructing the game trees, re-rolling the seed, recovering the signature…
Don't trust this site's RPC either? Paste any HyperEVM RPC URL and re-run — the verification then never touches this site. The algorithm is verifyChannel in @freeroll/sdk — run it yourself from a terminal for zero trust in this page.
Parameters chain
Proof of randomness
✓1.The seed was committed before you played
The commitment keccak256(serverSeed) was fixed on-chain in the open transaction at block 62711888, before any step was played. The seed revealed at close must hash back to that commitment — since keccak256 has no known way to find a second preimage, the house had exactly one seed it could ever reveal, chosen before it saw a single one of your bets.
Commitment (bound at open)
0x474fdb8d2365b0186027d3bfeb18704e4fdd90ecd26227472c63b24bbbccac4f
Server seed (revealed at close)
0x07b0efc8771c0c639912ec37ada9b3c846727fcd8e28bee8030da7e74da50cff
keccak256(serverSeed)
✓ matches the commitment
✓2.You signed the exact stream that settled
Each step, your session key signed DrawCommit(channelId, steps, root) — a running hash-chain over every round you entered, every decision you took, and every reveal you requested, signed before the outcome was shown. The close can only settle a stream and count carrying your signature: the house can't add, drop, or reorder a single step.
Signed message
DrawCommit(channelId=5073, steps=6, root=0xa5e1d8d6…723c9da0)
Recovered signer
0x6e8DA03Ce1aCA3aEba39a929267d14FF01037b0D ✓ = your session key
✓3.The stream hash-chain checks out
Re-folding the submitted stream — root_t = keccak256(root_(t−1), t, …) over each round's (stake, game), each decision's choice, and each reveal — must reproduce the root you signed, pinning the exact sequence to your signature.
Signed root
0xa5e1d8d6cd9138300a9c2d814b4a21bea7985e8ec7d6f790ba48f986723c9da0
Recomputed from the submitted stream
✓ identical
✓4.Every roll re-derived from public inputs
Each roll is keccak256(serverSeed, clientSeed, channelId, t) mod 10000, walked through the on-chain game tree it was played against. Recomputed below — not read from anywhere.
Round 1 · played against game #0 (player-registered set) — sealed tree #0
fold t1 · roll = keccak256(serverSeed ‖ clientSeed ‖ channelId ‖ t) mod 10000
t2 · you chose option 2 of 2 · worth 0.95× under optimal play · the best option available — no roll here, the choice was yours. Values come from the sealed tree itself.
fold t3 · roll = keccak256(serverSeed ‖ clientSeed ‖ channelId ‖ t) mod 10000
t4 · you chose option 2 of 3 · worth 0.99× under optimal play · best free option was 1.13× — no roll here, the choice was yours. Values come from the sealed tree itself.
fold t5 · roll = keccak256(serverSeed ‖ clientSeed ‖ channelId ‖ t) mod 10000
⏏ The final round ended mid-play, so it settled at the position's table value — the same mark the contract paid.
✓ The recomputed net, wagered total, and step count match the on-chain settlement exactly.
✓5.Every round respected the committed caps
The channel committed hard walls before play: no stake above the budget of $4.03, and no single round whose worst-case win exceeds the committed per-round cap of $269.76 against its own game's maximum multiplier. Every round in the stream was re-checked against both — the same integer comparison the contract itself enforces. All rounds fit.
Game (on-chain catalog) chain
Each game is a value tree stored on-chain and validated by the contract when it was sealed — the edge under optimal play is enforced inside a fixed band, so no game referenced here can be unfair in either direction. The payouts above were walked from these exact trees, reconstructed from the chain's packed words.
What this page proves · what it assumes
Proven (recomputable by anyone)
Assumed (and why it's bounded)