Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · e3661d1dc6b4f283c0caf94e59af7a30
- 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
dd1c435d61732916a991f8cb08c0d889f1af1d5ff596f3a1d701147976fdb19a- Seed hash
204c5c424aff73e8beff3cd98be332a1efd776efed4d41b177684554613ebc0e= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 70,561, Merkle root
7cce6194633779b5927306756824a56aee00c7045b9a4fb2dfbc5fa64e5456f9. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
d213ec1a170dfc183604f2eebc52ba717af73745dcac2d2439e6e6de185820cc
- 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":2}} | |
| 2 | 1 | {"challenge":{}} |