Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
df122048b5c9aef41814212fa7067659
- 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
ac65ed6ebd9ce7275f933dcbe67927c66c86286b9707a455b4325f1829e598f2- Seed hash
c896b1acfeb6cd31bcd54539b6164eafeca74d9b3c73f7d1b8a5b0d492c29a82= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 48,193, Merkle root
70925385bb5f48e816ed3dec0f17fbee140fb76badfa86b71a02ffc74c4724b6. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
efde98e8aa1124f063506cc4984d1da8a53efe8bddeb107f1e91dedbf8dc01d3
- 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":5}} | |
| 1 | 2 | {"bid":{"quantity":1,"face":6}} | |
| 2 | 1 | {"challenge":{}} |