-
Building ZK Poker: Four Petri Nets and a Branchless Circuit
A technical deep dive into heads-up hold'em at stackedup.gg — four Petri nets (phase, hand classifier, bot decision, chip ledger) and what each one actually drives in the code, a commit-reveal shuffle for casino sessions, and a branchless Groth16 circuit that proves a hand's score without revealing the hole cards.
-
ZK Polls: Voting as a Visible State Machine
Anonymous polls in bitwrap-io: a small Petri net whose cast-vote transition carries a Groth16 proof of registry membership, nullifier and range — and what the current code does about secrecy after the poll closes.
-
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.