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