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

1ef6f8409e3ca77a8613a2ebda4a7a214abe505db3fc4c0a7677b16e0eb2f904

Seed hash

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

Commitment

Batch 72,769, Merkle root 0d4ffc46fd6c09d50a6a5a506110d079bca1a0d0a1f0017c61b9337a0eed61c2. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree

Merkle path

1. dd6ff5d11ff2363fa4ee9bc6b90a920f4f0bca08424c6fb0ba9ad7e3ba14de9d
2. c4dcd8e3f9ec7c296936ad98a5589a980216c5281bccab5f06c0dd50b7f72121

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.