-
Bitwrap: Petri Nets as ZK Containers
From OP_RETURN in 2014 to zero-knowledge Petri nets in 2026 — bitwrap compiles one Petri-net schema into Groth16 circuits, a Solidity contract with Foundry tests, and a content-addressed model, and this post links the code for each and says where the generated outputs still disagree.
-
Earned Compression
ODE simulation, tropical analysis and zero-knowledge proofs each draw a line between a Petri net's core and its observer. Where the three agree on tic-tac-toe, why the agreement follows from one definition, and where the code does not yet match the theorem.
-
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.