Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
fb250dd2cad5bee7d1e43384dc4e1617
- 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
ca876a1e95a9b7ee17abb134250a04fe6ab98077b56d12b434eb2d16c517dcfe- Seed hash
60e94133dadd3c95e827bbb0afbe2ced2f52ca5d574d3d7f3510259dbc20cf91= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 53,788, Merkle root
4ba8f7a149b2ea59d2d263d1043de7962b75cb04b1a05a30fa8ad347a5a23c1f. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
d1eb421ccfe64b7acc6a8374759d85f26fa11883278c2dde7e92df160d2bc043
- 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":{}} |