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

be030ec0a9c4dc8f8f3a42dd1ea200cb9fecc1eb8e46fdd85e5ed49b539aebc6

Seed hash

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

Commitment

Batch 47,443, Merkle root dbce3aa7a312ea614caf922384861dcae49cb625f7e1424cb7e74cb05f843d44. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. f6a45782adf499de35b9c9f61c607397fc71a6796b2dade89d7233385df13716
2. aec1f9148707fc8918784a99bb2125e8e7546b0620a24cc8b3fbe07ac892031f

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.