Kronos

Ask the machine what was true that Tuesday.

Why the mesh dies without a clock that thinks

There is no single clock the mesh can treat as law. Each node keeps a local time. Hardware drifts. Packets take different paths. What looks sequential on one machine can look simultaneous — or reversed — on another. A timestamp is a local mark. It is not a causal order.

Without something that understands time, three failures become the default. Clock skew: Node A stamps 1000, Node B stamps 1003 for the same event, and the house cannot tell which mark is true. Reversed causality: a payment finalizes before the confirmation that should have preceded it, because latency flipped the arrival. Missed deadlines: a heal, a write, or a proof step lands after the window that made it useful.

Kronos exists for that void. It is not a wall clock and not a cron tab. Named for the Titan of Time, it interprets time and enforces the consequences. Wall clocks disagree. Logical order survives. Ask what was true when the decision was made, and get that moment back.

Without a causal order, a timestamp is a local rumor. Kronos turns the mesh’s events into a sequence the house can enforce.

Ten capabilities that make time make sense

Ten interlocking functions. They are one organism, not ten gadgets.

• Ordering — a consistent causal sequence across the mesh, so concurrency is named instead of guessed.
• Sync — a shared “now” within bounds, so nodes stop living in private centuries.
• Scheduling — when a task may start, relative to the other work already on the archive.
• Deadlines — the last tick a critical operation may occupy before the cascade begins.
• Temporal memory — a persistent causal timeline you can reconstruct, not a pile of stamps.
• Causal inference — which action triggered which outcome, including the chain in between.
• Prediction — the next pattern, from history, before the threshold breaks.
• Sessions — one coherent interval of work, even when the work hops nodes.
• Rate limiting — a frequency the node can survive, so a burst cannot own the tick.
• Time-travel queries — the state as it existed at a past causal point, without stopping the present.

Ordering without memory is a log you cannot reread. Memory without causality cannot say why.

The tick is the address

Wall time is out of the hot path. The unit is the tick — 30 Hz, 33.3 milliseconds — the same pulse as the live pipeline. Entities operate on ticks. The tick is also the log sequence number: every WAL write carries the exact tick that processed it. Replay from tick X reconstructs the state as it existed at X.

Lamport clocks keep causality cheap: if A caused B, A’s stamp is strictly less. Vector clocks detect concurrency. Hybrid clocks stack three truths — logical causality, an approximate server time, and a high-resolution local tick.

Drift is a first-class fact. Thirty ticks — about one second — trips a hard resync. Soft correction is a nudge. Hard correction is a mesh median. Team Leader decides where a task runs. Kronos decides when. Every task carries an earliest start, a deadline, and an estimated duration. Rate limiting caps work per tick per node (default three). Overflow defers the lowest-priority task. Deadlines escalate: yellow at 75 percent, orange at 90, red at 100.

Memory, cause, and the path back

Temporal memory is the timeline you can query. recall_at_tick(T) returns everything stored at that pulse. recall_between(T1, T2) returns the interval. Proximity asks what else happened around event X. Duration is a subtraction of ticks — one tick is 33.3 milliseconds.

Sessions bind that timeline into a unit of work. A session closes after thirty minutes of silence or an explicit stop. Cross-node work stays one session; FMPO files the interval. Causal inference stops confusing “after” with “because.” If A precedes B in 95 percent of observations, that is a candidate cause. A broken chain is the anomaly: A happened, B did not follow.

Prediction uses Fibonacci windows — 13, 89, 610 ticks — so short transients do not alias into long trends. The engine forecasts when a room fills, when a backlog clears, and when drift will demand a resync. Time-travel closes the loop. The WAL is reversible: if you know the path forward, you can find the path back.

The temporal backbone

Five house names take a specific gift from this clock.

• FMPO — temporal index. Federated placement across palace rooms needs a causal order, or queries fragment.
• Team Leader — schedule. The dispatcher picks the node; Kronos picks the tick.
• Thoth — staleness. A documentation loop that cannot age a fact will write yesterday as if it were now.
• AMMA — heal timing. Kronos names the window after the causal chain of failure is visible and before the next slip. It does not lock the healer. Φ×Ψ stays a score. Call the resident.
• Mesher — uptime. Health checks and recovery get deadlines, so continuity is a schedule, not a hope.

Proofs have clocks: six, ten, sixteen weeks. Kronos is how the house orders time on the archive.

Internal ops, and the clocks on the raise

The commercial clocks a committee can sit are proof weeks on the buyer’s hardware. CORE is about six weeks — install, recall protocol, fail-closed when the system is not sure. DIVISION is about ten — isolation and an offline drill. ENTERPRISE is about sixteen — executive tabletop and a write-log replay. Same product. Wider archive. Longer tabletop. Kronos is why those three lengths are one ordered work.

Kronos is internal ops — temporal ordering on the archive. It is not the CRONUS harvest engine. Twenty million dollars is an ask to stand the factory that can run a six-to-sixteen-week proof on a floor the buyer owns.

Next in the catalog: FMPO.