Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · e822abbd72f34e4ced6ff2e7fb6b0cc2
- 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
6086b829bc44a503730c429b201ae6681bed94f1b51cea35b9e1e98f8755a1f2- Seed hash
6f023ab8ea89bec57682dd25a37bcfec87dd1ebecf6d193546d0ab1124353c6e= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 67,325, Merkle root
8b6e5db4afab17987bfd3a30c20dd38359daccab6e4b982189c4c591b8142473. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
1143103635ecd4eed3e1fccbbf15ea6f431dc438b224b4be340034ec1c9e26b9
- 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":1,"face":3}} | |
| 2 | 1 | {"challenge":{}} |