Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · e3c50fd6dd0497b3b6d0f0e2d6102060
- 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
02b166d6bc8e9f0a35cac8c5e72df7559040b549bc28b50706fc98c2c37d506b- Seed hash
de70be9bc4d9ca675e45250b570f7db4fea73d3e45b57253ddc1daad97135af2= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 64,266, Merkle root
e67f9d842319a595749c7b7de0fbf07b46fe5d06f38108c72d0b5a1c83b564ca. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
f02db9887be7b4675e7a3a9abe82e30d32974a84609cfc6e01e674abec4f2934
- 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":1,"face":4}} | |
| 2 | 1 | {"challenge":{}} |