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

8da9a7171a847f9254fb108ba0d4db3edd0cf6599ff09c5ce7e33a9f14a13053

Seed hash

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

Commitment

Batch 50,373, Merkle root 17c7e90eef45776adf4cbb5bd0566f3be0f6dd5ae17827871cd7cc282d5888e1. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. d47d46533e5edf152b516f9d71ed08131b480255378754d76a16600ee21a12d1
2. 20ea1184a819da2b1a442a10cb2ab68ae05a4d2365d5fbe36319061de7895051

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.