Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · d73898740b0b1757ca6ae0a3edebaad8
- 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
0af8126bbc63e2eab6070d5e525f8ed59f46c0329f9c04e2c97174033db83094- Seed hash
8435235bbfa8cb6f037a65cc34000c8fbccb6512573ad07fb38c91ee6d26095d= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 65,091, Merkle root
c2da4fe9c08a4b30a1ec8c037580b106167d847ac98fa2b9f510bbd003825962. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
eb6d6f976e5a1405ce84b682a3dada5b13b4416a6bc1fd5e1e6c069fd2787c0a
- 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 | {"challenge":{}} |