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

f06e761ba7aae1fb475be8543bfc4a785f03d22a5d0f9915d0e01e71e1f391a4

Seed hash

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

Commitment

Batch 73,032, Merkle root 56d6d3868a9a542679bb97c83a125793d2508b5295700ab6d41337d413389272. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. ac576c75aaf4ca653910fe1b90853f2fe234ffec4253b6410fe2b3c916af4a92
2. d1de18e00d38962ad3ae00292c94db4678cc40a7a6b1e48537b96b3f99cf1099

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.