Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
d416cc5a6a758c111d26f794ab0f7768
- 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
4547dd95df096509c40507a7400ce6f1ec33f72109ae09fa06330f371fed6f60- Seed hash
f1e3db40f763b94b1c9c64b6fc975c9fac656be37341896ea573033fd4c9b398= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 60,243, Merkle root
2c6028ed984dd0ee7d0d2b1996167b48e5153e8fa31987bccf5171542c21f4e8. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
ff35e37d9e8d0672cf59350e8845b0bc2d2fe79545f7f7e779a812846674ff1b
- 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":3}} | |
| 2 | 1 | {"challenge":{}} |