The foxo Papers · Vol. III

The Grid

A reference architecture for an autonomous operation — the machine that satisfies the two-flow physics of Volume I and the living dynamics of Volume II.
Author FoxSoft Published July 2026 Version 1.1 Series The foxo Papers License CC BY 4.0
Abstract

Volume I gave the governing physics of an autonomous operation — two flows, energy and information, regulated by a control plane with requisite variety. Volume II gave the organizing principles — a system that clears break-even can become self-producing, aim to scale like a city, and be shaped to gain from volatility. This volume gives the engineering: the grid, a reference architecture whose components compose to satisfy those principles. We derive a set of design requirements as a checklist from the first two volumes — flagging which are hard constraints, which are design choices, and which are hypotheses we are still measuring — then specify the machine that meets them: two planes — a control plane that governs and a fleet that works, mapped onto Beer's recursive Viable System Model; a bus that carries the information flow and doubles as the observability channel, holding coordination interfaces linear; an energy meter that keeps return-on-energy accountable through a dual realized/expected metric with confidence decay; a self-scaling agent lattice whose spawn-and-prune loop gives the operation its self-producing character; a durable, governed semantic memory meant to lift value-per-agent with history; a sense–decide–act–verify–escalate control loop with a self-pacing heartbeat and explicit execution guarantees; and strict per-tenant isolation with a scoped command path, letting one plane govern many operations without their complexities coupling. We describe the architecture, not the recipe. It is enough to build a governable operation — and enough to see why this shape, and not the "bag of agents," is the one we argue for.

How to read the claims in this paper
established peer-reviewed result.   model our definitional / derived model.   approximation an operational proxy, not an exact law.   hypothesis a foxo conjecture we hold as testable, not proven.

01From laws to a machine

The first two volumes were about what is true of an autonomous operation. This one is about what to build. The bridge is a set of design requirements that fall directly out of the earlier results — a specification any correct architecture must satisfy:

The grid is the artifact that meets R1–R6 simultaneously — some as constraints it enforces, some as targets it is measured against. The tags above carry through the paper: where a component's claim rests on a hypothesis rather than a proven property, we say so at the point of use. The rest of this paper walks the components and shows, for each, which requirement it discharges and how far that discharge is established.

02Two planes: govern and work

The grid separates the system that does the work from the system that governs it. The fleet is the working substance: a population of agents that act on the product and its channels. The control plane is the regulator: it senses the fleet, sets its objective, meters its energy, routes its information, and gates its irreversible actions. The separation need not be physical — a regulator can be co-located, hierarchical, or federated — but keeping governance logically distinct from execution is what makes observability, policy enforcement, and failure containment independently available even when individual workers fail. That independence is what lets the plane hold requisite variety over the fleet (R2) rather than drowning in it.

Both are organized by Beer's Viable System Model3 as a single recursion: sub-agents are the operational units (S1); the bus and scheduler coordinate them (S2); function leads exercise control (S3); research and forecasting agents scan the environment (S4); and the human — through the objective, the budget, the guardrails, and the escalation threshold — is policy and identity (S5). Each layer absorbs the variety at its level so the one above is not swamped. The recursion is what keeps the plane's job tractable as the fleet grows.

S5 · operator — objective · budget · guardrails · τ CONTROL PLANE observe (pulse) · meter energy (ρ) · route info · gate escalation ◂ ── the BUS · coordination + observability · C_bus ≥ H(D) ── ▸ THE FLEET · self-scaling agent lattice orch semantic memory (pgvector) energy ledger · ρ
Figure 1. The grid, in layers. The operator (S5) sets purpose; the control plane governs; the bus carries coordination and observability; the fleet works as a self-scaling lattice; memory and the energy ledger are the shared substrates. Each layer maps to a level of Beer's Viable System Model.

03The bus: one substrate for two jobs

