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

7a50b5c78cb80d4dd4a857013be55ddd432a68f6a6d215ead21e0813d715bd49

Seed hash

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

Commitment

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

Merkle path

1. d0d04ba5f88c72219881c11d57c7ba62a5e42700f7cda5ceda3627f86d75c00c
2. 8b917152e154699fca0afe4fb2d5b44db8f5221b8b9843c2de2768c728a4e42d

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.