Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
a5e083e9c76816c32e34c12e93dc1c55
- 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
7d89954e7d08a069d1ae30b46f22ac71d18e5ea1af2f146b34920c726422206e- Seed hash
ef0c51e7ef6bbd476b7b0ba2012179dc8b01b300c902f0a424b498e59eebd689= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 49,509, Merkle root
c9016bc7a9f7b69e0c8c48f9664bc2c64bb3e71806d2672e17debe9bda9e2065. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
2dbdb107cbcf3a55d10b648f7e6bdc1754073a8af15a6723ef986978c6459072
- 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":2,"face":5}} | |
| 2 | 1 | {"challenge":{}} |