Chess v1

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.

Seed

e257a3c9b75e6d9e0ab1084e201ae9f1f89f6aae7010a8dc84da5d472d954003

Seed hash

04485a6c18b3a3845d0d50f3b41adab32d83667ca92f7efe5c0572019448fc59 = SHA-256 of "degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.

Commitment

Batch 52,510, Merkle root 8ef8dd2d3b2de7b15affbe6b538dbe3132eac0de5c94353fad9e5e0b81490323. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 5c91c033df51b76effe995f11b66deaf7b492ad6b07ea6651db6a22409142462
2. bafcf9d0aae1252149bd23d07e44540a3a4af6011d07d05a8ea722d66095605f

Checked: the seed hash proves into the root.

To check it yourself, take the replay JSON:

1. Hash the seed as above and compare it with the seed hash.
2. 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.
3. Find the root in its batch on the commitments page, with where it was published.
4. Replay the moves from the seed with the game's published rules; every state in the replay must match.