Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
a98ca8b9af374343c46092e5c48fa3d4
- 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
28ff2f849899452b4bfb499f9e9037fff677ea9de5d5a3ae2a1a2b2e197cdd85- Seed hash
2432ad0d635fb162ac8995003e3353dfac10182eb5a83e9b75702441c446ac81= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 49,669, Merkle root
8a3fc118726ab2e5f67aac794582e32b089d5f66765f1ef996ba92db8230c364. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
25c22d62d2862c04ff5a41858fd048dbc1c08b629d7d4ebba8146e161574bb06
- 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":6}} | |
| 1 | 2 | {"bid":{"quantity":2,"face":6}} | |
| 2 | 1 | {"challenge":{}} |