Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
9165760136c38023d5701cb088a54627
- 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
39e87e514669b3a226a88cd9387d39ad28612f613a7e7a4c209b7d34074a7620- Seed hash
ccfa7d3b0389d617d37fdd7618ec3b99a6eb45ce65e06203be9ae2e6bb4ec49c= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 47,462, Merkle root
4a8db32e4fa8b9b64acb7eb1581ffab6087efd1b07f36bf7b220fac2029ece63. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
c1d6e03142f6a7d9ab9177cc6b3ba18738052148a172fde745ae97166a0dde6a
- 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":4}} | |
| 1 | 2 | {"bid":{"quantity":2,"face":4}} | |
| 2 | 1 | {"challenge":{}} |