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

32fcac9d7ccffe9a5d4b8cd2fb045405b6e6552fc05a9e5ba4a0120fe50fc5c3

Seed hash

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

Commitment

Batch 50,947, Merkle root 8af27a4207699a7b5bd70ca82cd55028afb2c196190e99b97456c4bda0133ab1. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. a64eaf0bd4c059d4159c2872144236937f1b0275c0382c49da4bfb0441c8a07e
2. a1c7067f8ba20789cae19a0a9bf58b2a9b4f36931e9e41446d16f77178990c5e

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.