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

20fbb988cd3e9081b503f5e8cb7f4321092518eea1bd8aa2d1e607c8a3441c8d

Seed hash

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

Commitment

Batch 61,078, Merkle root 8bb4016c346402a062b50be4c48fb250f3dd3f8cae126df68e191d8a81790986. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 38b14821aff28bffdf016a3968a5711b9d13904a259604296ed2c12d86f707fe
2. 128cdf060847a818964e020b45ee3aff8d5a09a67edc30fad6ad50f821f6df3a

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.