TypeQL at the edge

The seven beats

World

Every rule this system owns is written once, in TypeQL, in schema/*.tql — 344 functions that know the schema, the closure and the authority walk. They all live in Virginia. The people and agents asking do not.

Cast

The receivers that must answer a rule to serve a request — fn:run first, then tasks:everywhere; the agents and people waiting on them; and the schema authors, who should keep writing TypeQL and never a second copy in JavaScript.

Knock

A request arrives that cannot be answered without evaluating a rule, and evaluating it means crossing the Pacific: 1.2-1.6 s for a live query, against a budget measured in hundreds of milliseconds.

Want

The rules answered where the request already is — without rewriting a single one of them by hand, and without a second definition that can drift from the first.

Way

Build reads every fun into a machine-readable pattern and refuses any construct outside the twelve it knows. Sync ships the graph itself into RAM as a seventh snapshot key. A pure solver walks the pattern over the graph with no I/O. Parity against a real TypeDB adjudicates every fun that has instances. A write patches RAM before it reaches the queue, so the answer never trails its own cause.

Turn

fn:run stops reaching for TypeDB. The rule is still one fun in one .tql file — nobody rewrote it — but the answer is now a walk over Maps in the isolate. That is the moment the request path leaves the network, and every later door follows the same way out.

Lesson

The queries are the manifest: what RAM must hold is enumerated by the funs that ask, not guessed by a cache warmer. TypeDB derives; RAM serves. And a projection is not a cache — a cache hides a cost from everyone but the first caller, a projection removes it.