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

3c8c81caaa8a186188251cc31c8e95631a2593ed2ce0a37cdb50099f072dfd00

Seed hash

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

Commitment

Batch 52,655, Merkle root d5164bbfa91776fb790971b2be8acb5926f0db479f7f5d9c2d01b6a349f6f424. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 5271d811c30b9e33ba0327b429cd0e219ef9c4eea3aa5bd1f23d5eb5808ed9c7
2. 3d6c19276b4b540a9320beb64612c1be64179bee52c5d1be4428b6afecc5520a
3. a09babdb91602cb5c10dd771d7a1d35c7db066c3808c6fb0dbfb785fc7009f55
4. b1d506617b67d2fd4458914b06329b6a736e8f7421d6b01d08f5c68b63709ccf

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.