Result
Liar's dice v1
One diePlay moneyfinishedentry 1 play · winner takes 2 play
d9541668023308a985e367a66c168ee5
- 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
cc7424b0be75cc00c9314a97692b47121a1e0af88bc805d0b82955e522a0398f- Seed hash
26c4e74341ea763ddeb219ce4a6109181d9def3419232ab3e6c8cd2f87e18db8= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 62,767, Merkle root
328b246e7d98b6716d1fd9e7fa85048f2f48349992f4d0412bec211eaa510118. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
38a087a26bec1791dcc84e56fe26ee9e62782ec68ce637a5bd41c1f743808ac0
- 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":4}} | |
| 2 | 1 | {"challenge":{}} |