Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · e07d9e36e42e44b6077cae2fc8a9d0b9
- 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
c0c6967a9c1cc702e2204e6df4a1e76547f75ccd18b9734275b646bc7294f670- Seed hash
47cd0c27b272e0214474e17e8df20c298e3b7aa887e0c4ef2fb13646d24c34fb= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 64,231, Merkle root
e01233ed7703f6a0425ec5e1573ecf481abb35851a5705cb50b0549a1f67b744. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
32e6445367659a6f7dcd6e72512e79a6b2b8ae20f97a7bb8bba3eed94f91f6c6
- 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":5}} | |
| 2 | 1 | {"challenge":{}} |