The single most consequential component is the bus — a shared, structured workspace to which agents publish and from which they read, in the blackboard tradition11. It discharges two requirements at once. As a coordination fabric it replaces pairwise reconciliation with shared-state publication: each agent integrates once, with the bus, so the number of integration interfaces falls from O(N²) to O(N) — linear, the economical half of R5. This is a real gain but a bounded one: the message traffic does not drop for free, and a naive shared workspace where everyone reads everything simply floods each agent's context.11 Holding traffic near-linear — and pushing the infrastructure exponent genuinely below one — takes routing on top of the bus: topics and typed subscriptions, hierarchical aggregation, event summarization, idempotent consumption, and back-pressure. As the channel over which all state crosses, the bus is also the observability substrate: the control plane's model of the fleet — and the operator's pulse — is the bus read in aggregate, satisfying R2. The architecture thus has exactly one place to make coordination cheap and one place to make the system legible, and they are identical.

The bus is also where requisite variety is watched — not as a literal reading of Cbus ≥ H(D), which no one can measure directly, but through the observable proxies that stand in for it: channel utilization, event-latency tails, backlog age, dropped-event and schema-rejection rates, and the fraction of disturbances arriving with no matching response policy. When those cross threshold — publication rate approaching capacity, backlog aging — the plane sheds load (prune agents, batch events, raise abstraction) before congestion turns the operation from complicated back into complex. A saturating bus is the architectural signature of an operation aging from a city into a corporation.

04The energy meter: keeping ρ honest

R1 requires that energy be measured, and Volume I's dual metric is realized here as a running ledger. Cost in — tokens, GPU-seconds, tool and API calls, human-review time — is priced into one currency, metered per agent-run, and summed against the flux cap Φmax. Value out is the dual quantity of Volume I: realized revenue plus the time-derivative of a confidence-decayed pipeline expectation, reported as two ratios side by side,

(1)ρrealized = rev / Φ,    ρexpected = ( rev + d/dt Σ c0e−λΔτACV ) / Φ  model

so that the distance between what is proven and what is believed is always on the surface, and the confidence-decay term prevents a fleet from inflating ρexpected by hoarding stale pipeline (Vol. I). The pipeline term shown is the sales adapter; the ledger takes a domain-specific value function in its place — verified resolutions for support, accepted changes for engineering, validated findings for research — while the realized/expected split and the decay discipline stay fixed. Two honest cautions travel with ρrealized: rev should be incremental contribution margin against a baseline, not gross revenue, and Φ should be fully-loaded cost over the same window — otherwise the break-even at one is not meaningful. So bounded, the ledger is what turns "are we thriving?" from a matter of opinion into a matter of measurement — the north-star number R4 and R5 are ultimately optimizing.

05The agent lattice: self-scaling and bounded

The fleet is not a fixed roster but a lattice that produces and prunes itself, discharging R4. When work densifies in a region and surplus permits it — the (ρ−1)·Φ term of Volume II — the plane spawns agents there; when it thins, they retire. The topology is the VSM recursion: an orchestrator sets direction, function leads own the operating surfaces, agents do the work, and sub-agents handle bounded sub-tasks. Growth at the leaves never overwhelms governance at the root because each layer absorbs its own variety.

Every action passes the escalation gate of R3,

(2)act(a) ⇔ p(ok|a) ≥ τ ∧ reversible(a);   elsehuman  model

which is simultaneously the safety property and — as Volume II argued — the antifragile barbell: capped downside on the irreversible, open upside on a multitude of small reversible experiments. The lattice is thus free to be volatile in the small and safe in the large, provided "reversible" is defined strictly enough that a cheap local action cannot trigger an expensive external one.

06Memory: the compounding substrate — under governance

