System Architecture
Neurotrophic Operating System — from signal to resolution
A deterministic, identity-free substrate that processes signals through a governed collapse pipeline. Every input either resolves to a unique fixed point or is vetoed. Nothing persists uncommitted. Nothing executes ungoverned. The design targets predictable behaviour under adversarial or high-variance conditions — replayable decisions, not best-effort filtering.
The system operates as a Neurotrophic OS — a substrate that maintains its own vitality, adapts its own structure, repairs its own faults, learns from its own history, and governs its own learning. External systems connect through certified adaptors.
System Layers
Every signal travels one path, top to bottom. External sources hit a physics-only perimeter; the Go Atom kernel dispatches; the TypeScript runtime runs the collapse chain; governance and topology bound what may change; the neurotrophic slow path observes without blocking.
flowchart TB
EXT["External World"] --> PERIM["Perimeter / Connector"]
PERIM --> ATOM["Atom kernel — Go"]
ATOM --> PIPE["Collapse pipeline α ν λ ρ ε"]
PIPE --> GOV["Governance G₀…G₄ + topology"]
GOV --> NEURO["Neurotrophic slow path A–E"]
NEURO -.->|"bounded feedback"| PIPE
PIPE --> ADP["Adaptors STABLE / VOLATILE"]
ADP --> EXT
classDef layer fill:#141820,stroke:#00B2FF,color:#e0e2e8
class EXT,PERIM,ATOM,PIPE,GOV,NEURO,ADP layer
Combined stack — the same irreversible traversal used by the Sovereign runtime
flowchart TB
subgraph EXT["External World"]
RT["Real-time streams"]
SIM["Simulation / test"]
HUM["Human overrides"]
DOM["Domain systems"]
end
subgraph BOUNDARY["Ingress — physics only"]
PERIM["Perimeter Engine"]
end
RT --> PERIM
SIM --> PERIM
HUM --> PERIM
DOM --> PERIM
PERIM -->|"admissible sparks"| CONN["Connector / Atom"]
classDef ext fill:#161920,stroke:#00B2FF,color:#e0e2e8
classDef gate fill:#1a2418,stroke:#48e662,color:#dfffe5
class EXT ext
class BOUNDARY,PERIM gate
flowchart LR
subgraph INGRESS["Connector"]
CONN["Connector Atom"]
IDBAN["13 forbidden fields stripped"]
end
subgraph ATOM["Atom kernel — Go"]
BOOT["Load doctrine"]
DISP["Dispatch · 7.05 ns/op"]
end
subgraph RUNTIME["Substrate — TypeScript"]
SUB["Spark · Accept · Route · React · Extinguish · Emit"]
end
CONN --> IDBAN --> BOOT --> DISP --> SUB
classDef go fill:#1a1f14,stroke:#48e662,color:#e0e2e8
classDef ts fill:#141820,stroke:#00B2FF,color:#e0e2e8
class ATOM,BOOT,DISP go
class RUNTIME,SUB ts
Identity-free ingress — 13 constitutional fields never enter the substrate (spec)
Collapse Pipeline
Spark through Emit — the same emit chain as Sovereign. Greek operators (ανλρε) name the irreversible transforms inside Accept–Extinguish. Each signal traverses once and exits as resolved output, governance proof, or structural veto.
flowchart LR
SPARK["Spark in"] --> ALPHA["α Admissibility"]
ALPHA -->|pass| NU["ν Validation"]
ALPHA -->|veto| V1["v₁…v₆ partition"]
NU --> LAM["λ Routing"]
LAM --> RHO["ρ Reaction"]
RHO --> EPS["ε Extinction"]
EPS --> EMIT["Emit proof"]
classDef pipe fill:#121820,stroke:#00B2FF,color:#e0e2e8
classDef veto fill:#2a1212,stroke:#FF5E00,color:#ffd8c8
class SPARK,ALPHA,NU,LAM,RHO,EPS,EMIT pipe
class V1 veto
Diagram above is the canonical path; hover each step for operator-level detail.
C² = C — collapse is a projection.
C¹⁻ ∄ — irreversible at every stage.
Vetoed signals are structurally impossible, not filtered or retried.
Exhaustive Veto Partition
Per the Collapse Algebra and Governance Veto Matrix: six classes partition every inadmissible input. No unclassified failures. Severity lattice v₅ ≻ v₁ ≻ v₄ ≻ v₃ ≻ v₂ ≻ v₆. Full definitions on the Glossary.
| v₁ | Axiom Violation — foundational law breach; collapse domain restriction |
| v₂ | Drift Introduction — would shift trajectory away from the fixed point φ̅ |
| v₃ | Identity Emergence — payload carries identity content (π ∩ ℕ ≠ ∅) |
| v₄ | Invariant Breach — would falsify a constitutional invariant |
| v₅ | Corruption Attempt — targets the constitutional layer directly |
| v₆ | Deployment Instability — would render deployment state inconsistent |
Governance Filtration
Constitutional layers. Each inherits constraints from below. Doctrine loaded at boot, immutable at runtime. No runtime self-modification of governance rules. G₀–G₄ here follows the SECS hierarchy (Principles → Algebra → SAC Axioms → Surface → Envelopes); the six veto classes above are the exhaustive partition at the admissibility gate, not a four-way summary.
flowchart TB
subgraph GOV["Governance filtration G₀ ⊆ G₁ ⊆ G₂ ⊆ G₃ ⊆ G₄"]
G0["G₀ Principles"] --> G1["G₁ Algebra"] --> G2["G₂ Axioms"] --> G3["G₃ Surface"] --> G4["G₄ Envelopes"]
end
subgraph SURFACES["Runtime surfaces"]
FROZEN["Constraint surface — FROZEN"]
MUTABLE["Adaptation surface — MUTABLE"]
end
subgraph TOPO["Topology seed graph"]
S1["Seed A"] <-->|"governed adjacency"| S2
S2 <-->|"governed adjacency"| S3["Seed C"]
end
G4 --> FROZEN
FROZEN -.->|"bounds"| MUTABLE
FROZEN --> TOPO
classDef gov fill:#1f1814,stroke:#FF5E00,color:#e0e2e8
classDef topo fill:#141820,stroke:#00B2FF,color:#e0e2e8
class GOV,G0,G1,G2,G3,G4,FROZEN gov
class MUTABLE,TOPO,S1,S2,S3 topo
Constraint Surface
- FROZEN — defines what is admissible
- Cannot be modified at runtime
- Loaded from doctrine at boot
Adaptation Surface
- MUTABLE within bounds
- Parameters the neurotrophic layer can modify
- Bounded by the constraint surface
Example: FROZEN — HOSTILE classifications require human override before release.
MUTABLE — anomalyThreshold may be tuned within adaptor bounds, not bypassed.
Neurotrophic Layer — Governed Adaptation Live Jun 2026
The neurotrophic layer sits above the fast path and observes its output. It never interrupts the fast path. It learns from it, adapts parameters within bounds, and feeds changes back — but the fast path continues running unchanged through every adaptation cycle. Phase E (meta-learning & integration) shipped and live-wired — see Observed adaptation.
flowchart TB
subgraph FAST["Fast path — collapse pipeline"]
FP["α → ν → λ → ρ → ε — unchanged during adaptation"]
end
subgraph SLOW["Slow path — neurotrophic layer"]
A["Phase A Homeostasis"] --> B["Phase B Plasticity"] --> C["Phase C Fault repair"]
C --> D["Phase D Temporal learning"] --> E["Phase E Meta-learning"]
end
FP -->|"observe metrics"| A
E -->|"bounded feedback"| MUTABLE["Adaptation surface"]
MUTABLE -.->|"never blocks"| FP
classDef fast fill:#121820,stroke:#00B2FF,color:#e0e2e8
classDef slow fill:#1a2418,stroke:#48e662,color:#e0e2e8
class FAST,FP fast
class SLOW,A,B,C,D,E,MUTABLE slow
Phase A — Governed Homeostasis
Observes fast-path thermodynamic output (rate, latency, error, throughput). Evaluates against doctrine-defined set points. Adjusts operational parameters within constitutional bounds. The slow path watches, measures, reweights — the fast path runs unchanged.
Phase B — Structural Plasticity
Grows and prunes topology nodes. Adds new seeds, strengthens connections, removes underperforming paths. All growth bounded by the frozen constraint surface. This is how the system’s structure evolves without violating its constitution.
Phase C — Cross-Domain Fault Repair
Astrocyte-model mediator. Detects faults across domain boundaries. Propagates bridge signals. Repairs damaged circuits before learning proceeds. Learning on damaged circuits produces drift — Phase C closes that gap. If an adaptor begins emitting malformed envelopes, Phase C isolates the bridge and repairs it before temporal learning resumes.
Phase D — Temporal Learning
Learns from history. Applies reward mechanisms. Balances beneficial outcomes against hostile ones. Accumulates evidence until prediction confidence reaches threshold. Adjusts weights, not rules.
Phase E — Meta-Learning & Integration
Learns how to learn. Adjusts learning parameters (not logic). Coordinates across all four preceding phases. Reward functions are Founder-defined only — the system cannot author its own goals. Topology-aware learning adapts based on structural context.
External Verticals
Industry adaptors connect over HTTP only — the substrate never forks per vertical. STABLE/VOLATILE profiles, the adaptor diagram, compliance proofs, and per-vertical configuration live on Vertical Surfaces. Governed workflow walkthroughs are on Workflow Demos.
Observability — Dual-Lane Cockpit
Two independent cockpits. Same KPI set. Different data sources. Zero shared state. Stable lane is for governed production traffic; Volatile lane is for exploratory or high-variance environments where wider timing surfaces are intentional.
Stable Cockpit
Rate Surface
- Current RPS
- Min / Max / Avg
- Historical Trend
Timing Surface
- P50 / P95 / P99
- Jitter
Reliability Surface
- Error Rate / Count
- Success Rate
Governance Surface
- Throttle Rate
- Capacity Utilisation
- Accepted / Throttled
Muted · Precise · Minimal
Volatile Cockpit
Rate Surface
- Current RPS
- Min / Max / Avg
- Historical Trend
Timing Surface
- P50 / P95 / P99
- Jitter
Reliability Surface
- Error Rate / Count
- Success Rate
Governance Surface
- Throttle Rate
- Capacity Utilisation
- Accepted / Throttled
Expressive · Dynamic · Wide
Structural Properties
| Property | Enforcement |
|---|---|
| Deterministic | Same input → same output. Always. No unseeded randomness. |
| Identity-free | No personal identifiers in the substrate. Constitutional. |
| Irreversible | Collapse cannot be undone. C¹⁻ does not exist. |
| Idempotent | C² = C. Collapsing a collapsed state changes nothing. |
| Governed | All adaptation bounded by frozen constraint surface. |
| Additive | Each neurotrophic phase adds capability. Nothing modified. |
| Constitutional | Doctrine loaded at boot, immutable at runtime. |
End-to-End Path
Ingress through adaptation — one traversal. Collapse operators are detailed above; this is the full cycle including kernel dispatch and slow-path feedback.
The substrate never changes. Only the constraint surface changes.