Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
caf75ccdd06ca103739df72908394379
- 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
968441b23b137f0cb4b036e5e8b265f7ce82befb0bc16813f151bf070102c8b5- Seed hash
669c5f5226a77b5762bef5b2d044e94923e33a44bd4a4eef891dcaca5b217110= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 59,192, Merkle root
ffab893dcac304623af8f2f0e12d98a64d868e3db5d653a45a5d53fd27e0fd4c. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
10b4aaa005c40bdce9141772d275bf88b0843e591dc4ad92effa2012b7d275fe
- 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":{}} |