Result
Chess v1
finished entry 1 play · winner takes 2 play · 62799e92574e38011b7a70257ae78db9
- 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
7b7f556810eff87a96d2ccb6443c4f6a7f33af218a3540f4367227085c062ab4- Seed hash
d46860bdd6a57f4113c4811cd3f168332092962dab78008eef51f0e597c02554= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 68,671, Merkle root
a83e8241ade768a147c529d532417300e4203b80612d43b46a2032819001be03. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
e0a7055485a24b44da96c8730ae15bfce2a27733c363e2f23211189dca13fe8c151fdba81012fe5e5769ef86dbd5362f00b7cbf29f2db5ee08a084aaf3da1a31c83343dda39a52ad727d72f3f2541a959f43127f9b87643ada6668c660c1d3ebad8f2cdc8fc69cc49ec35a0a74aa40022e09327d337328842e9fdeb0e8ab03b0
- 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 |