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

d37b478d48f47b0694db45df969027e0520f36f5fba3187a3d9c8ea990b945ac

Seed hash

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

Commitment

Batch 63,352, Merkle root 02e8591a4126493f3412f9909e8574308ba2fa0fed8af39ccec48ae32fe4d9b0. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 0c652553e232f641b8b6205535085d50b799df6b3eb0da10a993596d67dd15af
2. aaede4f1cbc8ad1d2f0bc320b2dddb232b4efb19fa62409e82e3cd8a12d38fd0
3. 70c9734b6bbf46141b1bf46162271f73834b4b81f1a2669bfa3a4f8313239166
4. 640d9b939cb3445a22919f6f6556200f071eb53006b86b83f9df006df82c3c88

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.