Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
f2d7429591d98cd762cbf581982e42e2
- 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
5d8edbf4890a40adab61a15ac4a150f9169a8ca678669701f4c516d89c892050- Seed hash
b61c2139fbd71aaeb5d31b8fe7303ad568d542d8a7b1d8698d00febdeafb02c7= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 52,586, Merkle root
3baf6d42bd78257d2259d86e4ee1382eac791c7a5e6765a114ce3f400f9cb8ac. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
ee1be09d7beab17b60d397eb383886d8c2c3c45c7fe6487be975edb94b115a0d
- 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":6}} | |
| 2 | 1 | {"challenge":{}} |