Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · aed786905cbe2851679d1ab7f9667ad4
- e054e6…b9cfSeat 1+1
- gbbSeat 20
Results by round
FinalRounds
1
played
Pace
–
overall –
Biggest swing
-1
Seat 2 · 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
a6b871c6a94f9c6536bbc2df6e1df0f81f83d08db26e201fd8e461cd9792d799- Seed hash
fedc69133581d88e54426a3d0414c4be503d0b8354a3c54d3d8df72be2a46f46= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 70,011, Merkle root
3da11e6955bb1418e9fb49d04585a3391e40839499488eaff264269a3d864b2b. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
ffd6eb36fab39fccd50bde5f01ef670439e5d0b66bd01b692c14feb979bc5432
- 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":6}} | |
| 1 | 2 | {"challenge":{}} |