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

8ee7f592c10a2dbd47f5fdb0e12d16b99107d46988493b473e7f7683e07c7e79

Seed hash

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

Commitment

Batch 50,222, Merkle root e65bbfdff22336b66b85709526465f361906d8eb06df4e89d910d254b9dcd7af. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. e4f75526882e634002477e9d1716fb95f12b2bfd706508cbe17a6665f1ce7a18
2. d2a571894c31597a5d6da06ea95bbb9173a339e12a289f0e04fd5e3e0b130a28

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.