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

017ed1234554f0ed2361039dea0696ee504d388300628a2805c44c6ec29a0873

Seed hash

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

Commitment

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

Merkle path

1. 657c8f76ca27adb903ea21392ea8a44d76efdd4d1bf105a42e27bbaf3c59d188
2. d5935ca04287e4e0875739c4b2b4855b539ffe3407b9df65a16e8bc53b6b5316
3. d2a49e09b619cd5e1d155f2c0a614044e74b8d32c56919119c28c0e833baa051
4. 1609cfab568f290c95f41f37fe8489816843df9a0e2799acf28b43fe92bf8038
5. 7e9821e4ca365514531bac92b08bac237f35d9fffe9e73e888d026d11049fd02

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.