Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · 36902468342e8980b76ed297ad6c0ba4
- 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
e0caec0bc1dee0b92cdb4786611b966245700a2ef46da91726a57d2a96b43e52- Seed hash
aa5be0b4a404d31a53ecb45a756528dddacbc6fc703ed7ef7c3ff6ab95b98bda= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 68,660, Merkle root
57c6a2b6d24bb23cbe12a1b84d706509cf0dc4ceeee1b6dfc210ed7af8741233. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
a8aa5dca152e818e81a0679d8748b8270061276bd1755f2207fb6c0ad48fa147
- 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":3}} | |
| 1 | 2 | {"bid":{"quantity":1,"face":5}} | |
| 2 | 1 | {"challenge":{}} |