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

Exactly-Once vs At-Least-Once

The stack chooses delivery semantics per topic; safety-critical commands get effectively-once via idempotency, telemetry tolerates at-least-once.

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.

The three honest options

Distributed messaging offers at-most-once (may lose), at-least-once (may duplicate), and exactly-once (neither, but expensive and never truly free). True end-to-end exactly-once across independent actuators is a fiction; what is achievable is at-least-once delivery plus idempotent processing, which yields effectively-once state changes. Layer 4 states its choice explicitly per topic.

Topic classDeliveryEffect
diagnosticsat-least-oncededup on ingest
twin inputsat-least-oncededup by step key
commandsat-least-once + idempotenteffectively-once actuation
auditat-least-onceappend; dedup by event_id

Why not at-most-once

At-most-once is banned for anything that matters. Losing a breeder command acknowledgement or a burner interlock event could leave a procedure believing an action succeeded when it did not. The stack prefers a duplicate it can detect over a loss it cannot.

Achieving effectively-once

text
1. producer writes with idempotency_key (at-least-once)
2. consumer dedups on key within window
3. consumer processes and commits offset ATOMICALLY with its state
   (transactional outbox / read-process-write in one txn)
4. crash before commit -> reprocess -> dedup absorbs the duplicate

Step 3 is the subtle one: the offset commit and the state change must be atomic, or a crash between them re-processes an event whose effect already landed. The transactional outbox pattern makes this atomic without a distributed transaction on the hot path.

On the machines

A burner plug-field setpoint may be delivered twice under retry; because the command handler is idempotent (same key, same setpoint hash), the magnet is driven to the target once. A breeder gas-puff command uses the same discipline so a network hiccup cannot double-dose the fuelling. See idempotency.

The honest limit

Effectively-once is a property of state changes, not of side effects in the physical world. Once an actuator has moved, no delivery guarantee un-moves it; the guarantee is that orchestration will not ask it to move twice for one decision. That is why the strongest safeguard against double-actuation is not the messaging layer at all but the single-writer token and single-use idempotency key at the actuator adapter. The stack states its delivery semantics per topic precisely so no engineer mistakes at-least-once telemetry for a guarantee that a command cannot be re-issued, or mistakes idempotent handling for a promise that the physical world is transactional.

Content reviewed August 2026 · design-and-simulation stage