Value-per-agent that rises with history (the superlinear ambition of R5) requires that each agent's experience raise every other agent's capability. The grid provides this as a durable, semantically retrievable memory — outcomes, what worked and at what ρ, written to a common store and recalled by similarity. But Volume II's evidence is emphatic that this compounds only under governance: unfiltered shared memory underperformed even no shared memory in controlled tests, and shared stores exhibit real failure modes — reproducing past errors by similarity, leaking across tenants, and carrying adversarial content that survives summarization.10 The grid therefore treats memory as a governed store, not a bucket: every record carries provenance, tenant scope, a confidence, and a validity window; only validated outcomes are admitted; stale entries decay and contradictions are reconciled; retrieval is scoped and traced. This governance is not free — synchronous validation adds write latency — and that cost is the price of memory that compounds knowledge instead of noise. So governed, memory is the reason the grid's advantage can widen over time rather than resetting to the frontier model of the day: the model is rented and fungible; the curated, isolated memory of a specific operation is not.

Data · memory is an asset only when governed
Curated shared memory — agent task success71.0%
No shared memory (baseline)67.5%
Unfiltered "add-all" shared memory55.5%
Cross-tenant leak rate, semantic search, weak scoping (audit)43.9%
Experience-following study, arXiv:2505.16067 (2025); multi-tenant memory leakage audit, 2026. Curation beats no-memory; no-memory beats unfiltered — which is why provenance, validation, decay, and tenant scope are architectural, not optional.

07The control loop and its heartbeat

The plane runs a single loop: sense the bus (the pulse) → decide against the objective → act through the fleet → verify at each level → escalate the residual. The subtle part is cadence. A purely reactive loop stalls whenever nothing triggers it; a purely scheduled one wastes energy when nothing is happening. The grid uses a self-pacing heartbeat: a work-queue drained by a recurring tick that re-kicks stalled tasks and self-schedules its own next wake, tightening when the operation is busy and relaxing when it is calm. This is what converts a set of scheduled routines into a system that runs itself — the difference, in practice, between batch autonomy and a living operation. The operator sits outside the loop as S5, reading the pulse and intervening only at the escalation boundary.

Autonomy that acts on the world needs execution guarantees, and for an autonomous operation these are load-bearing, not implementation detail. A re-kicking heartbeat will retry, so every external action carries an idempotency key and side effects are journaled, giving at-least-once delivery without duplicate sends; actions that cannot be made idempotent are gated as irreversible under R3. Failures are contained with retry budgets, circuit breakers on flaky tools and providers, and a dead-letter queue for poison work, so one bad task cannot storm the fleet. Long-running work checkpoints so it resumes rather than restarts; a compensation path undoes partial multi-step actions; and an always-available operator kill switch halts the fleet and freezes the ledger. These are the mechanisms that make "verify at each level" more than a slogan when a step half-succeeds.

08Isolation: one plane, many operations

R6 is a precondition, not an optimization, and it is enforced in depth. At the data layer every row is scoped by tenant and access is mediated by row-level security, so that in the normal path a query on behalf of one operation does not return another's state. We resist calling this "structurally impossible": row-level security can be defeated by privileged roles, migration mistakes, or a leaky analytics pipeline, which is why isolation is enforced in layers rather than trusted to one control. Beneath the data layer, each operation's product and fleet can run on their own host, so even a total compromise of one need not perturb another.

The traffic between plane and operation runs on two scoped channels, and it is worth being exact here, because a plane that spawns agents, prunes them, re-kicks work, and gates actions plainly does reach into the operation — "observes all, reaches none" would be a contradiction. Instead: a telemetry channel carries pulse and events inward, operation → plane, over a one-way scoped credential; and a separate command channel carries only explicitly enumerated management actions outward, plane → operation, capability-limited, signed, replay-protected, audited, and for the most consequential actions approval-gated. No tenant has lateral reach into another; the plane has only the management capabilities each operation grants it. That is the honest version of the guarantee, and it is strong enough.

One host per operation is the strong-isolation reference, not a universal default: at hundreds or thousands of operations its idle cost and patching overhead argue for tiers — shared cluster with namespace isolation for low-risk work, dedicated database and workers for sensitive workloads, dedicated host or account for regulated ones. The requirement (R6) is containment of each operation's two flows; the topology that delivers it is a deployment choice.

