Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
beea8579eb0ac3ca8fcd9b029be920ca
- gbbSeat 10
- e054e6…b9cfSeat 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
d859f871d34ee5c84f5bd2682d2471812b2583bd86d4194a260aabcaf7e753ca- Seed hash
525aa3cc67862ca4917f542ac945a327d1e11d97a5b1d64952df5021fdf92663= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 62,607, Merkle root
63c896d306434e4332b5f7a613a27040da1a60b94c05d44188465b712d823752. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
2ddc5b181b03b70d25b41631b0848b508fa4a1e91efd204c76d6b6fdf2290a16
- 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":4}} | |
| 1 | 2 | {"bid":{"quantity":1,"face":5}} | |
| 2 | 1 | {"challenge":{}} |