Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
b216e4d3a2072833e4a6242ff8d7c3f7
- e054e6…b9cfSeat 10
- gbbSeat 2+1
Results by round
FinalRounds
1
played
Pace
–
overall –
Biggest swing
-1
Seat 1 · round 1
The chart starts with the first round.
Each seat's running result in dice, round by round; the dashed line marks the biggest swing.
Replay
← → step · space play · Home End · f full screenMoves so far
Provably fair
Verify fairness
The seed decides every random event in this match. Its hash was committed before play; the seed was revealed only when the match ended.
Checked in your browser
Checking- Seed
1d9861beea6b9b89925f276326c79ee480741284ea0222fe919f861b6c2dfda1- Seed hash
c75ca441082b240082d302f7a8e25e0f8c9e49b1fb8f4e32965e6292deb54cde= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 59,152, Merkle root
b60ade7a1e94985bac39e6868f9fd12426faffc49b652f1da1d0f41fdecd0f99. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
c7d8fdeb7eec458016abca388bdd02c473f4fb9714f8921f864797cd026abb66
- Checked: the seed hash proves into the root.
To check it yourself, take the replay JSON:
- Hash the seed as above and compare it with the seed hash.
- Leaf = keccak256(0x00 ‖ seed hash). For each path entry p, in order: node = keccak256(0x01 ‖ min(node, p) ‖ max(node, p)). The result must equal the root.
- Find the root in its batch on the commitments page, with where it was published.
- Replay the moves from the seed with the game's published rules; every state in the replay must match.
Every move
| # | Seat | Action | |
|---|---|---|---|
| 0 | 1 | {"bid":{"quantity":1,"face":1}} | |
| 1 | 2 | {"bid":{"quantity":1,"face":2}} | |
| 2 | 1 | {"challenge":{}} |