Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
eb370d65e8ebe301fd343f93b42cfa1f
- 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
6c22cc6557c3479b47ce26ce7d55287d3ee737892925c9a2abde25fbaed12ca4- Seed hash
41b81f19a618e8deedf89ad93e9d38e170687f99088f803702e2bda5962d4ce9= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 53,230, Merkle root
1220faabbdd89cc7fddc3d8b3097937cdd6e6c00fe8066dda3944d76974ac7c9. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
7007ef9f942e27357b178d2c87e62c79e8e9e896f2285e106d5e5dc362e6fc3e
- 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 | {"bid":{"quantity":2,"face":6}} | |
| 2 | 1 | {"challenge":{}} |