Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
ac16401f0d17e8f0d67df7671b6d11ae
- 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
6573b6971aff963484e9d9eed4a8c8530b22fcffcdd6d8376e4e9717ef19d606- Seed hash
50d9e526fc4d72e1d1e90a016db82b74b372c664cd69a04132c7fd0c35f07b53= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 51,795, Merkle root
b24b7ce81497f28444c8ae4002fd6429c21ab83d69ae332200d21a819829b209. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
db4ea94bef1fa8f7b9747f810eaab653a444cf17f21eff3defd2c21fa494be78
- 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":3}} | |
| 1 | 2 | {"bid":{"quantity":1,"face":4}} | |
| 2 | 1 | {"challenge":{}} |