{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"Web3 Tech Brief By HackerNoon","title":"Can chess moves be verified on-chain? — The answer is zero-knowledge proofs","html":"","width":"100%","height":180,"duration":554,"description":"\n This story was originally published on HackerNoon at: https://hackernoon.com/can-chess-moves-be-verified-on-chain-the-answer-is-zero-knowledge-proofs.\nzkautochess, ZeroKing, and a zkEmail referee prove chess moves were legal on-chain. None of them can catch a player consulting Stockfish.\nCheck more stories related to web3 at: https://hackernoon.com/c/web3.\n You can also check exclusive content about #zero-knowledge-proofs, #web3, #chess, #gaming, #decentralization, #cryptography, #future-of-nfts, #applied-cryptography, and more.\nThis story was written by: @sriram-ramakrishnan. Learn more about this writer by checking @sriram-ramakrishnan's about page,\n and for more stories, please visit hackernoon.com.\nZero-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.","thumbnail_url":"https://img.transistorcdn.com/eO2Jn0gxT_H9qDuuD0uleszE2n40sbZ-1T2r0zOcj9c/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQxMTY4LzE2ODMz/MTU4ODQtYXJ0d29y/ay5qcGc.webp","thumbnail_width":300,"thumbnail_height":300}