gm-skill 2.0.2573 → 2.0.2575

package/gm-plugkit/package.json

@@ -1,6 +1,6 @@
 {
   "name": "gm-plugkit",
-  "version": "2.0.2573",
+  "version": "2.0.2575",
   "description": "Bootstrap and daemon-spawn tool for gm plugkit binary. Downloads the correct platform wasm, verifies SHA256, and launches agentplug-runner (the native wasm host) as the spool watcher daemon.",
   "main": "index.js",
   "bin": {

package/gm.json

@@ -1,6 +1,6 @@
 {
   "name": "gm",
-  "version": "2.0.2573",
+  "version": "2.0.2575",
   "description": "Spool-dispatch orchestration engine with unified state machine, skills, and automated git enforcement",
   "author": "AnEntrypoint",
   "license": "MIT",

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "gm-skill",
-  "version": "2.0.2573",
+  "version": "2.0.2575",
   "description": "Canonical universal harness — AI-native software engineering via skill-driven orchestration; bootstraps plugkit for task execution and session isolation. Install in any AI coding agent host.",
   "author": "AnEntrypoint",
   "license": "MIT",

package/scripts/scan-dev-tree-chunked.mjs

@@ -0,0 +1,57 @@
+#!/usr/bin/env node
+// Runs scan-supply-chain-tells.mjs once PER top-level project directory under
+// a root, appending each project's result to a progress log immediately.
+// Resumable: projects already present in the progress log are skipped on a
+// re-run, so a kill/timeout never loses completed work and a re-invocation
+// picks up where it left off.
+//
+// Usage: node scripts/scan-dev-tree-chunked.mjs <root> <progressLogPath>
+
+import fs from 'node:fs'
+import path from 'node:path'
+import { execFileSync } from 'node:child_process'
+import process from 'node:process'
+
+const root = process.argv[2]
+const logPath = process.argv[3]
+const scannerPath = path.join(path.dirname(new URL(import.meta.url).pathname.replace(/^\/([A-Za-z]:)/, '$1')), 'scan-supply-chain-tells.mjs')
+
+if (!root || !logPath) {
+  console.error('usage: node scan-dev-tree-chunked.mjs <root> <progressLogPath>')
+  process.exit(2)
+}
+
+const already = new Set()
+if (fs.existsSync(logPath)) {
+  const prior = fs.readFileSync(logPath, 'utf8')
+  for (const m of prior.matchAll(/^=== (.+?) ===$/gm)) already.add(m[1])
+}
+
+const entries = fs.readdirSync(root, { withFileTypes: true })
+  .filter(e => e.isDirectory())
+  .map(e => e.name)
+  .sort()
+
+console.error(`${entries.length} project dirs under ${root}, ${already.size} already scanned per ${logPath}`)
+
+for (const name of entries) {
+  if (already.has(name)) continue
+  const target = path.join(root, name)
+  const start = Date.now()
+  let out, code
+  try {
+    out = execFileSync('node', [scannerPath, target], { encoding: 'utf8', maxBuffer: 64 * 1024 * 1024, timeout: 180000 })
+    code = 0
+  } catch (err) {
+    out = err.stdout || ''
+    code = err.status ?? (err.signal ? 'killed:' + err.signal : 1)
+  }
+  const ms = Date.now() - start
+  const block = `=== ${name} ===\n(exit ${code}, ${ms}ms)\n${out.trim()}\n\n`
+  fs.appendFileSync(logPath, block)
+  const lastSummaryLine = out.trim().split('\n').pop() || ''
+  const isClean = /: 0 finding/.test(lastSummaryLine)
+  console.error(`[${isClean ? 'clean' : 'FINDINGS'}] ${name} (${ms}ms)`)
+}
+
+console.error('done')

package/scripts/scan-supply-chain-tells.mjs

@@ -17,6 +17,11 @@ import process from 'node:process'
 const SKIP_DIRS = new Set([
   'node_modules', '.git', 'dist', 'build', '.next', 'vendor', '.cache',
   '.svelte-kit', '.nuxt', '.output', '.turbo', 'out', 'coverage', '.parcel-cache',
+  // Vendored/third-party binary trees this scanner isn't meant to police --
+  // a browser profile's installed extensions are third-party code the user
+  // didn't write and can't fix here; a real backdoor concern in a project's
+  // OWN code should never be diluted by noise from a bundled Chrome profile.
+  '.plugkit-browser-profile', '.plugkit-agent-worktree', '.wwebjs_auth', '.wwebjs_cache',
 ])
 // Code files only. JSON/YAML/MD routinely carry legitimate non-Latin natural-
 // language text (Cyrillic, Greek, CJK, etc.) which is indistinguishable from a
@@ -136,6 +141,9 @@ function walk(dir, out) {
   }
   for (const e of entries) {
     if (SKIP_DIRS.has(e.name)) continue
+    // Hash/timestamp-suffixed variants of the same vendored-profile dirs
+    // (e.g. .plugkit-browser-profile-<id>) -- prefix match on the same names.
+    if (e.name.startsWith('.plugkit-browser-profile') || e.name.startsWith('.plugkit-browser-chrome-profile') || e.name.startsWith('.plugkit-agent-worktree')) continue
     const p = path.join(dir, e.name)
     if (e.isDirectory()) {
       walk(p, out)
@@ -234,24 +242,30 @@ function main() {
     else files.push(root)
   }
 
-  const allFindings = []
-  for (const f of files) {
-    allFindings.push(...scanFile(f))
-  }
-
-  if (!allFindings.length) {
-    console.log(`scan-supply-chain-tells: clean (${files.length} files scanned)`)
-    process.exit(0)
+  // Stream findings as each file is scanned (never buffer until the end) so a
+  // kill/timeout mid-run still leaves a partial, readable, useful result on
+  // disk instead of losing everything. Progress heartbeat every 200 files so
+  // a long run's liveness is visible without waiting for a finding.
+  let totalFindings = 0
+  const filesWithFindings = new Set()
+  for (let idx = 0; idx < files.length; idx++) {
+    const f = files[idx]
+    const findings = scanFile(f)
+    for (const finding of findings) {
+      totalFindings++
+      filesWithFindings.add(finding.filePath)
+      const loc = finding.line ? `:${finding.line}` : ''
+      const label = finding.sig || finding.name
+      console.log(`[${finding.kind}] ${finding.filePath}${loc} — ${label}`)
+      console.log(`    ${finding.why}`)
+    }
+    if ((idx + 1) % 200 === 0) {
+      console.error(`... scanned ${idx + 1}/${files.length} files, ${totalFindings} finding(s) so far`)
+    }
   }
 
-  console.log(`scan-supply-chain-tells: ${allFindings.length} finding(s) across ${new Set(allFindings.map(f => f.filePath)).size} file(s)\n`)
-  for (const f of allFindings) {
-    const loc = f.line ? `:${f.line}` : ''
-    const label = f.sig || f.name
-    console.log(`[${f.kind}] ${f.filePath}${loc} — ${label}`)
-    console.log(`    ${f.why}`)
-  }
-  process.exit(1)
+  console.log(`\nscan-supply-chain-tells: ${totalFindings} finding(s) across ${filesWithFindings.size} file(s) (${files.length} files scanned total)`)
+  process.exit(totalFindings ? 1 : 0)
 }
 
 main()

package/skills/gm-semantic-anchors/SKILL.md

@@ -1,262 +0,0 @@
----
-name: gm-semantic-anchors
-description: The nonlinear backreferencing graph of every named technique gm's 9-phase prose already invokes (SPECIFY through UPDATE_DOCS), cross-referenced against the llm-coding/Semantic-Anchors catalog, plus the well-known techniques that catalog is missing. Primes gm's own fsm-propose-override self-reconfiguration: a proposed prose/graph override cites the anchor it strengthens or the gap it closes, not a bare paraphrase.
-allowed-tools: Skill, Read, Write
----
-
-# gm-semantic-anchors
-
-A semantic anchor is a named, attributed technique from well-known literature that activates an LLM's existing knowledge of that technique precisely and compactly -- "Use TDD, London School" over "write tests first, mock dependencies, work outside-in" (llm-coding/Semantic-Anchors, `what-qualifies-as-a-semantic-anchor`). gm's own phase prose already runs on this principle: each phase's "Preferences (named, narrow)" section is a curated anchor list. This skill is that list expressed as one graph, cross-checked against the public Semantic-Anchors reference (191 anchors, `github.com/llm-coding/Semantic-Anchors`), so a `fsm-propose-override` self-reconfiguration proposal can cite a precise anchor instead of composing new prose from scratch.
-
-## Why this exists
-
-`fsm-propose-override` (rs-plugkit, `orchestrator/fsm_propose.rs`) lets a session write its own `.gm/instructions/<key>.md` or `fsm/graph.json` override when `self-reconfig-candidate` fires. A proposal grounded in an attributed, well-known technique is falsifiable and reviewable; a proposal that paraphrases a vague intuition is not. This graph is the lookup table: given a phase and a friction pattern, which anchor already names the fix, and which anchors does it backreference for a fuller picture.
-
-## The graph
-
-99 anchors: 93 cross-matched by exact id against the public Semantic-Anchors catalog, 6 added because they are well-known, well-attributed techniques gm's own CONC (concurrency/performance) and RES (resilience)/STATE (correctness) phases depend on but the catalog does not yet list. Edges are the catalog's own `:related:` backreference field where fetched live from `docs/anchors/<id>.adoc`; nodes are grouped by the gm phase that names them, which is itself a valid nonlinear grouping axis (an anchor can serve a phase other than the one gm currently files it under).
-
-```mermaid
-flowchart LR
-  subgraph specify["SPECIFY"]
-    solid_principles["SOLID Principles<br/><small>Robert C. Martin</small>"]
-    solid_srp["SOLID-SRP<br/><small>Robert C. Martin</small>"]
-    clean_architecture["Clean Architecture<br/><small>Robert C. Martin</small>"]
-    vertical_slice_architecture["Vertical Slice Architecture<br/><small>Jimmy Bogard</small>"]
-    mikado_method["Mikado Method<br/><small>Ola Ellnestam</small>"]
-    spike_solution["Spike Solution<br/><small>Kent Beck</small>"]
-    thin_vertical_slice["Thin Vertical Slice<br/><small>Alistair Cockburn</small>"]
-    xy_problem["XY Problem Avoidance<br/><small>Mark Jason Dominus</small>"]
-    cynefin_framework["Cynefin Framework<br/><small>Dave Snowden</small>"]
-    wardley_mapping["Wardley Mapping<br/><small>Simon Wardley</small>"]
-    jobs_to_be_done["Jobs To Be Done<br/><small>Clayton Christensen</small>"]
-    occams_razor["Occam's Razor<br/><small>William of Ockham</small>"]
-    first_principles_thinking["First Principles Thinking<br/><small>Aristotle</small>"]
-    five_whys["Five Whys<br/><small>Taiichi Ohno</small>"]
-    feynman_technique["Feynman Technique<br/><small>Richard Feynman</small>"]
-    morphological_box["Morphological Box<br/><small>Fritz Zwicky</small>"]
-    swot["SWOT<br/><small>Albert Humphrey</small>"]
-    pugh_matrix["Pugh Matrix<br/><small>Stuart Pugh</small>"]
-    mece["MECE<br/><small>Barbara Minto</small>"]
-    ears_requirements["EARS<br/><small>Alistair Mavin</small>"]
-    invest["INVEST<br/><small>Bill Wake</small>"]
-    cockburn_use_cases["Cockburn Use Cases<br/><small>Alistair Cockburn</small>"]
-    prd["PRD<br/><small>Product Management Convention</small>"]
-    devils_advocate["Devil's Advocate<br/><small>Catholic Canonization Process</small>"]
-    goodharts_law["Goodhart's Law<br/><small>Charles Goodhart</small>"]
-    pert["PERT<br/><small>US Navy</small>"]
-    adr_according_to_nygard["ADR<br/><small>Michael Nygard</small>"]
-    quality_attribute_scenario["Quality Attribute Scenario<br/><small>Software Architecture Convention</small>"]
-    moscow["MoSCoW<br/><small>Dai Clegg</small>"]
-  end
-  subgraph prove["PROVE"]
-    chain_of_thought["Chain-of-Thought Reasoning<br/><small>Wei</small>"]
-  end
-  subgraph emit["EMIT"]
-    dry["DRY<br/><small>Andy Hunt</small>"]
-    kiss_principle["KISS Principle<br/><small>Kelly Johnson</small>"]
-    yagni["YAGNI<br/><small>Ron Jeffries</small>"]
-    single_level_of_abstraction_principle["SLAP<br/><small>Kent Beck</small>"]
-    law_of_demeter["Law of Demeter<br/><small>Ian Holland</small>"]
-    code_smells["Code Smells<br/><small>Kent Beck</small>"]
-    cohesion_criteria["Cohesion Criteria<br/><small>Larry Constantine</small>"]
-    iosp["IOSP<br/><small>Ralf Westphal</small>"]
-    mental_model_according_to_naur["Programming as Theory Building<br/><small>Peter Naur</small>"]
-    sota["SOTA<br/><small>General Convention</small>"]
-    effective_go["Effective Go<br/><small>The Go Team</small>"]
-    conways_law["Conway's Law<br/><small>Melvin Conway</small>"]
-    grasp["GRASP<br/><small>Craig Larman</small>"]
-    solid_dip["SOLID-DIP<br/><small>Robert C. Martin</small>"]
-    hexagonal_architecture["Hexagonal Architecture<br/><small>Alistair Cockburn</small>"]
-    arc42["arc42<br/><small>Peter Hruschka</small>"]
-    cap_theorem["CAP Theorem<br/><small>Eric Brewer</small>"]
-    fallacies_of_distributed_computing["Fallacies of Distributed Computing<br/><small>Peter Deutsch</small>"]
-    event_driven_architecture["Event-Driven Architecture<br/><small>Distributed Systems Convention</small>"]
-    walking_skeleton["Walking Skeleton<br/><small>Alistair Cockburn</small>"]
-    gof_facade_pattern["GoF-Facade<br/><small>Gamma Helm Johnson Vlissides</small>"]
-    gof_adapter_pattern["GoF-Adapter<br/><small>Gamma Helm Johnson Vlissides</small>"]
-    gof_chain_of_responsibility_pattern["GoF-Chain of Responsibility<br/><small>Gamma Helm Johnson Vlissides</small>"]
-    gof_observer_pattern["GoF-Observer<br/><small>Gamma Helm Johnson Vlissides</small>"]
-    gof_strategy_pattern["GoF-Strategy<br/><small>Gamma Helm Johnson Vlissides</small>"]
-    bem_methodology["BEM Methodology<br/><small>Yandex</small>"]
-    conventional_commits["Conventional Commits<br/><small>Community Specification</small>"]
-    github_flow["GitHub Flow<br/><small>GitHub</small>"]
-  end
-  subgraph state["STATE"]
-    fagan_inspection["Fagan Inspection<br/><small>Michael Fagan</small>"]
-    property_based_testing["Property-Based Testing<br/><small>Koen Claessen</small>"]
-    mutation_testing["Mutation Testing<br/><small>Richard Lipton</small>"]
-    red_green_tdd["Red/Green TDD<br/><small>Kent Beck</small>"]
-    tdd_chicago_school["TDD Chicago School<br/><small>Chicago/Detroit Tradition</small>"]
-    test_double_meszaros["Test Double<br/><small>Gerard Meszaros</small>"]
-    testing_pyramid["Testing Pyramid<br/><small>Mike Cohn</small>"]
-  end
-  subgraph conc["CONC"]
-  end
-  subgraph sec["SEC"]
-    owasp_top_10["OWASP Top 10<br/><small>OWASP Foundation</small>"]
-    stride["STRIDE Threat Model<br/><small>Loren Kohnfelder</small>"]
-    postels_law["Postel's Law<br/><small>Jon Postel</small>"]
-    linddun["LINDDUN Privacy Threat Model<br/><small>KU Leuven</small>"]
-    iec_61508_sil_levels["IEC 61508 SIL Levels<br/><small>IEC</small>"]
-    regulated_environment["Regulated Environment<br/><small>Compliance Convention</small>"]
-  end
-  subgraph res["RES"]
-    site_reliability_engineering["Site Reliability Engineering<br/><small>Ben Treynor</small>"]
-  end
-  subgraph decide["DECIDE"]
-    definition_of_done["Definition of Done<br/><small>Ken Schwaber</small>"]
-    llm_evaluations["LLM-Evaluations<br/><small>LLM Evaluation Practice</small>"]
-    iso_25010["ISO/IEC 25010<br/><small>ISO</small>"]
-    control_chart_shewhart["Control Chart<br/><small>Walter Shewhart</small>"]
-    nelson_rules["Nelson Rules<br/><small>Lloyd S. Nelson</small>"]
-    spc["SPC<br/><small>Walter Shewhart / W. Edwards Deming</small>"]
-  end
-  subgraph update_docs["UPDATE_DOCS"]
-    pyramid_principle["Pyramid Principle<br/><small>Barbara Minto</small>"]
-    bluf["BLUF<br/><small>US Military Doctrine</small>"]
-    inverted_pyramid_style["Inverted Pyramid Style<br/><small>Journalism Convention</small>"]
-    plain_english_strunk_white["Plain English<br/><small>William Strunk Jr</small>"]
-    aida_model["AIDA Model<br/><small>E. St. Elmo Lewis</small>"]
-    hemingway_bridge["Hemingway Bridge<br/><small>Ernest Hemingway</small>"]
-    diataxis_framework["Diataxis Framework<br/><small>Daniele Procida</small>"]
-    docs_as_code["Docs-as-Code<br/><small>Ralf D. Muller</small>"]
-    blooms_taxonomy["Bloom's Taxonomy<br/><small>Benjamin Bloom</small>"]
-  end
-  subgraph gaps["ADDED (missing from reference)"]
-    big_o_algorithmic_complexity["Big O Algorithmic Complexity<br/><small>Donald Knuth</small>"]:::gap
-    data_oriented_design["Data-Oriented Design<br/><small>Mike Acton</small>"]:::gap
-    mechanical_sympathy["Mechanical Sympathy<br/><small>Martin Thompson</small>"]:::gap
-    zero_cost_abstractions["Zero-Cost Abstractions<br/><small>Bjarne Stroustrup</small>"]:::gap
-    circuit_breaker["Circuit Breaker<br/><small>Michael Nygard</small>"]:::gap
-    mental_model_illegal_states["Make Illegal States Unrepresentable<br/><small>Yaron Minsky</small>"]:::gap
-  end
-  big_o_algorithmic_complexity -.->|belongs to| conc
-  data_oriented_design -.->|belongs to| conc
-  mechanical_sympathy -.->|belongs to| conc
-  zero_cost_abstractions -.->|belongs to| conc
-  circuit_breaker -.->|belongs to| res
-  mental_model_illegal_states -.->|belongs to| state
-
-  dry -.-> single_level_of_abstraction_principle
-  dry -.-> kiss_principle
-  dry -.-> yagni
-  kiss_principle -.-> yagni
-  kiss_principle -.-> solid_principles
-  yagni -.-> tdd_chicago_school
-  solid_principles -.-> clean_architecture
-  cynefin_framework -.-> wardley_mapping
-  xy_problem -.-> bluf
-  five_whys -.-> xy_problem
-  five_whys -.-> first_principles_thinking
-  mece -.-> pyramid_principle
-  mece -.-> bluf
-  mece -.-> morphological_box
-  adr_according_to_nygard -.-> arc42
-  mikado_method -.-> tdd_chicago_school
-  spike_solution -.-> walking_skeleton
-  spike_solution -.-> pugh_matrix
-  clean_architecture -.-> hexagonal_architecture
-  solid_srp -.-> solid_principles
-  solid_srp -.-> single_level_of_abstraction_principle
-  arc42 -.-> quality_attribute_scenario
-  conways_law -.-> cohesion_criteria
-  conways_law -.-> vertical_slice_architecture
-  grasp -.-> solid_principles
-  grasp -.-> clean_architecture
-  gof_observer_pattern -.-> gof_strategy_pattern
-  conventional_commits -.-> github_flow
-  conventional_commits -.-> definition_of_done
-  chain_of_thought -.-> first_principles_thinking
-  chain_of_thought -.-> feynman_technique
-  owasp_top_10 -.-> regulated_environment
-  owasp_top_10 -.-> iec_61508_sil_levels
-  stride -.-> owasp_top_10
-  stride -.-> regulated_environment
-  definition_of_done -.-> moscow
-  pyramid_principle -.-> bluf
-  pyramid_principle -.-> inverted_pyramid_style
-  bluf -.-> inverted_pyramid_style
-  bluf -.-> plain_english_strunk_white
-  occams_razor -.-> kiss_principle
-  occams_razor -.-> yagni
-  occams_razor -.-> five_whys
-  occams_razor -.-> mece
-  occams_razor -.-> devils_advocate
-  first_principles_thinking -.-> feynman_technique
-  wardley_mapping -.-> swot
-  invest -.-> moscow
-  ears_requirements -.-> cockburn_use_cases
-  ears_requirements -.-> invest
-  cockburn_use_cases -.-> arc42
-  cockburn_use_cases -.-> iso_25010
-  pert -.-> moscow
-  goodharts_law -.-> llm_evaluations
-  property_based_testing -.-> mutation_testing
-  property_based_testing -.-> testing_pyramid
-  mutation_testing -.-> testing_pyramid
-  red_green_tdd -.-> tdd_chicago_school
-  testing_pyramid -.-> tdd_chicago_school
-  fagan_inspection -.-> mutation_testing
-  fagan_inspection -.-> testing_pyramid
-  docs_as_code -.-> diataxis_framework
-  docs_as_code -.-> arc42
-  docs_as_code -.-> conventional_commits
-  diataxis_framework -.-> arc42
-  diataxis_framework -.-> inverted_pyramid_style
-  morphological_box -.-> pugh_matrix
-  swot -.-> pugh_matrix
-  swot -.-> moscow
-  devils_advocate -.-> five_whys
-  site_reliability_engineering -.-> five_whys
-  site_reliability_engineering -.-> spc
-  site_reliability_engineering -.-> control_chart_shewhart
-  vertical_slice_architecture -.-> clean_architecture
-  vertical_slice_architecture -.-> hexagonal_architecture
-  thin_vertical_slice -.-> walking_skeleton
-  thin_vertical_slice -.-> vertical_slice_architecture
-  walking_skeleton -.-> clean_architecture
-  walking_skeleton -.-> hexagonal_architecture
-  fallacies_of_distributed_computing -.-> cap_theorem
-  fallacies_of_distributed_computing -.-> event_driven_architecture
-  fallacies_of_distributed_computing -.-> hexagonal_architecture
-  cap_theorem -.-> event_driven_architecture
-  event_driven_architecture -.-> hexagonal_architecture
-  event_driven_architecture -.-> clean_architecture
-  postels_law -.-> solid_principles
-  postels_law -.-> event_driven_architecture
-  linddun -.-> owasp_top_10
-  linddun -.-> regulated_environment
-
-  classDef gap fill:#ffe4b3,stroke:#c77700,stroke-width:2px
-```
-
-## Reading the graph
-
-- **Solid subgraph membership** = the gm phase whose prose already names this anchor (`gm-config/prose/<phase>.md`, `Preferences (named, narrow)`).
-- **Dotted edges** = a real `:related:` backreference pulled live from `llm-coding/Semantic-Anchors`'s `docs/anchors/<id>.adoc` source, not invented. An edge existing means the two anchors compose: a proposal citing one should check the other.
-- **`gaps` subgraph (orange)** = well-known, well-attributed techniques in real literature that gm's prose already depends on (CONC's whole performance vocabulary; RES's Circuit Breaker; STATE's illegal-states principle) but that are absent from the public Semantic-Anchors catalog as of this graph's construction. `CONC`'s own subgraph is empty for exactly this reason -- every anchor CONC currently names is a gap, not yet catalogued upstream.
-
-## The 6 gaps, for upstream contribution
-
-| id | name | author | belongs to |
-| --- | --- | --- | --- |
-| `big-o-algorithmic-complexity` | Big O Algorithmic Complexity | Donald Knuth | CONC |
-| `data-oriented-design` | Data-Oriented Design | Mike Acton | CONC |
-| `mechanical-sympathy` | Mechanical Sympathy | Martin Thompson | CONC |
-| `zero-cost-abstractions` | Zero-Cost Abstractions | Bjarne Stroustrup | CONC |
-| `circuit-breaker` | Circuit Breaker | Michael Nygard | RES |
-| `mental-model-illegal-states` | Make Illegal States Unrepresentable | Yaron Minsky | STATE |
-
-These are candidates for a PR against `llm-coding/Semantic-Anchors` (`docs/anchors/<id>.adoc`, following the existing frontmatter shape: `:categories:`, `:roles:`, `:proponents:`, `:tags:`, `:related:`, `:tier:`, `:definition:`), not a fork -- the catalog is a shared reference, and gm benefits from every project's anchor set staying converged on one upstream source rather than diverging per project.
-
-## Using this graph to prime self-reconfiguration
-
-When `self-reconfig-candidate` fires (a gate denial repeating past `policy.gate_repeat_escalate_threshold`), before composing an `fsm-propose-override` proposal:
-
-1. Identify which phase the friction occurred in.
-2. Walk that phase's subgraph here for an anchor that already names the missing discipline.
-3. Follow its dotted edges one hop -- the adjacent anchors are the ones a reviewer will expect the proposal to also account for.
-4. If nothing in the graph names the gap, that is itself signal: the friction is either genuinely novel (write the override in gm's own voice) or names a technique missing from both gm's prose and the upstream catalog (add it to the gaps table above, and consider it for the same upstream PR).
-
-A proposal that cites an anchor id from this graph is reviewable against real, external, authored literature. A proposal that doesn't is asking a reviewer to trust prose alone -- exactly the gap `fsm-propose-override`'s `AskUserQuestion` authority guard exists to catch for graph/hook-bearing overrides, and the same discipline is worth applying informally to prose-only overrides too.