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

c5a315df19f0a077a4bdd70848b6781a7e75f057d21351a8dc9d8e764268fcd0

Seed hash

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

Commitment

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

Merkle path

1. aac14d63e4b2b1522398193e6bd55e181e817cb285dc0d1e58999e75f1da1db7
2. 567feb4358341955859f27660084af6f49fe0153be1bf7a1cdad69481c8f2da1

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.