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

64a4ecdf81e05df9e335c988c145bd31ad5b1a11b696951ccd2bde1de6a23dc9

Seed hash

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

Commitment

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

Merkle path

1. 185cc908fcc9d3ecf769b0841e713789f2b18c5c784162f600df6fbc1629ded4
2. 5b684ce1329211fa3bf3bb1641680827b5c5e467efd2674466430eee8951c41e

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.