The Periodic Stack of State
Structure is the controller.
Every running system holds state. A state machine, an entity-component system, a simulation engine, an operating system, an agent orchestrator — each is a particular shape of running state. Nine axes describe the shape. Position predicts what the system can do, and what it cannot.
c = ⟨ F, K, C, I, R, A, T, V, τ ⟩
The cell coordinate · nine axes, one tuple
The thesis
Position predicts behavior.
A periodic structure earns its name when where a thing sits tells you how it behaves. For state, the dimensions are the formalism it is held in, how it composes, how it advances, where its boundary is, what triggers a step, what the machine knows of itself, what each transition costs, what can be checked about it, and how long it lives.
Read across the coordinate and the system explains itself — what it can express, what it can verify, what survives a restart, what it pays per transition in joules. The same map covers a finite-state machine, a hierarchical statechart, an entity-component system, an actor supervision tree, a Petri net, a DEVS simulation, a behavior tree, an operating-system kernel, a TLA⁺ specification, and an agent orchestration graph.
The map is a way of seeing, not a verdict. It classifies what runs, makes the structure of the design space legible, and lets a system be reasoned about before it is built — the same move the sibling stacks make for computation, information, synthesis, and data.
The design space
Nine axes describe a running system.
Two are shared with the sibling stacks — T inherits from the compute stack, V is shared with synthesis and data. The other seven are state-specific.
Formalism
01 · THE KIND OF MACHINEThe formal model the state is held in.
Composition
02 · HOW STATES COMBINEHow simple states assemble into larger ones.
Concurrency
03 · HOW TRANSITIONS RUNHow transitions advance in time.
Isolation
04 · WHERE THE BOUNDARY ISThe boundary around state.
Reactivity
05 · WHAT DRIVES THE STEPWhat causes the system to advance.
Self-reference
06 · WHAT THE MACHINE KNOWS OF ITSELFWhether the running system can see and change its own structure.
Thermodynamic class
07 · LANDAUER FLOORThe cost floor of a transition, inherited from the Periodic Stack of Computation.
Verifiability
08 · WHAT CAN BE CHECKEDThe kind of guarantee a transition carries.
Lifetime
09 · HOW LONG IT HOLDSHow long the state lives, and what it survives.
The coordinate space
The addressable map.
The product of the axis cardinalities is the discrete coordinate space. Structural constraints prune it to an admissible remainder on which every running system has a place.
10 · 5 · 5 · 5 · 4 · 4 · 4 · 5 · 5 = 2,000,000
Discrete cell count · the addressable map of state-space
discrete cells
orthogonal axes
compute primitives below
Companion stacks
One method, applied across fields.
The same axes recur. T inherits from the compute stack. V is shared with the synthesis and data stacks. A primitive carries consistent coordinates across all of them.
Compute
258 primitives, 33 families.
Synthesis
The seven-axis synthesizer stack.
Data
The ten-axis data-system stack.
Communication
The eleven-axis channel stack.
Memory
The eleven-axis retention stack.
Knowledge
Seven axes · the object the others handle.
Agent
Four axes · the actor and selection.
Stack
The overview · three names, one substrate.
Verify
Seven axes · joules per verified output.
OpenIE
The parent thesis.