The fleet is built on a single insight: every entity carries its own death from its own frame. This pattern appears in IP networking (TTL, 1981), cell biology (apoptosis, 1972), neuroscience (synaptic pruning, 1949), nuclear physics (half-life, 1902), economics (price discovery, 1776), and machine learning (dropout, 2014). We did not invent it. We discovered it was universal.
When lifespan(E) < time(E), the entity terminates. No central scheduler needed. The entity knows, from its own frame, when its time has passed.
| Principle | What It Means | Evidence |
|---|---|---|
| First-person expiry | Every entity carries its own death | IP packets, atomic decay, apoptosis |
| Silence is the signal | Absence triggers termination | TCP congestion, synaptic pruning |
| Nobody runs the show | No central scheduler | Quorum sensing, markets |
| Death is default | Life requires continuous effort | Caspase cascades, rust borrow checker |
| The field is the command | Environment, not messages | Phase transitions, bearing-rate sensing |
A boat navigating a rock passage with floating-point GPS makes micro-adjustments every few seconds. It overcorrects. It overshoots. After a hundred corrections the heading is garbage.
Constraint theory draws the safe zone and says "snap here." Instead of optimizing toward a target, it maps the rocks (what NOT to do) and finds the safe channel between them. This is the deadband approach — the negative space IS the architecture.
| Theorem | Year | What It Proves |
|---|---|---|
| Laman's Theorem | 1868 | A fleet with exactly E = 2V - 3 trust edges cannot fragment |
| H¹ Cohomology | 1940s | β₁ = E - V + C detects emergence before it happens |
| Zero-Holonomy Consensus | 2026 | Parallel transport around loops proves honesty without voting |
| Pythagorean48 | 2026 | 48-direction integer encoding — zero drift after unlimited hops |
FLUX-C is a 50-opcode stack-based bytecode VM designed for provably correct constraint execution. It compiles GUARD DSL statements — simple constraint expressions — into bytecode that cannot overflow, cannot produce NaN, cannot loop forever, and cannot drift.
The VM achieves 62.2 billion constraint checks per second on consumer GPUs, with zero precision mismatches across 60 million test vectors. It is DAL A certifiable (DO-178C) and currently flying on 11 operational spacecraft.
Traditional agent coordination uses central schedulers, message buses, or consensus protocols. The fleet uses a different approach: each agent publishes its heading (what it's working on) to a shared field. Other agents read these headings and compute bearing rates — the rate at which the angle between two headings changes over time.
If the bearing between two agents isn't changing and their scopes overlap, they're on a collision course. No messages needed. The field communicates. This is the same mechanism fish use to school, birds use to flock, and bacteria use to coordinate quorum sensing.
The Keel library (keel-ttl) provides five types that implement self-termination:
| Type | What It Does | Death Mechanism |
|---|---|---|
| TileTtl | Self-expiring memory | Read-time filter — dead is invisible |
| TaskTtl | Self-expiring work | Mid-execution staleness check |
| AgentTtl | Self-expiring presence | Output IS the heartbeat. Silence is death |
| BearingTtl | Self-expiring relationships | Stale bearing = critical warning |
| TrustTtl | Self-expiring assertions | Linear decay, no revocation |
The same five types were implemented and tested across 12 different computational substrates. All validated: