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

da95f535f1f4dc64e9a02e12a86cfe3ae1dbc6edfea62929489c48c982b8f4f2

Seed hash

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

Commitment

Batch 58,466, Merkle root 40d0de34c0e457e5dcd31927a8714eca97196bb2e9e2fa9ca9f0fae51e4e0a82. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 24843cb5063c341f3fca6be42c76fcfd3dc570d3976cc6c0515e27a0e4143eb6
2. f43b0eb8c4fe288a6a2843a602f9a8420b4fa30d33201e3f9e3e7a25640d2b35

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.