Can chess moves be verified on-chain? — The answer is zero-knowledge proofs

This story was originally published on HackerNoon at: https://hackernoon.com/can-chess-moves-be-verified-on-chain-the-answer-is-zero-knowledge-proofs.
zkautochess, ZeroKing, and a zkEmail referee prove chess moves were legal on-chain. None of them can catch a player consulting Stockfish.
Check more stories related to web3 at: https://hackernoon.com/c/web3. You can also check exclusive content about #zero-knowledge-proofs, #web3, #chess, #gaming, #decentralization, #cryptography, #future-of-nfts, #applied-cryptography, and more.

This story was written by: @sriram-ramakrishnan. Learn more about this writer by checking @sriram-ramakrishnan's about page, and for more stories, please visit hackernoon.com.

Zero-knowledge proofs let you prove a chess move was legal, or that a game ended in checkmate, without revealing the moves themselves. A small cluster of hackathon projects and research efforts — zkautochess, a Mina-based build called ZeroKing, a play-by-email "zkChess" referee, and general-purpose frameworks like ZkNoid — have actually built versions of this. It's a genuinely interesting corner of applied cryptography. It's also worth being honest about what it doesn't solve: proving circuits are expensive, chess has a large rule surface, and no proof can stop someone from quietly consulting an engine before typing a move in.