Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · 367b7bcdae6f84c98babd27c0f1757ba
- 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
46e9961e951fb2d7353e54b4cf72317c47d78f43f46aac9a864749c1989e6830- Seed hash
6d2a89a4aa1e633068d6903a64dfbf428ba2a308b2b9a2342976fd612f213d3f= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 66,062, Merkle root
955aba106396bbf6153139d003618536c348325bb9ac7f9fc150912c0bef6346. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
86e0a44a7dc461cd0480123f0559793dcf8883b61de80a6a90a11c1d1ec25ab9
- 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":4}} | |
| 1 | 2 | {"bid":{"quantity":2,"face":4}} | |
| 2 | 1 | {"challenge":{}} |