Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · fbfbbe6e526e77c85ff1e5aea2e8598c
- e054e6…b9cfSeat 1+1
- gbbSeat 20
Results by round
FinalRounds
1
played
Pace
–
overall –
Biggest swing
-1
Seat 2 · 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
c5826622248042b01a35303614c1d9b75723e55f8097349e9a116db8c2a2bb31- Seed hash
b6e9c7c7097a9299d48e1c79e91d2fca8e0ef4634418c3a6958d4cb6c63ffc89= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 71,111, Merkle root
f90c574c0df63b1a498a2d9209e3ede4ec667e7c7779f34039c2fd0028c93b84. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
d3a9dd089b1522350728ce3a07466686237c94f9760bf4c7d235af820178319b
- 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":4}} | |
| 1 | 2 | {"challenge":{}} |