Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · e50f1dc057bf17376ae206b97db744ef
- 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
4ff8fd76e0534e5f50a7b58e89141e1064e2cf0ccce11f9045188e6457c70e56- Seed hash
a3ecb8fd4d56bc00cfbfec94a39bb1667e2bb9e65e849a4177267ee656ee226f= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 72,873, Merkle root
73f6fb25fe2d0237697a434c845b6c7d1cd6d355a0f29401b5f8a78e62d21146. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
30c9b7bdbd27e25582681651934b95f808f8b59a418363b1f6caae2b98b64ea9
- 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 | {"challenge":{}} |