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

107f02c799d3cdfbcd3298bf84a6fee1df6480128e660d9a8d6a122bc1ed4b11

Seed hash

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

Commitment

Batch 60,424, Merkle root b60a1e9592d8f4524f69a44b75d0d991c4bfd9955e50f4185fd33a718de1e679. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 4901bbd71b7d8167bb7f4d3964cc9c46910e31f94b67ae4f98f6c0f97c231d38
2. 39acf73ead6db898cfd6e42dfbca49eb7ee5e48eb6eeee6aac566a5159c188ec

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.