Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
d113f015836e72e4a9f0f7a85f7697a6
- 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
8aae70b03fb9f235608f7d7162f1beb4955d0c6707149a4cd59d14e33ab13f6c- Seed hash
218f5fdf84f4a17b85cf15bc1ff791de93dbe771249069c307e0188844000926= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 61,918, Merkle root
a070f9eb37861490d31540f3aa483f5da1b0d8d536a6c9bd84bbc6dba57a75c7. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
c3742ceb33b3af47146114fb92bb6ee8696604622a9c129db890cff071d1f849
- 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":3}} | |
| 2 | 1 | {"challenge":{}} |