Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · 8f4a24ea8cfbe1d56598672914fee549
- 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
1d069178adb6a504570c16b4238ea6b288da011dd0fdd4047ba1fb961c95b3c3- Seed hash
1e9964d68925d8c474f9482a175088c7498d7b4a25a4c46a92ad8b5c39616433= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 71,491, Merkle root
bdc8830f0768b318fbfddd0b90663b74ae9ef516aa279477b83831675494fc8f. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
d146c0524a27d7cffb0421ca7a744103a33172e6c0086a21f264f74d1cd6c6d4
- 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":{}} |