Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · f061e68dc9311a325f1fcdfac6c6c25b
- 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
e9e17caf61de2c3ecf3a428ce0c7766123ad5fe33855270fd95981df71d467ac- Seed hash
dfda48c9caaba451ef8ab85f7390f1f6bdf03676259d69b8d0ec616a02b75003= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 69,036, Merkle root
c1588816de408660ab19cf00886190baf470cfe5b32034c22ab6e40a03a2d6e0. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
b2fe7f3de252f7e93ee20b3a23139d44e59d0d22e2dbbfe57e9dcc4063c389c5
- 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":2,"face":3}} | |
| 2 | 1 | {"challenge":{}} |