The project introduces a versatile recursive framework designed for turn-based games on the Mina blockchain. A demonstration featuring the game tic-tac-toe showcases the practical application of this scheme, illustrating its adaptability to games such as checkers, chess, battleships, and more. Notably, this marks the inaugural o1js application incorporating lookup tables. Development Process In this turn-based game structure, each move is presented as a proof. Players follow a two-step process: they initially validate the opponent’s move by verifying its proof, and subsequently, they execute their own move. These paired steps are then collectively proven, and the resulting proof is transmitted to the opponent. This iterative process continues until a conclusive state is attained, such as a player securing victory or a draw occurring. The recursive scheme captures all turns played in the final proof, which is subsequently verified on-chain to determine the game’s winner. The included tic-tac-toe demo employs lookup tables to confirm that the board’s final state, whether a win or draw, aligns with a precommitted table encompassing all potential win and draw states. This application marks the pioneering use of lookup tables on o1js, a feature not native to the platform but exposed through the following PR: https://github.com/o1-labs/o1js/pull/1253 Click here to visit the GitHub page > More info >