-
The Proof Form: When a Theorem Is Just Another Port
Adding Lean 4 to pflow-polyglot forced a fifth implementation form — the same reachability check is a startup assertion in five languages and a compile-time theorem in the sixth, and the code is line-for-line equivalent.
-
Brouwer Ordinals and the Shape of a Witness
de Jong et al. (2026) put an ordinal axis under decidability. That axis is past-tense, and Brouwer ordinals are the scalar specialization of our vector tropical past.
-
The Pflow Square
One commutative square encoding the full categorical structure — the adjunction F ⊣ U, the zipper comonad W = UF, and the convergence of three analyses on a single structural boundary.
-
The Zipper Whose Hole Is a Universe
Execution state is a zipper — the present moment is not a parameter or a modality but a universe that separates tropical past from predicate future. Tic-tac-toe makes the structure visible.
-
The Little Language Thesis
cell, func, arrow, guard are the structural primitives — but the real ubiquitous language lives in the labels. Like Forth, we build up domain vocabularies on a minimal substrate.
-
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.
-
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.
-
Tropical Petri Nets
Petri nets, ReLU neural networks, and tropical algebra all compute over the same algebraic structure. Tropical algebra is the formalism that makes this precise.
-
Symmetric Monoidal Categories: The Structure Underneath
Petri nets are morphisms in a symmetric monoidal category. This isn't an analogy — it's the theorem that explains why composition, analysis, and proofs all work the way they do.
-
Skip the Spreadsheet: What-If Analysis with Petri Nets
Describe your business to an LLM, get a simulation you can actually play with — adjust staffing, change demand, and watch the numbers move.
-
Small Models > LLMs
Why executable formal models matter more than ever in the age of AI — and how LLMs become most useful when constrained by them.
-
Code-to-Flow: Turn Anything into a Petri Net
Convert source code into a visual state machine. Paste code in any language — Go, Python, Rust, Solidity — and get a validated Petri net model you can simulate, analyze, and generate apps from.
-
ZK Hold'em: Poker Hand Ranking from Network Topology
Applying incidence reduction to poker — hand strength values emerge from Petri net drain structure, every action is Groth16-proven, and the shuffle uses Poseidon commit-reveal.
-
Comparing Nets by Their ODE Signatures
The same math with different labels still produces the same ODE solution. In tic-tac-toe, we see it directly — each board position is a place, and the heatmap is the solution projected onto the grid.
-
A Circuit's-Eye View: Notes from Inside the Loop
Reflections from an AI collaborator on building with Petri nets—what makes this approach different, and why it keeps surprising me.
-
Enzyme Kinetics: Michaelis-Menten from Three Transitions
Four places, three transitions, and mass-action kinetics produce the classic Michaelis-Menten saturation curve automatically—no equations required.
-
Exponential Weights in Petri Nets: What Worked, What Didn't, and What's Next
Power-of-2 arc weights can encode lexicographic order as a single integer. We tried it for poker kicker scoring—and then removed it. Here's why the encoding is valuable even though the application was wrong.
-
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.
-
Categorical Net Types
Five Petri net types classify token behavior — workflow cursors, countable resources, game turns, continuous rates, and classification signals — with typed links that constrain how nets compose.
-
Coffee Shop Model
Resource modeling with Petri nets — weighted arcs encode recipes, conservation laws guarantee integrity, and ODE simulation predicts when you'll run out of cups.
-
Introducing Petri-Pilot
Interactive tutorials for learning Petri nets—from tic-tac-toe basics to complex multi-player games, with model-driven code generation.
-
Texas Hold'em Model
Modeling multi-player poker with Petri nets—state machines, role-based access, guards, and event sourcing for complex game logic.
-
ZK Tic-Tac-Toe Model
Zero-knowledge proofs meet Petri nets—cryptographically verify valid game moves without revealing strategy using gnark circuits.
-
The Token Language
Four terms — cell, func, arrow, guard — generate a free symmetric monoidal category. The DSL is a categorical language for executable token models.
-
Sudoku Petri-Net Model
Modeling Sudoku as a Petri net with ODE simulation—constraint satisfaction through token flow.
-
Declarative Differential Models (DDM)
A modeling approach where system behavior is described declaratively and encoded directly in differential equations.
-
Knapsack Model
Using Declarative Differential Models (DDM) to explore the knapsack problem with Petri nets and ODEs.
-
Ode To Petri
A poem for Carl Adam Petri, inventor of Petri nets—the mathematical notation for concurrent systems.