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

4da5bc25eae3ae93a7bc89cb66b94bd82e5e42794fc06f95f054b12a4b24a875

Seed hash

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

Commitment

Batch 54,445, Merkle root 117d72903816f8888fdbe0a46076761fc23b49c46ce56e3a13e8a5d99bb2de01. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 80c9bc11436c87ec07b2f27a000e3c40032869cd1849fb100cf87bd115023bbe
2. e673728bf0b6bbac4d1b05e74c1c0057ee694534956a4b1f8cda474eb336e08d

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.