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

f7d0bf942af6df0c9a0253356b71a8426a967ca276a129db85a7c745f7979f63

Seed hash

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

Commitment

Batch 58,856, Merkle root 607039acc445e1b1c8669a719bfee358e3ac45b326809df238633492ec2e74bd. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. abc99b7415b59f8639337eac42ada9f7d8cf42fd8afdcfd407a0cc92a031ec86
2. 0d55bbb13d09d3a1fe5b6a7cff531c86c285f9d8ae90f73d1294095d3df20a0a

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.