Result
Chess v1
finished entry 1 play · winner takes 2 play · 50e33232d5019ee5992e438b97a795e2
- e054e6…b9cfSeat 1+1
- gbbSeat 2-1
Results
settlede054e6…b9cf+1 play
gbb-1 play
Replay
← → step · space play · Home End · f full screenMoves so far
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.
Checked in your browser
Checking- Seed
8049a4fd5f4a2a31afe60f39b4b54205a2af3e4d70ba8299ae459a04b585b2ec- Seed hash
70e984f02a41150c503d475a2f937feb8ddd520659496fcb18d7117aee482934= SHA-256 of"degen.match.seed.v1", a zero byte, and the 32 seed bytes. Checked: it matches.- Commitment
- Batch 67,905, Merkle root
9972fe1eb6880dad9fcefbeab7ae8fa5ebff670795b96cc0ab629ace218ee9d4. Recorded by Degen Protocol; on-chain publication is not available yet. See this batch and its Merkle tree - Merkle path
64ab7e5c76a899e9e05666feebc7601507b170f6553d812d3b529ccd821b8a1016d3df69f77a29495775801aca096614df14dd7373b02644ad951e1201da7a9c981b4f6831f7124ed92c10aab12347091fe880fc6131821fcacdac7e0c3080b79725beaf686438d46fedd849b25075e420667ab72a2766a84a3c4f8ea2ee743f
- Checked: the seed hash proves into the root.
To check it yourself, take the replay JSON:
- Hash the seed as above and compare it with the seed hash.
- 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.
- Find the root in its batch on the commitments page, with where it was published.
- Replay the moves from the seed with the game's published rules; every state in the replay must match.
Every move
| # | Seat | Action | |
|---|---|---|---|
| 0 | 2 | "timeout" | timed out |