Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
01ab5b309194a6c56ef387b1a79806c2
- 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
6c56b58723f1a22442147474eda3cb4877f0c02e5c08d2aeba751e0ab439a96a- Seed hash
6d2abda39746a818bda7129c79531dc7667ed49cf2e1b8eb3ad14d6bda8f16b3= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 61,326, Merkle root
d7965f0bff12d9951fdd31c8097c94350385ae21f687a5aebeb0444057f7e0d1. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
455d76d69d095b7aec116676cd608566de23a147775e2a5b768bf5f03627bc77
- 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":2}} | |
| 1 | 2 | {"bid":{"quantity":2,"face":2}} | |
| 2 | 1 | {"challenge":{}} |