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

9be59ec523dc9019b6c41c1c9f8da239c8e39cff9d7da6eb4995c02fd20332e4

Seed hash

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

Commitment

Batch 54,796, Merkle root 42e7e5cb5058a09823738e66cc07e4436d61ddd9f9b1c9adc5e918f2d5670979. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 28c3294ed8b7b68da7e812693a1b1e0d8b82bb7298513141a06b3f57807ac9fb
2. 4820a98679f018c64eb9b57dd0d29ecb9f9a197191b1165b4b0b3e119d8acf48

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.