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 › L4 · Orchestration
L4 · Orchestration

Plasma Shot State Machine

The formal state machine behind a breeder shot, its guarded transitions, and the invariants each state must hold.

THE STACK · click to jumpL7Ecosystem & StrategyL6Experience & VisualizationL5Applications & CopilotsL4OrchestrationL3Twin Modeling & AIL2Data FabricL1Control PlaneL0Foundation▲tlmctl▼L4 · ORCHESTRATIONEvents, workflows, rules, and human routing.1Event Streamingthe backbone2Workflow Enginecampaign procedures3Rules & Safety Boundshard limits4Human-in-the-Loopapproval routing5Schedulerexperiment campaigns6Audit Busfull decision lineageMACHINE TIECoordinates L3 outputs with L5 copilots and human operators.KRONOS FUSION ENERGYAI-NATIVE S.M.A.R.T. GENERATORORCHESTRATIONSHEET 06REV. 2026-08L4 · AI-NATIVE STACK
L4 · Orchestration — its place in the stack (left, click any layer) and its internal components (right). Telemetry rises; control descends.

Formalizing the shot

The breeder (Hyperion) shot is expressed as an explicit finite state machine whose transitions are guarded by measurable conditions and whose states each carry an invariant that must hold for the duration. Formalizing it this way makes the procedure analyzable, replayable, and testable against the twin before hardware exists.

States and invariants

state x invariant
100110111110100

Reading the matrix rows as PUMPDOWN, FIELD_RAMP, FLATTOP, RAMP_DOWN, RECOVERY against columns (vacuum-ok, field-armed, plasma-present): each state asserts its required invariants continuously, and violation triggers transition to SAFE_ABORT.

Guarded transitions

python
T = {
 ('PUMPDOWN','FIELD_RAMP'):  lambda s: s.base_pressure_ok,
 ('FIELD_RAMP','FLATTOP'):    lambda s: s.i_p_A >= 9.66e6*0.98 and s.delta <= -0.30,
 ('FLATTOP','RAMP_DOWN'):     lambda s: s.diag_window_done or s.plan_end,
 ('*','SAFE_ABORT'):          lambda s: s.fault or s.envelope_violated,
}

Invariants reference the design point

Determinism

The state machine advances only on recorded events, so a shot is fully replayable. Faults route to the shared abort path, which coordinates with disruption mitigation and quench abort depending on the fault class.

Why formalize rather than script

Expressing the shot as an explicit guarded state machine, rather than an imperative script, makes three properties checkable by construction: no two states drive the same actuator, every state has a defined exit and a defined abort, and no transition can fire unless its guard evaluates true against measured state. A scripted sequence hides these properties in control flow; the state machine exposes them for review. The transition table and invariants are version-controlled and pass through the same replay regression gate as any other orchestration change, so a modified shot definition must reproduce approved past shots before it can run on the breeder.

Content reviewed August 2026 · design-and-simulation stage