Ten million events fire simultaneously. The engine does not hesitate. Every thread finds its resolution.
Ten thousand concurrent threads leave the scheduler in under six microseconds. No queue lock. No drift.
Deterministic outcomes under full contention. The engine resolves races before they complete.
The engine maintains state coherence across every node in the mesh. No event is lost. No event is duplicated. Every dispatch is acknowledged, scheduled, and resolved within a bounded window.
Every event completes within an observable horizon. The tail distribution is flat; the P99 is the median plus epsilon.
Events traverse a compiled state machine. Each transition is a single atomic operation. No interpretation, no heuristics, no surprises.
Upstream slowdowns propagate as signals, not as loss. The engine never drops what it has accepted.
Any sequence of events can be replayed bit-for-bit. The engine is its own black box recorder. Every resolution is reproducible from an input trace.
Partial failure does not halt the engine. Dead channels isolate; live channels continue. Recovery is a first-class event.
The routing graph is compiled, not traversed. Every event takes a direct line from source to resolver. No dispatcher hop. No dynamic lookup.
Every resolution is either written whole or not written at all. There is no intermediate state visible to an observer.
Every event carries its provenance. Every resolution carries its lineage. The engine exposes itself through the artifacts it produces; no external instrumentation is required.
Three states. No fourth. Every event lives in exactly one of them at any observable instant.
Every interaction with the engine is an event. Every state change is an event. Every failure is an event. The engine does not distinguish between the trivial and the consequential — they pass through the same scheduler, acquire the same provenance, resolve under the same guarantees.
This uniformity is not a simplification. It is a contract.
Serial execution is an optimization. Concurrent execution is the law. The engine schedules thousands of independent threads as the ordinary case; serialization emerges only where the topology demands it.
Every event that enters the engine exits it. The exit may be a success, a retraction, or a formal abandonment — but the engine will not leave an event in an undefined state. The word we reserve for the space between dispatch and exit is transient; every transient is bounded.
There are no lost events. There are only events whose resolution has not yet been observed.