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

0455e3ec03686da134e37993286ef499ed237d3cb7edc1cb97f424254e191d39

Seed hash

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

Commitment

Batch 64,792, Merkle root d0bb2bf22b04a7964a53a8904b227f589fb0ab5ca7e22dbc91bf51d0bcd6fade. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 24d68b2dab7642ec3404ff81b0eead3b36054f542b51aa06b181607911863af5
2. d9912fd8a840388750ec9cd5970ab37871b8bdc2544c39dac058d2fbdf45251d
3. b2d0ab49d6ae29b41267e3894809f3b17bd3a7e438d32b5747f1762775477017
4. 4b60c636b5f20f574ba55f39f5f8f10b747e337840af078054d011ef2d0402ab
5. 0e56c2ba6f7da108d8ce08fe14caf94f443124392e8800c5c895d8d7a59c12ef
6. 49bb44bf07e544ab382e2170722ecbeefafa92a7dab49e9db108e77fcff410ba

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.