Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · a721cc7a8fa7c6d46b835f29ff3f0d33
- 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
37337387de8d8bcf223643d32426d5b07f7efa82ed0d3a843c1240cfcf5b3ea5- Seed hash
21218f180a7fa928819f7a4990f91b9592b396d49a66d4330e92be39f45c07de= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 63,749, Merkle root
01060ce0105e4e9bf24f1310d6a9727bfaf8dd7c8add687cf3ffc80d74c851b1. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
95d7c76c12ea762cbe653975dc231dd5369cfea0d43e65d0f65686a4a8bcbc3c
- 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":1,"face":3}} | |
| 2 | 1 | {"challenge":{}} |