-
The Category Settle
Settlement networks form a free symmetric monoidal category — the category of all settlement networks built from the same primitives. Open Petri nets make composition, throughput, and conservation laws compositional.
-
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.
-
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.
-
JSON-LD as Declarative Infrastructure
Why JSON-LD's purely declarative semantics and monotonic schema expansion make it reliable infrastructure for composable systems.
-
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.
-
Revisiting the Flows
Reflecting on old ideas with new tools — from Petri nets to proofs, from Bash scripts to composable universes.