Against the pull of the probable.

Most generative systems begin with positive space: what answer is likely, useful, fluent, or preferred? CRE begins with the complement. Given this prompt, this candidate response, these typed relations, and these active obligations, which compositions are inadmissible?

The surviving answer is not declared true because a model liked it. It is the candidate morphology that remains after deterministic exclusions, unresolved obligations, invalid transformations, and release blockers have been accounted for.

The product path is staged so that later components cannot rewrite the evidence they are supposed to inspect. Primary generation and prompt observation begin from the same frozen turn package. The exact primary response is then frozen and hashed before response observation starts.

Observers propose particles. They do not supply bonds, verdicts, repair decisions, or release authority. CRE closes the graph and owns every semantic transition that follows.

Coherence is designed as a system of explicit incapabilities. Components are useful because of what they can do; the architecture is reliable because of what they are structurally prevented from doing.

Transport can spend but cannot decide. UI can display but cannot mint authority. Retrieval can find candidates but cannot turn them into support. Telemetry can remember but cannot govern.

A reliability layer that only refuses is a sophisticated brake. CRE is built around elimination by repair: preserve fluency at the provider edge, narrow the lawful search space with typed constraints, then force the changed output back through fresh observation and the same adjudication path.

The old proof cannot be reused for new text. The repaired candidate must earn its own closure, and newly introduced debt terminates progress rather than being laundered into success.

Coherence separates exact history, derived recall, and scientific evidence because they have different jobs. The result is a pageable context architecture that can remain useful across long-running work without pretending that similarity, recency, or an old adjudication settles the current question.

Hot pages remain in the active window. Relevant older pages are recalled into a bounded warm window. Cold exact pages remain durable and addressable. Every recalled item is candidate context and the current prompt/response pair is still adjudicated fresh.

Coherence can route among managed model families, web search, semantic retrieval, structured computation, entity discovery, finance, academic literature, biomedical literature, and preprints. The important fact is not how many integrations exist. It is that the Gateway treats them as a conditional capability graph.

Before ranking, Auto Configure eliminates routes that violate entitlement, availability, context fit, observer structure, provider-family separation, latency, usage, cost, or margin constraints. No score can rescue an ineligible topology.

The architecture is backed by executable boundaries rather than a diagram alone: Rust-owned transitions, generated wire contracts, bounded framing, opaque continuations, role-specific data projections, content-addressed replay, secret-isolated workflow processes, and explicit rollback paths.

Structural integrity and test evidence are reported as exactly that. They do not become claims of whole-product formal verification or empirical truth.