Foundation · Structural

Topology

Asks Is it connected, and can it be walked?

The shape of the graph as a graph: which way an assertion points, whether both of its ends resolve, and whether a path exists between two things at all. This is what makes a structure traversable rather than merely tabular — the difference between data you can query and data you can follow.

In this model Every relationship stores one direction and both endpoints resolve. Reverse reading is inferred from a named inverse, so no path depends on a fact written a second time.

Represented by

The engineering standards that state this foundation directly, among the works the commitments stand on.

Commitments it asks for — 12

What the build enforces — 15

registry integritycanonical graph integrity
Endpoints resolve, relationship triples are unique, and compositions remain acyclic where the model requires it.
registry integritytyped relationships
Every relationship has declared endpoint kinds and a governed cardinality.
registry integritydistinct definitions
No two rows of different kinds are defined in the same words, and no definition restates a field the row already carries, so a distinction the model commits to is carried where a reader meets it and nothing the model knows is stored in two places at once.
registry integrityjourney integrity
Every journey begins at one of its own positions and carries at least one legal move, its positions sit on a contiguous run of rungs, and every position either has a move out or realises a condition another journey leaves from, so no journey is a picture and no position is a dead end.
registry integritylifecycle ladder
The lifecycle is a single unbroken chain with one first stage and one last, every consumer state is placed on it, and every stage is one some goal advances people toward, so an order a reader leans on cannot quietly become a fork, leave a condition unplaced, or hold a rung nothing pursues.
registry integrityspine integrity
Every row of a kind the model leans on states the relationships that kind exists to carry, so a relationship declared across the registry and asserted nowhere is a failure rather than a thin line on a map.
registry integrityrow participation
Every row of a registry kind is touched by at least one relationship besides its own grounding, and every vocabulary is read by at least one filled relationship, so a record or construct nothing relates to, and a set of terms nothing uses, are failures rather than quiet rows.
registry integritykernel integrity
Every kind and relationship the kernel names is one the registries declare: a spine's verbs are verbs its kind states or is reached by, the metric derivation names specifications that exist, the contract-status escape names kinds that exist, and the grounding reaches kinds that exist, and the machine's kinds and verbs and the instrumenting kind are kinds and verbs the registries declare.
Every pattern is a shape the model can hold, and every kind is in onePattern integrity
Every pattern's roles name kinds that exist and are named once; every edge is a declared relationship whose ends are its roles' kinds; the shape is connected and crosses no grounding, and a typing only where nothing leads on; a root, where declared, is the first role. A pattern with a root binds from some row, and every kind fills a role in some pattern.
ring:8the standards ring
A SHACL validator and a SPARQL engine that are not this build agree with it.
Every view binds declared patterns from one kindViews compose
Every view names declared patterns, all asked from one kind, drawn in a way the law's pattern vocabulary declares, belonging to a declared deliverable, a table as one of its tabs and a job as work that produces it; and some row of that kind answers at least one of them. What a view touches is derived from its patterns, never listed beside them.
ring:6the site ring
The built site is the whole graph and nothing else: every page indexed, addressed by a label, self-contained and free of any private name; every structured-data identifier a subject the standards export wrote; every page unfurling to its own card, and every sitemap entry naming that card as its image; every journey with its SCXML twin; the sitemaps held to the graph; a graph under a megabyte. And the host held to the ground: the Worker serving the build as its assets and running first for every request; the allowlist and the redirect list it carries cut from the graph, every address the graph once answered to in the list with the status the law gives it and none of them a page; every endpoint served by the files it names; and the beacon sending to the collector's endpoint and nowhere else; every projection the law declares in the build, served by the files that say they serve it, and named in llms.txt; and the Worker reading the host's caching rules and owed headers from the law, writing none of its own; every answer a question carries a page where the walk is non-empty and nowhere else, its structured data naming exactly the rows the walk reached.
eval:enginethe engine agrees with itself
The binder that runs while the graph is built and the binder that runs in a reader's browser find the same bindings: every pattern bound against the whole model to the same instances and the same rows in every role, the published example among them, and every view bound again from every row it answers from, row for row, and the port of the pattern law beside the browser's engine refuses every way a declared pattern can be broken exactly as the law does, and every question bound again from every row of its root kind finds an answer exactly where the build published one and nothing where it did not.
registry integrityaddress integrity
Every page address is made once from a label by the law's own scheme and is distinct from every other; every top-level name the site answers is derived from what declares it, and no kind, endpoint or frame name takes another's; every address the site once answered to, a former label's or a retired identifier's, is distinct from every live address and from every other former one, and no row names its own label as a former one; every projection answers at a declared name, once, and is cut from fields the artifact carries; every operation reads a projection; and every endpoint answers only what its direction allows.
registry integritythe loops close
Every pattern the kernel names as a loop is a shape whose edges form one cycle over all of its roles, and the model instantiates it: at least one set of rows stands to one another all the way round. A loop is how the model says its gears connect; a loop that does not close is a picture, and one nothing stands in is a promise.