-
Bitwrap: Petri Nets as ZK Containers
From OP_RETURN in 2014 to zero-knowledge Petri nets in 2026 — how bitwrap.io became the capstone for a decade of work on formal state machines, cryptographic proofs, and executable specifications.
-
Earned Compression
Three independent formalisms — ODE simulation, tropical analysis, and zero-knowledge proof — discover the same structural boundary in a Petri net. The convergence is the proof that the boundary is real.
-
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.