Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
fe846dedeab65607708be7a2dd2daf65
- 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
d7ba52c27ff97c0173c8ffad1a641a0ac149cf0462641d6192d296d7ff498f42- Seed hash
00dec716c758fe621179d1da9855d54a4674a876b241061a12598d627d2e7d70= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 59,768, Merkle root
0dea8568d283c7ceb89e59f5d80f3ad9ca315ba591bcee36dd02f8878a8c25d3. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
9a691617bf25c1d104fc9b1db7e0ee05b6677f23bb24db7754bb1dcacb09b466
- 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":2}} | |
| 1 | 2 | {"bid":{"quantity":1,"face":6}} | |
| 2 | 1 | {"challenge":{}} |