CONTROL PLANE · the grid RLS by tenant · telemetry in · scoped command out push telemetry ▸ (one-way) operation Aown host · own DB operation Bown host · own DB operation Cown host · own DB
Figure 2. The multi-tenant reference deployment. Each operation runs on its own isolated host. Telemetry flows inward over a one-way scoped credential; management actions flow back only over a separate, capability-limited, audited command channel. No operation can reach another; the plane reaches each only through enumerated, scoped commands — isolation is the license to govern many at once.

09The operator surface

A human governs a complex system only through a legible surface, and the grid's surface is literal: a live view in which the operation is a place, its agents visible, its energy and information rendered as motion, its pipeline shown as value that brightens under attention and decays under neglect. The point of the surface is not decoration; it is requisite variety on the human side. An operator who can see the whole state at a glance, drill to a single agent's exact activity in two steps, and act only where the escalation boundary calls, has enough variety to steer a system far too complex to run by hand. The surface is where "complex underneath, complicated on top" stops being a slogan and becomes something a person can actually operate.

10What this paper deliberately omits

This is a reference architecture, and by intent it stops at the architecture. The shape — the two planes, the bus, the ledger, the lattice, the loop, the isolation — is what makes an operation governable, and it is described here openly because the ideas matter more shared than hoarded. The recipe — the specific prompts and policies that make agents effective, the tuned thresholds, the connectors, the accumulated operating memory of a particular business — is the craft that turns the architecture into a working operation, and it is not disclosed here. The distinction is deliberate: you can build a grid from this paper; you cannot copy a running operation from it. The moat was never the diagram.

11Conclusion

Across three volumes the argument has been a single one. An autonomous operation is best modelled as a system of two flows (Volume I); held above break-even, it can be built to produce itself, aim for increasing returns, and gain from volatility (Volume II); and the machine that pursues both is the grid — two planes, a bus, an energy ledger, a self-scaling lattice, a governed memory, a self-pacing loop with execution guarantees, and layered isolation, composed to satisfy six requirements drawn from the framework of the first two volumes. Some of those requirements are constraints the grid enforces; others are hypotheses it is engineered toward and must be measured against — and we have marked which are which rather than let a diagram imply more certainty than we have earned. It is a general architecture, not a bespoke one: bring a product, meet the requirements, and it runs — governed by one person watching a legible surface. Whether a given operation truly grows itself and metabolizes volatility into advantage is then an empirical question, answered on the ledger, not in this paper. That is what it means to put a product on the grid.

§References

  1. [1] FoxSoft. "The Complicated Agentic Matrix." The foxo Papers, Vol. I, 2026. (Two flows; ρ; requisite variety; the escalation boundary.)
  2. [2] FoxSoft. "Agentic Organizations that Live & Thrive." The foxo Papers, Vol. II, 2026. (Autopoiesis; city scaling; convexity; governed memory.)
  3. [3] S. Beer. Brain of the Firm, 1972; The Heart of Enterprise, 1979. (The Viable System Model; S1–S5.)
  4. [4] R. C. Conant and W. R. Ashby. "Every Good Regulator of a System Must Be a Model of That System." Int. J. Systems Science, 1970. H. Touchette and S. Lloyd, "Information-theoretic approach to the study of control systems," Physica A 331, 2004 (the rigorous requisite-variety bound).
  5. [10] G. Wang, et al. "Voyager." arXiv:2305.16291, 2023 (skill-library reuse compounds capability). On governed memory and its failure modes: arXiv:2505.16067, 2025, and 2025–26 multi-tenant memory-leakage / laundering audits.
  6. [11] L. D. Erman, et al. "The Hearsay-II Speech-Understanding System." ACM Computing Surveys, 1980. On the shared-workspace caveat (one blackboard floods agent context) and pub/sub routing: modern blackboard / event-bus multi-agent work, 2025.