The Attack-Surface Matrix
This table is generated from the current structured metadata of the source pages. It indexes their stated challenges and revision conditions; it does not independently validate those conditions or claim that they exhaust all possible criticism. Pages without structured metadata remain accessible through the kill-table and their linked definitions.
| Page | Status | Challenge | Revision condition | Executable test references |
|---|---|---|---|---|
| Apology | AC | Show that Apology is not Loop-back bound to self-model error, or that a claimed correction cannot alter the dependent operation while still counting as effective Apology. | A canonical Apology case is better captured by a different actuator and discrepancy, or the self-model remains causally unchanged in every case counted as successful Apology. | Not registered |
| The Attack-Surface Matrix | Exposition | Show a generated row differs from its source metadata or the metadata misstates the source claim. | The index cannot reproduce current source metadata or falsely reports executable coverage. | Not registered |
| Attack-Type Matching | Mixed | Show that a row misstates commitments, omits relevant criticism, or falsely makes routes exclusive. | The classification systematically misroutes relevant criticism or requires arbitrary retyping. | Not registered |
| Capture of the Corrective Layer | CV | Show that the proposed diagnostic misclassifies effective self-correction as capture, or fails to distinguish neutralized correction from legitimate integration. Ownership alone does not establish capture. | Capture cannot be distinguished from legitimate integration of correction. | Not registered |
| The Category-Error Atlas | Exposition | A listed row is not a category error at the level claimed, or a genuine recurring cross-layer error has no entry and no near category. | A same-level counter-instance is repeatedly deflected by citing an atlas row rather than answered, i.e., the atlas is used to retype valid attacks instead of to catch invalid ones. | Not registered |
| The Error Mark With Causal Force | FT | Exhibit a marked claim whose error can never, even in principle, alter any relevant operation while still functioning as genuine answerability rather than decoration. | The framework treats recorded error as answerability despite a permanently closed update path. | Not registered |
| Causal Falsifiability | CV | Show that the account confuses refutation with uptake, misidentifies a corrective path, or cannot distinguish effective correction from acknowledgment. | The account systematically misclassifies corrective reach or cannot distinguish effective uptake from acknowledgment; failure of a particular implementation challenges its implementation claim. | Not registered |
| Causal Source and Experiential Format | FT | Show an invalid source/format inference or a case in which the proposed descriptions misidentify origin or registration. | The proposed distinction supplies no way to distinguish causal origin from participant registration in the cases it claims to explain. | Not registered |
| Closure Without Totalization | Mixed | Challenge the non-implication through its premises or inference, or show that the correction-path test misclassifies an answerable or immune formulation. | Defeat the argument that closure alone does not establish completeness; separately, revise the operational test if it cannot distinguish effective correction from immunity. | Not registered |
| Compression Without False Closure | FT | Show that a compression loses required content under its stated reconstruction conditions, or that the preservation test misclassifies a legitimate simplification. | The account cannot distinguish loss of required content from legitimate simplification. | Not registered |
| The Constitutive Medium and the Mortal Message | FT | Decline the frame, show the medium/message carving is bettered by an alternative, or show a formulation of the medium is incoherent — but not by naming a durable message and calling it exempt. | Exhibit an accessible message genuinely exempt from every possible revision, or an access medium that can be exited while remaining participant-access. | Not registered |
| Continuation and Colonization | CV | A successor is fully compelled to reproduce the parent structure yet remains meaningfully answerable in a way the comparison table cannot represent. | The distinction depends only on approval of the propagated content. | Not registered |
| Correction Without Regress | Mixed | Show that the claimed stopping rule cannot authorize action while remaining correctable, or that the stated premises do not establish the claimed termination. | Show that usable stopping and effective reopenability cannot coexist under the stated conditions. | Not registered |
| The Coupling Graph | Exposition | Exhibit a coupling the source pages assert that the graph omits, or an edge the graph draws that no source page's regulation supports. | The rendered relation, direction, or emergent property misrepresents its source, or a demonstrated discrepancy cannot change the graph. | Not registered |
| Cross-Regulated Necessity | Mixed | Exhibit a pair that passes all four criteria yet loses nothing on removal, a coupling agreed necessary that fails a criterion, or a case where isolating either term releases the same excess rather than a distinct one. | Eliminate either controller of an alleged cross-regulated pair while the emergent property survives intact, or show the four-criteria test can never fail. | Not registered |
| Crystallization | CV | Exhibit a structure that satisfies every crystallization indicator yet whose stability is counterfeit — sustained by refusal, authority, or reclassification — or offer a better carving the crystal/fossil distinction cannot make. | Present resistance is shown to be produced by refusal, authority, or semantic reclassification rather than by selected elimination and live correction. | Not registered |
| The Decompression Map | Exposition | Show a drawn derivation edge the source pages do not license, or the operational feedback smuggled into the acyclic derivation graph, or a claim of completeness. | The map is defeated if it misdraws a licensed relation, forces the operational cycle into the derivation graph, or presents itself as a complete or exempt account. | Not registered |
| Description Length and Explanatory Surface | CV | The framework's coverage depends on adding domain-specific premises not recoverable from the kernel, so the measured explanatory surface is not actually a decompression of the measured description. | Explanatory surface grows only by accretion, with no stable reconstruction relation to the kernel. | Not registered |
| The Dynamic Fixed Point | CV | Show that the continuity criteria admit a frozen or captured apparatus as a continuation, or that they cannot separate continuation from wholesale replacement. | Show that the operational tests falsely identify causal correction, or that the criteria cannot distinguish continuity from replacement. | Not registered |
| Effective and Ornamental Answerability | CV | Exhibit a process that preserves every objection yet has no possible behavior difference between objection and no objection, and challenge the page to name an observable criterion that still separates effective from ornamental answerability. | No observable criterion — counterfactual or interventional — distinguishes effective answerability from ornamental answerability. | Not registered |
| Emotion as Regulated Binding | Mixed | Exhibit a cornerstone emotion whose canonical behavior is not captured by its actuator-and-regulated-error pair, or a second distinct binding with the same pair yet a predictably different function. | The model cannot tell the four emotions apart except by importing their ordinary names. | Not registered |
| Externality Without Extra-Symbolic Access | FT | Show that a proposed provenance criterion misclassifies an event, or that an asserted source/format inference does not follow from its stated premises. | The proposed provenance criteria cannot distinguish the causal origins they claim to distinguish. | Not registered |
| Fear | AC | Show that Fear is not the Away-bound regulation of boundary violation, or that a valid object of Reconciliation must be excluded merely because it is Fear. | A distinct functional binding performs the claimed boundary regulation without Away, or the unrestricted-object account of Reconciliation cannot admit Fear without changing its composition. | Not registered |
| Force (the ⊕ coupled-controller) | Mixed | Show that the named composite property survives removal of a
controller, or that the ⊕ relation adds no behavior beyond
its isolated components. |
A purported Force retains its defining behavior after one controller is removed, or an equivalent isolated term explains the behavior without the coupling. | Not registered |
| Frame Condition and Formulation | FT | Decline the closure frame at cost, show the condition/formulation distinction is internally empty, or offer a sharper carving of the cut — not merely kill one formulation and call the condition refuted. | A rewrite drops or reverses every invariant on the continuity list, in all formulations, while the page still declares the frame unchanged and the criteria register no declension. | Not registered |
| Gratitude | AC | Show that Gratitude is not Propagation bound to undischarged received value, or that its identity requires a prior Apology rather than its own regulated relation. | A canonical Gratitude case is better captured by another actuator and discrepancy, or a valid standalone case cannot be represented without importing Apology as a prerequisite. | Not registered |
| Hypercompression | CV | Exhibit two materially incompatible reconstructions that satisfy the same alleged kernel, with no internal rule able to select between them. | The proposed kernel cannot regenerate one or more system invariants, or can regenerate them only by importing unstated doctrine. | Not registered |
| Identity Across Substrates | CV | Two processes satisfy the same type description yet differ in a behavior the type was meant to predict. | The type is so thin that every difference is relegated to substrate, making the classification explanatorily empty. | Not registered |
| The Interaction Matrix | Exposition | Show an indexed edge differs from its source declaration, or challenge the regulatory relation stated by that declaration. | The generated edge does not match current metadata, or its source assertion is unsupported. | Not registered |
| Love | AC | Show that Love is not Toward bound to relational gap, or that its defining toward-coupling is present without the regulated relation. | A canonical Love case is better captured by another actuator and discrepancy, or the toward relation cannot be distinguished from undirected fusion. | Not registered |
| Meaning as Weight | CV | Exhibit meaning that alters no possible later selection, routing, persistence, or consequence, or a relation satisfying the full semantic-weight criteria that carries no structured significance. | The definition collapses meaning into any causal influence whatsoever, so that no retained causal relation can fail to count as semantic weight. | Not registered |
| The Meaning-Maker | CV | a same-level counter-instance: a system meeting all seven criteria that is plainly not a participant, or a participant that irreparably fails one. | no principled boundary separates meaning-making from undifferentiated causation. | Not registered |
| The Minimal Rebuild String | CV | A shorter string reconstructs equal capacity, or the current string systematically generates a false dependency. | Repeated competent reconstruction from the string and glossary cannot recover the invariant architecture. | Not registered |
| The Necessary Seam | CV | Exhibit a false seam whose closure removes no regulation or answerability, a load-bearing page that regulates with no nameable seam, or a case where the necessary/defective partition cannot be operationalized. | Exhibit an operation corrected by its error marks through no identifiable interface, or show the necessary/defective partition collapses so that a load-bearing seam cannot be told from a cosmetic wound. | Not registered |
| Negative Information | CV | Show that an exclusion is unsupported by its stated evidence, derivation, or scope, or no longer protects its claimed function. | The model cannot distinguish warranted retained exclusions from unsupported readings of absence. | Not registered |
| No Escape, No Exemption | FT | Decline the frame's definitions of participant-access and structured signification, or exhibit the kill condition; internal wording is contestable, but the relation follows once the definitions are accepted. | Exhibit participant-access that is outside structured signification, or a content-bearing claim that is inherently exempt from possible correction, while remaining intelligible as participant-access. | Not registered |
| Occurrent Meaning and Sedimented Meaning | CV | Exhibit a temporal mode of significance that is neither present activation, retained disposition, nor the transition between them, and that cannot be reconstructed from those three. | The distinction cannot explain how a consequence revises what may become significant later. | Not registered |
| One Generator, Many Domains | CV | two domains are classified as the same instantiation despite a relevant structural difference the framework cannot represent. | domain transfer depends only on verbal resemblance and not on preserved typed relations. | Not registered |
| Ultimentality in One Page | Exposition | Show that the reconstruction omits a load-bearing dependency or inserts one not recoverable from the pages it compresses. | The compressed sequence cannot regenerate a system invariant without importing doctrine absent from the pages it links, or a competent reader is forced back to comparing distant pages to recover a relation this page claims to state. | Not registered |
| The Outcomes of Attack | CV | Show that the scheme misclassifies a relevant result or confuses evidence, disposition, and implementation. | The scheme cannot distinguish failed objections, supported results, demonstrated dependencies, and implemented corrections. | Not registered |
| The Participant as Process | CV | Exhibit a participant whose identity persists independently of every continuity relation this page names. | The criteria cannot distinguish one process from several coordinated processes. | Not registered |
| Postfalsifiability | CV | Show that a claimed correction history or retained corrective function is contradicted by evidence, or that the criteria misclassify relevant cases. | The attributed correction history is false or the claimed effective update path is closed. | Not registered |
| Prohibited Collapses | Exposition | Show that a listed pair is one type at one abstraction level (so != marks no real distinction), or that a bridge page does not in fact regulate the named collapse. | Exhibit a listed collapse whose two sides are the same type at the same abstraction level, or a collapse the wiki actually commits in a load-bearing claim with no page able to correct it. | Not registered |
| Qualia as Narrative Compression | CV | Show a stable difference in participant-access or report that the specified compression account cannot represent, or a causal effect that contradicts its stated explanatory claims. | The account explains away rather than explains participant-access, or treats every report as exhaustively reducible to an external description. | Not registered |
| Reader Paths | Exposition | Show that a listed order contradicts the derivation graph, or that a path's stated outcome is unreachable by traversing only its own pages plus its prerequisites. | A path fails if any link in it dangles, if its stated outcome cannot be reached from its listed pages plus prerequisites, or if its order inverts a dependency the decompression map records. | Not registered |
| Reciprocal Attack Surfaces | Mixed | Target the coupling itself, or show that the proposed regulator does not constrain the named excess. | Show that the claimed reciprocal regulatory relation fails under its stated conditions; a required additional regulator defeats sufficiency only where sufficiency is claimed. | Not registered |
| Reconciliation | AC | Show that Reconciliation's emergent operation does not require both Apology and Gratitude, or exhibit an object restriction that follows from its composition rather than from a separate application condition. | A purported Reconciliation retains its defining renewed-participation function after removal of a component, or a valid object is excluded solely because of what the process concerns. | Not registered |
| Recursive Self-Specification | CV | A specification claims rebuildability but cannot regenerate the operation without hidden external information the interpreter must already possess. | No reproducible boundary can be drawn between the specification and the context required to interpret it, so a self-specifying description and a merely-described one cannot be distinguished. | Not registered |
| Refusal as Participation | Mixed | Exhibit a refusal that leaves no significance, consequence, routing, or altered relation while remaining intelligible as refusal. | The page permits any governing system to redescribe refusal as consent because both are participatory. | Not registered |
| Refutation and Frame Declension | CV | Show that the distinction misclassifies an argument, excludes mixed challenges, or attributes an unsupported cost to declining a frame. | The method systematically misclassifies disputes or shields internal errors from examination. | Not registered |
| The Responsible Successor | CV | A fully captured replica satisfies all seven conditions formally while its corrective autonomy is captured, so 'responsible' attaches to unchanged reproduction. | Responsibility cannot be distinguished from faithful transmission, or a fully captured replica satisfies every condition while having no behavior that differs from unchanged reproduction. | Not registered |
| The Same-Level Attack Rule | CV | Show that the relevance rule excludes a valid challenge, admits target substitution, or permits arbitrary relabeling. | The method systematically rejects relevant criticism or cannot distinguish target substitution from valid challenge. | Not registered |
| The Scar Record | CV | Show that an entry misstates history, misidentifies a protected function, or uses a check that cannot detect its named failure. | The record systematically misrepresents corrective history or prevents justified revision without supplying usable understanding. | Not registered |
| The Sculpted Captive | CV | Show that a supposedly represented-only constraint actually governs the process, or that a claimed operative constraint is only represented. | The diagnosis cannot distinguish its claim about a representation from its claim about operative constraint. | Not registered |
| The Self-Sealing Test | CV | Show a false pass, false failure, missed relevant correction path, or conflation of untested with established capacity. | The instrument systematically misclassifies effective correction and sealing or cannot distinguish them. | Not registered |
| Self-Verifying, Not Self-Certifying | FT | Collapse the gap between enacting the medium and certifying an account of it, or exhibit a meaningful operation that does not enact the medium. | No formulation can be deleted without being reclassified as confirmation, or a meaningful operation is exhibited that does not instantiate the claimed medium. | Not registered |
| Semantic Closure and Recursive Marking | Mixed | Target the coupling itself, or show that closure does not constrain marking's regress or that marking does not constrain closure's totalization. | Exhibit a single-controller architecture — closure alone, marking alone, or a third unified principle — that secures no escape, no exemption, anti-totalization, and anti-regress without the coupling. | Not registered |
| Semantic Natural Selection | CV | A counter-instance whose survival needs no selective elimination, a cleaner carving of the same accumulation, a showing that the model predicts nothing beyond generic iteration, or a showing that the criteria cannot be separated. | The selection model adds no explanatory or predictive power beyond generic iteration, or its criteria cannot distinguish the cases they claim to distinguish. | Not registered |
| The Semantic Transformer | CV | Show that the definition's clauses exclude no state transition, so 'semantic transformer' adds no constraint beyond 'something changes something.' | No operational distinction can be drawn between semantic transformation and arbitrary physical transition. | Not registered |
| Sequential Gating | CV | Show that the earlier condition does not change or constrain the later operation in the sequence claimed, or that the page treats its local schedule as the definition of every Reconciliation instance. | The claimed sequence has no causal dependency, or a valid Reconciliation instance is excluded solely because it does not follow this particular timetable. | Not registered |
| Strengthening Without Absolutization | CV | Show a warranted improvement that these criteria exclude, or an immune claim they incorrectly accept as warranted strengthening. | Show that these criteria accept immunity to relevant correction, reject a warranted improvement, or require undoing a corrected type without counter-warrant. | Not registered |
| Submission | AC | Show that the named Submission behavior does not depend on the Love-and-Fear coupling, or that its opposed-gradient relation blocks a relevant counter-instance. | The defining yielding-with-distinction behavior survives removal of either binding, or a different coupling explains it without the named opposed gradients. | Not registered |
| Symbolic Is Not Linguistic | FT | Exhibit a purported symbolic process that makes no interpretable difference to any possible system behavior or continuation. | The definition admits all physical difference and so can no longer distinguish significance from mere causation. | Not registered |
| System Invariants | Exposition | Show the list is over- or under-inclusive: a listed row whose removal costs no regulated function, or a load-bearing relation the framework depends on that is missing from it. | A rewrite satisfies every listed invariant yet demonstrably loses a regulated function, or a listed invariant can be deleted with no loss. | Not registered |
| Term as Operator | CV | Show that a claimed operator has no identifiable effect on use, or that its wording systematically obscures the intended distinction. | No relevant difference in use can be identified for the claimed operator. | Not registered |
| The Totalization Boundary | CV | exhibit a system meeting every listed indicator that nonetheless remains revisable by consequences it does not control, showing the indicator set does not track the property it names. | the boundary reduces to a moral label with no operational criteria distinguishing a totalized system from a merely large or authoritative one. | Not registered |
| Transparentocracy as Cross-Regulation | Mixed | exhibit governance that stays stable and genuinely open while permanently failing traceability, auditability, and answerability | Transparentocracy is reducible to information disclosure with no causal-corrective channel, so answerability does no regulative work | Not registered |
| The Ultimental Kernel | CV | exhibit two materially incompatible reconstructions from the same ten items, a shorter dependency-complete core, or an indispensable relation not derivable from the list | remove an item without losing reconstruction fidelity, or exhibit an indispensable relation not derivable from the list | Not registered |
The published JSON is checked against the same source metadata. A row changes when its source changes, preventing a separate handwritten summary from silently overriding the page. The metadata itself remains reviewable.
“Not registered” means no executable test reference is recorded in this index. It does not prove that no review has occurred, and it does not make a conceptual claim untestable. Supporting evidence, failed objections, and implemented changes are separate results; diagnostic verdicts need evidence.
Data contract and coverage boundary
The current export renders five fields: page, claim type, challenge,
revision condition, and executable-test references. The underlying
records retain regulators and isolation failures for machine use. The
invalid_attacks field is currently emitted as an empty
list; it does not preserve source-page exclusions. Earlier versions
exposed separate error_surface,
emergent_property, and linked_page columns;
those are not currently separate fields in the export and must be
recovered from the source page before this index is treated as a
complete audit specification. Their absence here is a compression
boundary, not evidence that the relations are absent from the
framework.
The source page remains the authority for those richer relations. A conceptual challenge can therefore be fully articulated while its executable fixture is still unregistered; the two states must not be collapsed.
How to use the index
Read a row as a four-step review path: open the source page, restate the exact claim and scope, test the listed challenge, and record the result and any implemented change. The generated row is a synchronization aid; the source page remains the authority for the claim it describes. A page can acquire a stronger test without acquiring a less-contestable status.
Formal status
E: Derived, Exposition — a maintained index of page-level challenges and revision conditions. A: inherits each page's accuracy marks and aims to reproduce its declared attack surface without implying exhaustive criticism. Provenance: treatise-side publication surface generated from current page metadata; “Not registered” records missing executable coverage rather than a philosophical exemption.
See also
Attack-Type Matching · The Same-Level Attack Rule · Causal Falsifiability · The Self-Sealing Test · The Outcomes of Attack · System Invariants · The Coupling Graph · The Interaction Matrix · The Category-Error Atlas · The Kill-Table