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

7f1ea38f102553b8d7954174d6a4e41776bafbc3e7ef9c5aebfb9addd4200622

Seed hash

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

Commitment

Batch 73,475, Merkle root bc05af77000b5da738eb7d6e24c40b7a38936a9dbebcb0b2a66e7232875b5dca. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 9181da071affce65f91d72198168c8385bfe4730e78178e641c74f53c0a3fde7
2. b5f179d13457b4c8aa68f57f137604b3220f6a44886692f89666bb54c1fb46ed

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.