Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · bb5257c4036ccf4e6f9115fd6ea56b51
- 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
0b8599a8aaea1e4e35f45377ccbbf76e8545a796d7799aab658e22f1424d7afe- Seed hash
bc7dab3469508857c446ce8666e61d9863f9fe60d8f1a903f1bb9ee9f74376a6= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 64,324, Merkle root
77fb8bff8b57ec9eaa84ecee70903f5b81e653a46f2ca6e936044bfbdc8ab3c9. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
1bbc52706febc62bcf31c5ee74e26b1098146143dc24640d247bff08db72b25c
- 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":2,"face":1}} | |
| 2 | 1 | {"challenge":{}} |