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

6e3c0c811ee8d289f0eade53865487ad09e2d2dc271c27821241e2bd8d68c6c4

Seed hash

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

Commitment

Batch 59,876, Merkle root 3d65f199869e783c707457c6d5bb500f9f063cadbd5f0c52fb8c59b2e05cf136. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 109e320291cc799c62ebd608d8f84b3cfb93bf1c961a1cf37bcf05077eb90bf8
2. b2a6cab9be187eac84d5fd369d4baf36def60e137223f348e41670c0d1a11e11

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.