Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
ff435b0df19067a568768e803b379fb5
- 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
039825dfb4925e6d74bfd7a8bdda25909df604ea20c1d035710ff3c947381b82- Seed hash
3ea581b70b70372c9725a690aab130cb683a7923b645dcbe9ed3fe3c1100f6dd= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 56,649, Merkle root
122d7c2a3663eee3cc5de8838df75b9774ea9b699a3b4bee10124b9a691224ca. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
7afc12b063134444c7c571c1b69642bffe560e3d8a85ac12df437de4433a746e
- 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":2}} | |
| 2 | 1 | {"challenge":{}} |