Intermediate

These examples are mostly puzzles where the circuit verifies a solution, instead of finding it:

• Sudoku is the classic zero-knowledge example.
• Two Sum verifies the answer to the famous LeetCode problem.
• N-Queens verifies a placement of queens on a chessboard.
• Fixed-Point Arithmetic computes with fractions, as needed for zkML.