Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
f6b0ddb38b3550723357b8764f884074
- 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
3ec670a7ada45ba2b5adc0061315400d84ad50261ff78db0275634e2e076bc99- Seed hash
c1e5c0ec4d8e06d28f0d94d17b45a06d49d67f89727e9fb72c267814c94f3634= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 60,480, Merkle root
260de567b0e1b8eef32a7e87da8a3f914672a60caaf56d700dc8e18f6ffc1ffd. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
ea7456660846f21cfa471d3a091ac539202a9a9407109affeee5a6ec94705ebb
- 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":5}} | |
| 1 | 2 | {"bid":{"quantity":1,"face":6}} | |
| 2 | 1 | {"challenge":{}} |