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

b63abd69e4eab6bb34c16e2d69b75ec572a8c9b09dcfdfb4793b903958e78dd9

Seed hash

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

Commitment

Batch 68,389, Merkle root 6039a4c60794e09e04abae6a456734d8814a6f5eb78b7c8f1dd39456d7e478bb. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree

Merkle path

1. e488a5289ae968777aa60143b50ca7bfa359da0afec0ec3ffd792e344a6133a3
2. 5e8785d28c21024da8e6a0a86d259e59865fa79a7160a6b110152fc79f16b605

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.