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

7ad29ce320fe4b982b93e2cf9ed40dd3a2f4996c82509ce2e9fd1beaa4e4e6af

Seed hash

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

Commitment

Batch 55,920, Merkle root 6d39644895c22539d3289a16df1a45f86c63eb32747209d56090dba4e16b80d8. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 2e9aed86e31ef80e418b244614bd6a08f604ca4b7472a3d7a5d1824d00b88f0a
2. 25a51745229ee44112f534dd5c10daa0c38fc6a735a50770bea5105d075cc822

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.