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

942dd8e6f1bc5f16c4ae7f0c7af11b406a86d8c35b43dfec3ff282d694dfaa54

Seed hash

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

Commitment

Batch 60,842, Merkle root ba7dd6185b84a4db6cc37cf22d5fc5099329413e9fb52012a15ce75fe7b88e3b. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. df5b1465be945327949c3c6c31abd27458f7b898fb1c00e735936f2d624254bf
2. cadad0131a744d80456d136f69c507662975d105d59b51ebfab7d1854ff8c61c

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.