Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · d25ff0e8c797d22c9fc7f20c8adfcc4d
- 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
67fb4fdc78f2037ada58381ffa09d062ba63bca334b82fa07e0a5148f1d01fd8- Seed hash
e2d38919e186054a6b3394766e1e4c8df55a75e526a781039190be526395a686= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 72,898, Merkle root
29d428aeead410ee844b72ea3d145c418f79c3ee7accb866c36c07855ade2bf9. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
afc02c65959e9dc3fe0b7645010407f3e604a4c97287b15a97fc4723c2b52aad
- 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":5}} | |
| 2 | 1 | {"challenge":{}} |