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

ccf6e0f99f0e7e9b60dc7ccaad916c9c70d11bca7aa07f6d2074cfa0211afd00

Seed hash

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

Commitment

Batch 53,108, Merkle root 532e24f3a4b7109f13b853f7ee8bfddc17f1245b3d9fb8e55c07bbe7d28c308b. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. bc8dcad8c23c44a8f85a6ca60073c145f2dbfc73a0e09799b452710d0e249d14
2. 04c02388bfba52b0678b0583fb81f4976687ead3a8bbc9d07788ef91c86428bf

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.