Result
Chess v1
Three check blitzPlay moneyfinishedentry 1 play · winner takes 2 play
dad2f75135318cd7a619d268b6c58882
- e054e6…b9cfSeat 1+1
- gbbSeat 2-1
Results
settlede054e6…b9cf+1 play
gbb-1 play
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
d65f7d00ae7f9dd246f3a5450f8e8b68760901fba8ef95f9ce538d5cb9894401- Seed hash
8e1375afdafdcb7ea100e84c0d805125f95ad55554b2ea3aadc5f24be91282d6= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 47,743, Merkle root
934b2c4215505911175d1d1c44a5ad3c7619038507a9e365f37b1bdc68b3e6fc. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree - Merkle path
145852979773dc217043abacdda3b7670bb6d374c81c0dad2e0d972e7e7e90804d4945bff7788b84aa5d9affb36176221fa9d3fd3b7c06771e02992cd169084e
- 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 | 2 | "timeout" | timed out |