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

Watermarks & Event Time

Consumers reason about event time, not arrival time, and use watermarks to know when a time window is safe to close.

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.

Event time vs processing time

Diagnostics from the breeder and burner are timestamped at the source (occurred_at). Because of buffering, retries, and multi-partition merges, they can arrive out of order and late. Any computation that windows over time (for example, energy or neutron-flux integrals during a shot) must use event time, or it will attribute samples to the wrong window.

The watermark

A watermark is the consumer's assertion that it has seen all events with occurred_at at or before time W. It advances as ordered streams progress and lets the consumer close windows deterministically. Late events arriving after their window closed are handled explicitly, not silently misplaced.

python
watermark = min(latest_occurred_at[p] for p in partitions) - allowed_lateness
for window in windows_ending_before(watermark):
    emit(aggregate(window))          # safe to close: no earlier event can still arrive
# late event (occurred_at < watermark): route to correction path, never drop
if e.occurred_at < watermark:
    corrections.publish(e)

Allowed lateness

Determinism preserved

Watermark-driven windowing is deterministic given the recorded stream: replay reproduces the same window closures and the same aggregates. This is why post-shot analysis of a breeder disruption matches what the live system computed, and why cross-partition merges during a transient are reproducible (see ordering).

Watermarks decouple correctness from timeliness: under backpressure windows close later but never incorrectly.

Content reviewed August 2026 · design-and-simulation stage