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

0cede4726fe26422c0a67fa8aa5bde777b3419e7b187d4d37bc5ef7432a68ad2

Seed hash

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

Commitment

Batch 59,130, Merkle root 3f7f3567526d21af44cc82b7ee99f85f00e4abc5f453b79ddd340ce542b8ecda. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 500701cecf2bc80a923b5baf6a15fcfbcc0564555ed02c980d9ee47c474007b4
2. 5d25ba5b59d18c1c1384bcdc67f1ec748e2ea781605bab8f5667ef10a31927b6

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.