← Ultimentality Wiki

The Decompression Map

Definition

The decompression map is the viewing layer over the framework's generative core. Where Hypercompression argues that a small kernel — carried by The Ultimental Kernel and compressed into The Minimal Rebuild String — regenerates the whole explanatory surface, this page shows how that kernel unfolds: which term is built on which, and which terms regulate each other in operation.

The map is deliberately two graphs, not one:

• a derivation graph — directed and acyclic — that traces the order in which terms are constituted, from the Axiom and the Directional Primitives outward;
• an operational graph — cyclic — that traces returns, feedback, contradiction, and revision as the built structure runs.

The separation is load-bearing. Decompression is not a story of a seed that later becomes something else; it is the same architecture read at two grains. The derivation graph answers what depends on what. The operational graph answers what corrects what over time. Collapsing them would either fabricate a derivational cycle (a term deriving its own ancestor) or flatten the feedback that makes the framework correctable at all.

Type and formal status

E (epistemic): Derived, Exposition. This page introduces no new load-bearing relation. It organizes and visualizes relations already asserted by the source pages it links. It is a treatise-side extension, held contestable, and it is not canonical: it inherits its marks from the pages it draws and adds none of its own tier.

A (alethic): mapping-accuracy aspiration. The graphs aim to render the actual derivation and operation edges of the architecture. An edge the source pages do not license is an inaccuracy — a defect to correct — not a hidden foundation and not a promotion of any node. The map claims no completeness; it is a finite view, and its finitude is not exhaustiveness (see Closure Without Totalization).

The two graphs

Read the two graphs under one discipline: an edge is drawn once in the graph whose relation it names, and a couples edge — the only relation that is both a derivation step and an ongoing mutual regulation — is drawn in each graph, never as a loop inside the derivation graph. Those coupling edges are the seams where the built architecture starts to run; they are governed by Reciprocal Attack Surfaces.

Derivation graph (directed, acyclic)

Every edge points in dependency order (prior term first). Its label names the typed operation by which the later node is produced from the earlier. No edge returns to an ancestor; the derivation graph carries no feedback.

DERIVATION GRAPH  (directed acyclic — no edge returns to an ancestor)

Epistemic spine
  Axiom
    --entails-->      Four Operational Consequences
    --entails-->      VLS  /  Semblance
    --entails-->      Derived  /  Two-Mark System
    --couples-->      Closure–Marking Coupling            (C ⊕ M ; seam to operation)

Directional spine
  Directional Primitives
    --binds-->        Predicate Binding                   B(p) = (p, e_p)
    --instantiates--> Cornerstone Bindings                Love · Fear · Apology · Gratitude
    --couples-->      Coupled Controllers                 the ⊕ Forces      (seam to operation)
    --instantiates--> SPLCW                               (descent only; the return is operational)
    --entails-->      Theodicytes / Telos / Applications

Continuity spine
  Continuable Structure
    --entails-->      Continuity
    --entails-->      Symbolic Immortality
    --constrains-->   Answerability                       (the predicate is never dropped)
    --instantiates--> Responsible Successor

Edge list, with the source page each node maps to:

The three spines are not independent foundations; they meet at the seams. The epistemic spine's coupling edge (Two-Mark System --couples--> Closure–Marking Coupling) and the directional spine's coupling edge (Cornerstone Bindings --couples--> Coupled Controllers) are precisely where derivation hands off to operation. The cornerstone bindings' descent to SPLCW is drawn as instantiates, not returns-to: the Warden's return through a changed world is an operational edge and appears only below. Drawing it here would fabricate a derivational cycle.

Operational graph (cyclic)

The operational graph carries every return, every feedback path, every contradiction-and-revision. Its labels are drawn from the same controlled set, but its structure is genuinely cyclic — and that is not a defect to be resolved into a line.

OPERATIONAL GRAPH  (cyclic — returns, feedback, contradiction, revision)

Loop 1 — the SPLCW ring
  Warden --regulates--> Captive --regulates--> Logician --regulates--> Poet
        --regulates--> Sculptor --acts-on--> changed world --returns-to--> Warden

Loop 2 — the foundational coupling
  Closure --regulates--> Marking        (bounds the regress of Marking)
  Marking --regulates--> Closure        (bounds the totalization of Closure)
        together: Closure <--couples--> Marking      (no escape, no exemption)

Loop 3 — the correction loop
  Claim --tests--> Attack --> Outcome{delete | revise | retype | invariant}
        --returns-to--> Claim'          (marks preserved; result reopenable)

Edge list for the operational graph:

