Total Structure v3: Appendix A

APPENDIX A — Dependency Map and Compact Definitions

Dependency map

A₀ (inversion) ─────────── validity test over everything, incl. itself
A₄ (injustice = base wrong) ── ROOT / KILL SWITCH / not amendable (IX)
 ├── Moral floor: tolerated remediable subjugation ≡ systems-level entropy
 │    ├── Predation test ──► Triple Optimum (Law IV)
 │    └── Obligation (Law II) ──► Disclosure Doctrine (D1–D6)
 │                                   └── D6 (the drop) ──► Tap & Go (Law VI)
 ├── Terrain (Law III: four states, checking network, decay clock)
 │    └── Fulcrum protocol (Law IV)
 ├── Method (Law IV: trace → invariant → propagate; zero-context test;
 │            objection ledger)
 └── Machine plane (Law V) ──► Object grammar (Law VI)
      ├── receipts / ledger / repair lineage  ◄── A₁₁
      ├── the drop / capability tokens        ◄── Law II bounds, compiled
      ├── density law                         ◄── compression axiom
      └── clarity recursion                   ◄── A₁₂ ──► Amendment (Law IX)
A₁ (polarity) ──► red-team factor (V); necessary adversary (VIII)
A₂ (grain)* ───► alpha as energy competition; deterministic era
A₃ (convergence) ──► Triple Optimum; triple identity of the object (VI); S2
A₅–A₇, A₉ ──► full-scope accounting; the void as method; interlock
A₈ ──► Law VII (designer); owner profile & objection ledger, observed (VI)
A₁₀ (valence) ──► moral gate before any engine or adversarial run
A₁₁ (receipt) ──► universal proof primitive; capture diagnostic (III);
                   step 9 of the Decision Engine; Books V–VI
A₁₂ (recursion) ──► Law IX (amendment, chained); surface S8

* A₂'s Designer attribution is carried as a priced, load-optional
  metaphysical node; its operational content stands independently.

Claim types

axiom — foundational, negation-tested, amendable only under Class X (A₄ excluded). derivation — follows from axioms plus full-scope accounting; amendable under Class R. observed — instantiated in a running system; carries a freshness window; demotes to open when stale. open — declared, bounded, awaiting evidence; lives on a falsification surface.

Definitions

Full-scope system optimality — durable agency, order, gain, auditability, and correct function under load, without contradiction, hidden cost, coercive maintenance, wasted energy, or tolerated remediable subjugation.

Full scope — bounded by declared decision horizon, known and knowable affected parties, required accounting categories, and priced unresolved nodes.

Systems-level entropy — a maintained lower-yield state requiring ongoing energy to suppress available higher-order function.

Injustice — tolerated remediable subjugation: beholden actor; no remedy through self or system; capable actor present in the same system; system tolerates the non-remedy.

Predation — advantage extracted at the cost of logic and ethics against those who cannot remedy through the system.

Capture — a system performing its charter for a different principal than the one it declared; diagnosable as declared success without openable receipts. Distinct from dysfunction (failing its charter, remediable through it).

Capability — effective remedy-capacity: capability × proximity × leverage.

Obligation — duty triggered by capability when the harmed cannot self-remedy or remedy through the system; bounded by capability, proximity, leverage, and actual remedy.

Invariant installation — the minimum structural change that closes a recurrence pathway across a distribution, made durable by aligning the system's identity and interest with its charter; accepted only if it passes the zero-context test.

Zero-context rule — a cold reader must be able to understand what the system is, where the object lives, how to invoke it, where proof is recorded, and how to repair a failure, from the published artifact alone.

Fulcrum — the actor with authority over a captured checker whose position depends on a constituency the checker's failure is costing.

Disclosure Doctrine (D1–D6) — no enclosure against the unremedied; publication as commons-level invariant; grace-period claims as shields terminating in open license; humility clauses; expedition as a term of the debt; the drop — disclosure complete only when operable by a zero-context recipient.

Object — one thing a system can read or do, self-describing: what it is, its inputs, how to run it, what proof should exist, how to repair it.

Object contract — the uniform fields of an object: function, arguments, example, tests, auth, risk, runner, run path, machine contract, troubleshooting, history, receipt, replay, repair.

Dispatch / the one door — the single invocation endpoint through which every capability is resolved, validated, executed, ledgered, and receipted.

Receipt — the replayable, third-party-openable proof object of one invocation: request, response, actor, links, lineage. No receipt, no claim (A₁₁).

Ledger — the append-only, tamper-evident record of what was asked, what ran, and what came back.

Replay / Repair — re-running a recorded invocation; issuing a corrected invocation attached to the failed receipt. Lineage (replays / repairs / repaired-by) is mandatory: failures stay attached to fixes.

The drop (Tap & Go) — one copied artifact carrying credential, protocol, object map, search pattern, execute shape, and receipt rule, sufficient for zero-context delegated action.

Capability token — bounded delegation compiled: scoped, expiring, use-capped, risk-ceilinged, argument-pinnable, instantly revocable, fully ledgered.

Density law — the more a structure self-describes, the less power its interpreters hold; self-description as anti-capture technology.

Objection ledger — settled objections published inside the artifact, verbatim and strongest-form, with the answers and design elements that settled them; entries reopenable when answers go stale.

Logical unit — the smallest auditable inference step: true, false, unknown, conflicted, insufficient, or out of scope.

Surety — Correctness × Auditability × Reproducibility × Adversarial Survival (multiplicative; any zero collapses it).

Logical energy / Logical density — total lifecycle cost of a proof; Surety / Logical Energy.

Task-adjusted logical density — Expected Verified Decision Value / Total Lifecycle Logical Cost, with EVDV = Stakes × Correctness × Auditability × Reproducibility × Adversarial Survival × Actionability × Freshness.

Proof artifact — the receipt of a reasoning event: replayable, ledgered, valid within declared scope, freshness window, and similarity class.

Admission invariant — all inputs untrusted until typed, scoped, provenance-bound, permissioned, adversarially checked, expiry-limited, and admitted to the proof graph.

Command plane — the deterministic layer above stochastic weights electing model, scaffold, context, tools, proof depth, red-team depth, privacy mode, and ledgering per task.

Glass box — a system whose external decisions, including the command plane's meta-decisions, are typed, logged, replayable, challengeable, expiry-limited, and revocable.

Structural isolation — separation of ingestion, proof construction, verification, red-team, repair, and ledgering into distinct instances where risk requires; in the grammar, tenancy.

Alpha — the energy cost of producing a pattern that dominates the existing field.

Structural surety — the terminal design state: the system answers for itself under any observation and interoperates without boundary friction.

Amendment classes — P (patch: empty semantic diff), R (revision: surviving attack's minimum patch), E (extension: own falsifiers + anti-bloat), X (reversal: axiom-depth protocol; A₄ excluded).

Fork rule — refusal of a surviving patch licenses a publicly derived version line with documented lineage; secret forks are capture, declared forks are checks.

Right action — correct behavior when incentives do not align; the guardian function beyond the incentive-aligned core.

---

---

Corpus map

• Canonical shelf: Total Structure root