Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
d051e0af7ef718bf8a0b2d47bc403f2a
- 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
99ce1da290829b2def749e77649be32d5fbd9d1438cdb3e3cd84789cb37b0cc2- Seed hash
fc7fed4f93b80dc5cc2dd4cec2911b2cb794baef472bcb41ffa8a9d3d88433a8= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 73,150, Merkle root
eae72a6450caea6fe95f8707bb4d54e5db3132e64c3c77bfd82bff0cf05492f7. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
09f58d3458018cc2499cbb7df29856fe89be40f2625ed84f05540ae017edb866
- 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":1,"face":5}} | |
| 2 | 1 | {"challenge":{}} |