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

dc3f0608df014a5976034a4ad18e6515e94e8b4c4c18aef3e4db6b125124fc5e

Seed hash

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

Commitment

Batch 47,612, Merkle root 6ae716a3fb852b2e0160a1d813e5092f4771e5758ed3a4f6be25972587238882. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 0d5dbdc15359f02a4e7f8c5ea3a958408f1356b098aeb19c760acf81a022c1c0
2. 23e83a1526edabcd75536eac5026ba0523fcf615c250e3f10ad946c961c94b65

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.