Machine-readable metadata on each governance rule, extracted into a typed, queryable registry.

Rule-metadata registry (machine-readable metadata on governance rules)

Intent — Attach machine-readable metadata to each rule in a governance document — its identifier, scope, severity, the enforcing check, the canonical detail location — as a structured block inside the rule, then extract those blocks into a typed registry the tooling can query. A body of governance prose stops being an opaque wall a program can only grep and becomes a model: "which rules have an enforcing lint?", "which rules govern the PDF subtree?" are queries over a registry, not manual reads (our instance: inline metadata blocks on the numbered project rules, extracted into a typed rule registry).

SummaryMachine-readable metadata on each governance rule, extracted into a typed, queryable registry.
TargetBridge · System models
Formtyped-ir
Movepackage — a constraint shipped with its sensors
Modelis-a-model — a structured model you check a system property against
EnforcementHard (deterministic) — each rule's metadata block is structured and extractable, and the derived registry is reconciled against the document so a rule without a well-formed block, or a block citing a missing enforcer, is a build finding
Derivationmodel-from-code — the registry is extracted from the inline metadata blocks in the governance document

Its place in the environment — a variant / known-use of Executable Source of Truth, under KNOW · Maintain authoritative system knowledge. Preserved here for its technical texture; the construction kit shows how it folds.

Motivation — the failure it kills

A mature governance document accretes dozens of rules, and the interesting questions about them are aggregate: which rules are backed by an automated check and which rely on review, which apply to a given subtree, which are advisory versus blocking, which have a canonical detail doc and which are orphaned prose. As long as the rules are only human paragraphs, every such question is a manual read of the whole document, done from memory, and the answer rots as the document grows. Nobody can mechanically tell that a rule claims an enforcing lint that no longer exists, or that a rule's scope is stated one way in its text and enforced another way in a check. The document is a program's-worth of policy that no program can see into, so its consistency is maintained by attention alone — and attention does not scale with the rule count.

Why it's not just the rules written in prose

Prose rules are readable by a human and opaque to a tool; the metadata block is the bridge. A rule that carries a structured block — identifier, scope, severity, enforcer, detail pointer — can be extracted, queried, and cross-checked, and the extraction turns the whole document into a registry a program walks. The block is not a summary of the prose; it is typed fields the prose cannot be reduced to by parsing. "This rule is blocking, scoped to the PDF subtree, enforced by check X, detailed at doc Y" is a fact a grep over English cannot reliably recover, and a fact the registry makes first-class. Once extracted, the registry supports checks prose never could: a rule citing an enforcer that doesn't exist is a build finding, a rule with no detail pointer is flagged, the count of rules-with-automated-enforcement is a computed number. The prose stays for the human; the block gives the tooling the same rules as a model.

Mechanism

Prerequisites

Consequences & costs

Known uses

Related mechanisms

Governed by

The mechanisms that hold this model true — inverted from their Governs edges at build time, never hand-written. A direct governor names this model; a trunk mechanism governs every model.