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

b28e7b36857fd8890f8ba915c9b782896025ff35a32a8d4b25e794d5559962c6

Seed hash

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

Commitment

Batch 56,747, Merkle root 68a702ea8ab23e901bad94a212d677e269f6f05c3416c17d691f45851abdcbd9. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 34f0c1d71404c915a0ff6b9f308f7f0d50582329a92fb4550ad6acb95d15161d
2. 984eb7d14fc6f2c6c43e6562885b441e19147a72a1f828c36dcf820053f45f53

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.