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

bc6972347849ea60da9806b6889ea2b8fab61d3cc2e5d1601fcfcc57f78b2b80

Seed hash

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

Commitment

Batch 64,762, Merkle root 1de7eb3a482979f8168cd2ebdd6a0462bef0f9b1af865b9da9edb4704ff4985a. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 8e40e0b166f8ea7b58bfb7b0d8df32ce038bffddfbff62d766954d3dbdcfa9b2
2. ce7b167a1bcfbaefe5eacd28782b52a1412033452b3ce168272e619401ed1b15

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.