Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
ed8e9dfeaf08ea6f3e0440f35aae6c4c
- 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
91808be5389850ccba7bdf9c6d526bfd4ed2ac5f7ff5e37abf4b4b4d99b8faa1- Seed hash
12e3d7470330701bb26376b6f973db4200726636167be2714ee8ac3468f67bd3= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 58,335, Merkle root
1dd70fbdf7a2494cbc7b5b0a9a6e0d0837ebe863f579f000b6cc260274154e12. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
75d5545aca44832c36469e6db8893a852d659bef0fc7b41fbc22c63c00c6c7db
- 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":3}} | |
| 1 | 2 | {"bid":{"quantity":1,"face":4}} | |
| 2 | 1 | {"challenge":{}} |