Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
f71d306afe3f2acb1d9b0337d1e1cecc
- gbbSeat 10
- e054e6…b9cfSeat 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
b35ab2c932ef84f3008037c86ffc1976faaa29388d2283d039ddbb3ba1c63792- Seed hash
ea3eabb3ea25cedb6c9c6e07491e7f33c49a3533ec9e192589324052819514c5= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 47,079, Merkle root
e6a5b7757b49a91c18089618729bc2d23a5da2de240f99512db7662c3555f780. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
63f5ceb65f7a92b9a9db53bcb61be14887943a811dad2610a7808b60bc5eaefc
- 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":2,"face":1}} | |
| 2 | 1 | {"challenge":{}} |