Result
Liar's dice v1
finished entry 1 play · winner takes 2 play · b1f2c2fd80653e56ae00a75c6001fdbf
- 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
659571444863b4e88eacde86b2d5ca0cba936a05b4e506acd54c891392a8c2a5- Seed hash
1185c71ca23ca90a0ad350e5a7886c8e9037b7aec732d7f36355654e82ae62a9= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 70,590, Merkle root
6ded20161c00c4404afb2861ec224ebd7e4c00d74b9af2ff8350cae7c2eba02b. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
6050d7fbb58ecdc73e102a1052497b589d8cd0902c266294903a194b29034333
- 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":3}} | |
| 1 | 2 | {"bid":{"quantity":1,"face":6}} | |
| 2 | 1 | {"challenge":{}} |