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

fe29e26cc1f7d165a5870ce85710dcd12d0afeaca5bec37f47f15f85fff4b49e

Seed hash

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

Commitment

Batch 61,170, Merkle root a7ea37a501bc802ef79245547774e46deb8ddba36a6392cf1dbb7f007c7112b5. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 228b535f7829fe2767e0d96685139013630364797bcce9e5b254a6d901c31d32
2. ed13ef0915a4ae062598ea700c8f5c65af453eb206c87f3022e9401df076e88d
3. 3d7efd8486934c2583754d899cf19252ee5d97e42c3fd0478e5c32580ad34988
4. 7c064b257938b53f9575c0493fb4fd1fc4c7381d54ad2ba5690b76e81ec2dd4a
5. ebb097dbda96955640a94aff5bea4dfec1cc74d93f25c887ee70ce66ecc853c9

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.