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

5800f21542b60a0bb3b9ff637aedfeb55e8395109cdcbfe1099964af668496c2

Seed hash

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

Commitment

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

Merkle path

1. f1e114cb60e83c891ef69d5872f7b5de9cb14f230d9879598d1fb58518a4392e
2. 9a0b880bdb3e9fbcdde9f4a1ffba4b944984920ae56409877a5907a913aaf0a1

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.