Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
fdf745660aa7c4bff010f3bd6de13c7d
- 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
4cee5c50fa192fe3897c6a7b87519c68d94d9062ed47a2914e49db98c3ea99bd- Seed hash
6ca9028109a3344f006e2f92ee43c90c576236f7aab352b42d783da73d0dd736= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 49,481, Merkle root
a0a1c574d492ed4b8a8f0ec0bac0e3b57d42032e4214ca58d25e5d95a500b54a. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
69266f442755bafe1eba8ac8d6c592bf0c7956ba37dd6982bd416008a18879f9
- 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":1}} | |
| 1 | 2 | {"bid":{"quantity":1,"face":3}} | |
| 2 | 1 | {"challenge":{}} |