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

bfc9f8828f40e861a28fb6d5a781b1bb44d330795a966c194e5d6c2f7bfe75c4

Seed hash

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

Commitment

Batch 73,015, Merkle root 9321914ea7601b10cbb355abe0f2eab51873a27c632429c8cf42ede49b140110. Recorded by Degen Protocol, not on a chain. See this batch and its Merkle tree

Merkle path

1. 08e0aeaf15430613431346e05e70d24d770f934f18160f998109c1674f56ef8a
2. d4ddce074c92dcf47e69bda6d902b1233aad76f9cc8e8dc1815b179bd2b32b81

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.