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

d8eff03e8c5a37118119243747aeacc6e85c6f6e2d7d750e03e07ae4ca2cff24

Seed hash

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

Commitment

Batch 69,967, Merkle root 69554322d8bb91effb76783f0e5c50e825c3a0b3875fd93a6d68717cb91e60cc. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree

Merkle path

1. 612a2d07c5d5448a981f0620af604c2017399a5f1eda0025b541ec8c596c113d
2. 09a915827266086dfa3b416a641a24b5a03f75859f504eadb1fbe95e37beb145

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.