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

0f0e2c703483ab966f30c07fa73457e2102130060f24ce8e65e7537cb2f26a48

Seed hash

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

Commitment

Batch 64,255, Merkle root 4dafc5c5ee024ca059085082295261598807ea60f3344abe6b45fcb181fa0d55. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. be998f979438583cae7b116da92de4b1143b3fd648bca317835b1b4c88c4aecc
2. 43501b29cef2f43b02acc8d0203e9f1a4f2eede409ccc2abf8532dcd686326e1

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.