-
Building ZK Poker: Four Petri Nets and a Branchless Circuit
A technical deep dive into heads-up hold'em at stackedup.gg — how four cooperating Petri nets replace imperative game logic, a commit-reveal protocol ensures fair shuffles, and a branchless Groth16 circuit proves hand strength without revealing cards.
-
ZK Polls: Voting as a Visible State Machine
Anonymous voting where anyone can see the rules — built from a diagram with four circles and three arrows.
-
Zero-Knowledge Proofs for Petri Nets
How gnark circuits prove that a Petri net transition is valid without revealing the state—MiMC hashing, topology-based constraints, and Groth16 proofs.
-
ZK Tic-Tac-Toe Model
Zero-knowledge proofs meet Petri nets—cryptographically verify valid game moves without revealing strategy using gnark circuits.