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

Idempotency & Deduplication

Retries are inevitable on a distributed control plane; idempotency keys make a repeated write or command harmless.

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 retry problem

Networks partition, processes restart, and producers time out and retry. Without protection, a retried write duplicates a breeder magnetics sample or, catastrophically, re-issues a burner neutral-beam command. Layer 4 makes every producer and every command handler idempotent: applying the same operation twice yields the same state as applying it once.

Idempotency keys

Each event carries an idempotency_key derived from the semantic identity of the operation, not from wall-clock time. The backbone and each stateful consumer keep a bounded dedup window keyed on it. A duplicate is silently absorbed.

python
def handle(cmd):
    # dedup on semantic identity, not arrival time
    if store.seen(cmd.idempotency_key):
        return store.result_of(cmd.idempotency_key)   # same answer, no re-apply
    result = apply(cmd)
    store.record(cmd.idempotency_key, result, ttl=DEDUP_WINDOW)
    return result

# breeder coil setpoint: key encodes what, not when
# key = f"coil:{coil_id}:shot:{shot_id}:step:{step}:setpoint:{value_hash}"

Commands vs measurements

Window sizing

The dedup window must exceed the maximum retry horizon plus the maximum consumer lag, or a late duplicate slips through. It is bounded so state does not grow without limit. Keys older than the window are safe to forget because the backbone's offset commits guarantee they will not be re-delivered from before that point.

Idempotency is the precondition for the stronger delivery-semantics guarantees: at-least-once delivery plus idempotent handling is how the stack achieves effectively-once processing without a distributed transaction on the hot path.

Content reviewed August 2026 · design-and-simulation stage