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

af76b51f9f93f5e8654dbe1bf1c476eea5333d5a86a9f0e5639dd8138aa9e7e9

Seed hash

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

Commitment

Batch 49,047, Merkle root a9910d8a19f96fe338a74ee506cc54cfbfcccc15644c07360469ae80be6a54eb. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 6b833ddc984c19320607fb7ef86797c7983af59e389c438c87c36278d2bf94b3
2. 3eb41243c7fc91508ed4c610d719248f0cf6fd3e9d3a2368bdf058085b61ae24

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.