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

1692457a6b8dc74437bfccb6f16caaad85215ba878d60a953e6fb01290739975

Seed hash

dbdef5275f97ee8bbe671474c45cbe09424e77af342f66eed402154bf17e6abd = 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. 480856b46dcaacc1579e8aa0b77cc61a6b1ed673ed45fb7c4afab5817939dad7
2. adb774ec64336ce3d4de5c2ea9effa05623937617c32e9f94952d3916c172cdc
3. c4fddbd5ebfaa6cda76ea9205b769fe91755b45a011253ccbfad37b2c2734d97
4. 663ca3fde6507ff1dce4d8bc43e28195028e18ccb6f39de43e0f38e460e9a9b7
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.