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

2f422eb8f2a67a3956c54a5df4e27d8fd5c0c24be59c6490683746d373a9bdf1

Seed hash

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

Commitment

Batch 68,261, Merkle root 451a11a36e3dfe4f8d489b78ffb112d7ada0ba80eca1e75d2b4ce1e72ee6477c. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree

Merkle path

1. 346f5f09dc7fc1d7931f41a9cffbeeee19b543a8dce9ddcb7afdb8e0cab5ac46
2. 4d543355e8490d8daa0d7c02d228f422e63196d52d12c80c0ab3fd1c32077814

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.