Skip to content
Technology How it works Breeder — Hyperion Burner — Aegis Burner — MetroVolt AI-Native Architecture Magnets Fuel cycle Safety Roadmap
Solutions AI & Data Centers Defense & Government Grid & Baseload Neutron Detection Quantum
Learn Technical Library
Proof Publications Whitepapers Technical Library Open Science & Reproducibility The Honest Gates
Company About / Mission Leadership Environment Health & Safety Investors Careers Press Contact
3D Model
AI Architecture › Mathematical Foundations
Mathematical Foundations

Graph Neural Networks: Message-Passing Mathematics

The diagnostic constellation and the coupled subsystems are graphs; message passing is the mathematics that lets a network reason over their topology.

STRATEGY / SLOW ▲ ▼ MICROSECOND REAL-TIMEL7Ecosystem & Strategytelemetry ▲ control ▼open ▸L6Experience & Visualizationtelemetry ▲ control ▼open ▸L5Applications & Copilotstelemetry ▲ control ▼open ▸L4Orchestrationtelemetry ▲ control ▼open ▸L3Twin Modeling & AItelemetry ▲ control ▼open ▸L2Data Fabrictelemetry ▲ control ▼open ▸L1Control Planetelemetry ▲ control ▼open ▸L0Foundationtelemetry ▲ control ▼open ▸PHYSICAL S.M.A.R.T. GENERATOR PLANTBREEDER · HYPERION1R0 1.2 m · A 2.5 · 16.84 T · δ −0.30BURNER · TANDEM MIRROR2317 T throat · 26.49 T plug · fₙ 5.44% · DEC1 center stack + plasma · 2 high-field plug · 3 expander → direct converterCOLOR GRAMMAR strategy AI-workflow infra/data models reactor/DECLINE SEMANTICStelemetry (µs)controlKRONOS FUSION ENERGYAI-NATIVE S.M.A.R.T. GENERATORMASTER BLUEPRINTSHEET 01REV. 2026-08L0-L7 · 2 MACHINES
The AI-Native S.M.A.R.T. Generator Master Blueprint — eight layers (L0→L7), one control stack, wired to both machines. Telemetry rises in microseconds; control descends the same path.

Fusion state as a graph

Many objects in the stack are naturally graphs: the 60+ port diagnostic constellation (nodes = sensors, edges = physical/flux-surface proximity), and the coupled plant subsystems (nodes = magnet, plasma, blanket, DEC train). A graph neural network (GNN) processes these by passing messages along edges, so a node's updated state reflects its neighborhood - exactly the locality physics has.

text
Message-passing layer (one round):

  m_ij = phi_msg( h_i, h_j, e_ij )        (message on edge i<-j)
  a_i  = AGG_{j in N(i)} m_ij             (permutation-invariant)
  h_i' = phi_upd( h_i, a_i )              (node update)

  h_i : node feature ,  e_ij : edge feature (geometry, coupling)
  AGG : sum / mean / attention (invariant to neighbor order)

Why the aggregator must be invariant

Physical neighbors have no intrinsic order, so the aggregation must be permutation-invariant - sum, mean, max, or attention-weighted sum. This invariance is what lets the same GNN handle a diagnostic being added or retired without retraining from scratch, a practical requirement across a machine's life and across the breeder-to-burner transfer.

python
# one message-passing round over the diagnostic graph
for i in nodes:
    msgs = [phi_msg(h[i], h[j], e[i,j]) for j in neigh(i)]
    a_i  = attention_sum(msgs)        # invariant aggregation
    h[i] = gru(h[i], a_i)             # gated update keeps temporal state

Depth equals reach

Each message-passing round extends a node's receptive field by one hop; K rounds let information travel K edges. Too few rounds miss long-range coupling; too many cause over-smoothing, where node features collapse together. The stack tunes depth to the physical correlation length of the graph - short for local sensor imputation, longer for whole-machine coupling.

Message passing is the shared substrate for the stack's two GNN roles - imputing dropped diagnostics and modeling coupled-subsystem dynamics - each covered on its own page.

Content reviewed August 2026 · design-and-simulation stage