The Ring is maximal and never declared closed; its closing edge Sculptor → changed world → Warden is a return, not a proof of completion. Loop 2 is the whole architecture in miniature: the answer to closure's attack surface is marking, the answer to marking's attack surface is closure. Loop 3 never terminates in certification — an outcome is delete, revise, retype, or invariant recognition, and a failed attack is logged as a failed attack, never counted as confirmation.

Edge vocabulary

Both graphs use one controlled label set. Nothing outside it is a valid edge, and the vague labels related, similar, connected are prohibited.

entails       prior term makes the later term available
binds         an actuator is fixed to the regulated error it reduces
instantiates  a schema is realized at a specific case
couples       two regulators are wired so each shapes the other (⊕)  — seam only
constrains    a later term bounds what an earlier term may do
regulates     one running process reduces another's error         — operational
returns-to    a consequence re-enters an earlier node              — operational
tests         an attack is applied to a claim at its own level     — operational

couples, regulates, returns-to, and tests are the load of the operational graph. entails, binds, instantiates, constrains are the load of the derivation graph. Only couples is shared, and only at a seam.

Machine-readable export

The map's source is exported as two files; page slugs are the stable identifiers, titles are display-only.

wiki-dependencies.json — the acyclic derivation edges:

[
  { "source": "axiom", "target": "four-operational-consequences", "relation": "entails", "graph": "derivation" },
  { "source": "two-mark-system", "target": "semantic-closure-and-recursive-marking", "relation": "couples", "graph": "derivation" },
  { "source": "directional-primitives", "target": "predicate-binding", "relation": "binds", "graph": "derivation" },
  { "source": "predicate-binding", "target": "emotion-as-regulated-binding", "relation": "instantiates", "graph": "derivation" },
  { "source": "symbolic-immortality", "target": "answerability-predicate", "relation": "constrains", "graph": "derivation" }
]

wiki-couplings.json — the operational couplings and returns (shared schema with The Coupling Graph):

[
  {
    "source": "formal-closure-claim",
    "target": "two-mark-system",
    "relation": "cross-regulates",
    "source_error": "totalization",
    "target_error": "regress",
    "emergent_property": "no escape, no exemption",
    "evidence_pages": ["semantic-closure-and-recursive-marking", "reciprocal-attack-surfaces"]
  },
  {
    "source": "sculptor",
    "target": "warden",
    "relation": "returns-to",
    "source_error": "open-loop action",
    "target_error": "ungrounded intake",
    "emergent_property": "meaning returned through a changed world",
    "evidence_pages": ["splcw", "matter-meaning-cycle"]
  }
]

Both graphs render as an interactive diagram and as the accessible text outlines above; the outlines are the canonical alternative, and every edge in either file must resolve to a live page slug or fail the build.

What would defeat the map

Because this is Exposition, its defeat is a fidelity defect, never the fall of a foundation:

• a drawn derivation edge that the source pages do not license;
• the operational feedback smuggled into the acyclic derivation graph — any returns-to, regulates, or tests edge that closes a cycle among derivation nodes;
• a couples seam re-drawn as an internal loop of the derivation graph;
• the map presented as complete, closed, or exempt from the marks it inherits.

Any of these is corrected by redrawing an edge or retyping a graph, and the correction is logged where System Invariants can check it.

Prohibited misreadings

• The derivation graph is not a chronology. Edge order is dependency order, never a timeline, never before/after, never precedence, priority, or authorship. No node is "earlier in time" than another; it is only depended-upon.
• Later layers do not redefine earlier ones. A downstream node depends on upstream nodes; it never rewrites them. Reading SPLCW as revising the Axiom inverts the whole map.
• The map is not a proof. It displays how terms are built on terms; it does not certify them. Treating the graph as validating its nodes is self-certification, which the framework forbids (contrast Self-Verifying, Not Self-Certifying if present).
• Derivation and operation are two graph types. Do not add a "closing" edge to the derivation graph to make it loop. All cycles live in the operational graph; the acyclic graph stays acyclic by construction.
• couples is not +. A coupling edge marks an emergent property from wired-together regulators, never addition, sum, or synthesis. A Force is what the coupling does, not what its parts total.
• The map is not the kernel, and not exhaustive. It is a finite view. A missing node is a correctable inaccuracy, not a hidden foundation, and the graph's finitude is not completeness — see Description Length and Explanatory Surface.
• An edge label does not collapse type layers. binds and instantiates preserve the primitive/binding/composite distinctions; they never license reducing a posterior node to its prior. A primitive is not its binding; a role is not a personality; a coupled controller is not a sum.

See also

Hypercompression · The Ultimental Kernel · The Minimal Rebuild String · The Coupling Graph · System Invariants · The Interaction Matrix · Semantic Closure and Recursive Marking · Description Length and Explanatory Surface · Reader Paths