Nomenclature

Asks What is a name, and what is an address?

How things are named and how they are addressed. A label is written for a reader and may be rewritten; an identifier is written for a machine and may not. Confusing the two is how a rename silently breaks every reference to the thing renamed.

In this model A label reads in plain language and can be revised. The locator beside it is fixed, and no relationship resolves through a label.

Represented by

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

• SKOS Simple Knowledge Organization System ReferenceW3C
• Cool URIs don't changeBerners-Lee, W3C, 1998
• ISO 25964-1:2011 Information and documentation, Thesauri and interoperability with other vocabularies, Part 1: Thesauri for information retrievalInternational Organization for Standardization

Commitments it asks for — 9

• enforcedStore one canonical relationship assertion
• guidanceUse external content taxonomy as a mapping, not mastery
• enforcedKeep concrete creative separate from its classifications
• enforcedProvenance and conformance are read apart
• enforcedThe reverse reading is named, not improvised
• enforcedA term may be known by other names, and they are labels, not terms
• enforcedAn identifier names one thing, and never a second
• enforcedAn address is a label's, made once
• enforcedProse names only what the registry holds

What the build enforces — 10

• registry integritycanonical graph integrity
  Endpoints resolve, relationship triples are unique, and compositions remain acyclic where the model requires it.
• registry integrityadmission and shape
  Every kind has a valid shape and evidence class, and every row keeps the admission its kind allows: a record names its source, an exemplar names none, and a world record states the public reference it stands on.
• registry integritystable identifiers
  Kind prefixes are unique, every row keeps the identity convention of its kind, and an identifier once retired is never reused: a kind writes each retirement down with its date and its reason, and every number below its highest is a row or a retirement.
• registry integritytyped relationships
  Every relationship has declared endpoint kinds and a governed cardinality.
• foundation integritycitation coverage
  Every kind, relationship and deliverable is licensed by a cited rule, every source is cited by at least one rule, and every foundation names, among the cited works, the standard that represents it.
• registry integritynamed inverse
  Every relationship names the verb its reverse reading uses; it differs from the forward verb and is never the forward verb wrapped in 'is ... by'.
• registry integritylabel integrity
  A row has one label and may carry alternate labels; every alternate label is a distinct non-empty name that is not the row's own label and matches no label or alternate label of another row in the same kind, so a name resolves to one term within its kind and a search by any name a term is known under finds it.
• 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.
• 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.
• registry integrityreferences resolve
  Every reference in prose resolves to exactly one governed thing, a kind by its name or anything else by its identifier, and never to the text's own subject; the texts references are read from are fields the schema and the ledger declare. A reference is a name, never an assertion: the build draws it as a link and lists it on the target, and a pair of rows a text joins that the registry does not is listed as proposed and written nowhere.