memtrace-skills 0.8.63 → 1.0.0

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "memtrace-skills",
-  "version": "0.8.63",
+  "version": "1.0.0",
   "description": "Memtrace skills for AI coding agents — codebase exploration, temporal evolution, impact analysis, and more.",
   "type": "module",
   "bin": {

package/plugins/memtrace-skills/.claude-plugin/plugin.json

@@ -1,7 +1,7 @@
 {
   "name": "memtrace-skills",
   "description": "Memtrace skills for codebase exploration, code search, relationship analysis, temporal evolution, blast radius impact, code quality, graph algorithms, API topology, GitHub PR code review, multi-agent fleet coordination (branch-scoped intents, conflict classification, and agent-judged Class C resolution), and multi-step workflows for change impact, incident investigation, refactoring, session continuity, co-change analysis, and episode replay, Cortex decision memory (decision recall, provenance, intent verification), session bookends (daily briefing, hotspots, self-audit), and single-symbol pre-edit preflight checks.",
-  "version": "0.8.63",
+  "version": "1.0.0",
   "author": {
     "name": "Syncable",
     "email": "support@syncable.dev"

package/plugins/memtrace-skills/references/mcp-parameters.md

@@ -253,8 +253,15 @@ Returns `cochanged_files[]` with `file_path`, `cochange_count`, `last_cochanged_
 | `repo_id` | string | yes | — | |
 | `branch` | string | no | `"main"` | |
 | `include_tests` | boolean | no | `false` | |
-| `limit` | integer | no | `50` | |
-| `kinds` | array of string | no | all | Filter, e.g. `["Function","Method"]` |
+| `limit` | integer | no | `20` (capped at 200) | |
+| `include_historical` | boolean | no | `false` | `true` includes tombstoned-at-HEAD symbols |
+| `as_of_micros` | integer | no | now | Anchor for HEAD-only filter |
+| `min_confidence` | string | no | `"low"` | `"high"` \| `"medium"` \| `"low"` — filter by confidence band |
+
+Dead candidates are Function/Method nodes **unreachable from roots** (exported /
+`main` / HANDLES / `trait_impl` / framework allowlists) via forward
+CALLS/REFERENCES/MAKES_API_CALL. Each result includes `confidence`,
+`confidence_score`, and `reason: "unreachable from roots"`.
 
 ### `find_most_complex_functions`
 | Field | Type | Required | Default |

package/plugins/memtrace-skills/skills/memtrace-quality/SKILL.md

@@ -11,7 +11,7 @@ Code quality via graph analysis — dead code, complexity hotspots, repository s
 
 | Tool | Purpose | Required | Key optional |
 |------|---------|----------|--------------|
-| `find_dead_code` | Zero-caller symbols | `repo_id` | `include_tests`, `limit`, `kinds[]` |
+| `find_dead_code` | Symbols unreachable from roots | `repo_id` | `include_tests`, `limit`, `min_confidence`, `include_historical` |
 | `find_most_complex_functions` | Ranked complexity hotspots | `repo_id` | **`top_n`** (def 20) — not `limit` |
 | `calculate_cyclomatic_complexity` | Score one symbol | `repo_id`, **`target`** | — |
 | `get_repository_stats` | Repository overview | `repo_id` | `branch` |
@@ -31,10 +31,20 @@ Full parameter spec for every Memtrace tool: `references/mcp-parameters.md` (bun
 ### 2. Dead code
 
 ```json
-{ "repo_id": "memdb", "include_tests": false, "limit": 50 }
+{ "repo_id": "memdb", "include_tests": false, "limit": 50, "min_confidence": "high" }
 ```
 
-Exported symbols and entry points excluded by default. Results are candidates, not proof — callers via dynamic dispatch or reflection are invisible to the graph; verify before deleting.
+`find_dead_code` seeds **roots** (`main`, exported symbols, HANDLES targets,
+`trait_impl`, Magalz/framework allowlists), BFS-walks CALLS / REFERENCES /
+MAKES_API_CALL forward, and reports Function/Method nodes **unreachable from
+roots**. Each row includes `confidence` (`high` / `medium` / `low`) and
+`confidence_score` (Skylos-style penalties for dynamic languages, ambiguous
+hook names, methods). Use `min_confidence: "high"` for CI-safe cleanup;
+omit or `"low"` to see all bands.
+
+Results are still candidates, not proof — unmodeled dynamic dispatch can look
+live or dead incorrectly. Verify before deleting. Prefer false-live over
+false-dead.
 
 ### 3. Complexity hotspots
 
@@ -61,7 +71,7 @@ Ordered by call-graph out-degree.
 
 | Result | Carries |
 |--------|---------|
-| Dead-code entry (`find_dead_code`) | Symbol name + kind with zero graph callers — e.g. `format_legacy` (Function) |
+| Dead-code entry (`find_dead_code`) | Name, kind, path, `reason` (`unreachable from roots`), `confidence`, `confidence_score` |
 | Complexity row (`find_most_complex_functions`) | Symbol, complexity score, risk level — e.g. `processOrder` — 27, Critical |
 | Single score (`calculate_cyclomatic_complexity`) | Cyclomatic complexity for `target` |
 | Stats (`get_repository_stats`) | Node counts by kind, edge counts, community and process counts for `repo_id`/`branch` |
@@ -70,6 +80,8 @@ Ordered by call-graph out-degree.
 
 | Mistake | Reality |
 |---------|---------|
+| Treating every dead-code row as deletable | Filter with `min_confidence: "high"`; still verify framework/dynamic use |
+| Assuming “no inbound edge” is the model | Dead means unreachable from roots, not merely unreferenced |
 | `find_most_complex_functions(limit: 10)` | Param is **`top_n`** |
 | `calculate_cyclomatic_complexity(symbol_id=...)` | Required param is **`target`** |
 | Only looking at the highest complexity | Medium-complexity functions that are growing (check `get_evolution`) are often more urgent |

package/plugins/memtrace-skills/skills/memtrace-refactoring-guide/SKILL.md

@@ -17,7 +17,7 @@ Run these three tools in parallel to build a candidate list:
 Call `find_most_complex_functions` with `top_n: 20`
 
 **b) Dead code:**
-Call `find_dead_code` to find unused symbols
+Call `find_dead_code` (prefer `min_confidence: "high"`) for symbols unreachable from roots
 
 **c) Architectural bottlenecks:**
 Call `find_bridge_symbols` to find chokepoints with too much responsibility
@@ -104,7 +104,7 @@ For each item, include:
 |-----------|--------|
 | Complex + volatile + high blast radius | Highest priority — but plan carefully; incremental approach |
 | Complex + stable + low blast radius | Can wait; refactor when you're already touching nearby code |
-| Dead code with zero callers | Run Cortex provenance/recall first; zero callers is not proof that no decision/contract keeps it |
+| Dead code (`unreachable from roots`, high confidence) | Run Cortex provenance/recall first; reachability is not proof that no decision/contract keeps it |
 | Bridge symbol with many dependents | Extract interface first, then refactor implementation behind it |
 | Symbol in cross-repo API | Coordinate with consumers; backward-compatible changes only |
 | Cortex returns a held ban/contract | Preserve it or ask before overriding it |

package/skills/commands/memtrace-quality.md

@@ -9,7 +9,7 @@ allowed-tools:
   - mcp__memtrace__get_evolution
 metadata:
   author: "Syncable <support@syncable.dev>"
-  version: "1.0.0"
+  version: "1.1.0"
   category: development
 user-invocable: true
 ---
@@ -22,7 +22,7 @@ Code quality via graph analysis — dead code, complexity hotspots, repository s
 
 | Tool | Purpose | Required | Key optional |
 |------|---------|----------|--------------|
-| `find_dead_code` | Zero-caller symbols | `repo_id` | `include_tests`, `limit`, `kinds[]` |
+| `find_dead_code` | Symbols unreachable from roots | `repo_id` | `include_tests`, `limit`, `min_confidence`, `include_historical` |
 | `find_most_complex_functions` | Ranked complexity hotspots | `repo_id` | **`top_n`** (def 20) — not `limit` |
 | `calculate_cyclomatic_complexity` | Score one symbol | `repo_id`, **`target`** | — |
 | `get_repository_stats` | Repository overview | `repo_id` | `branch` |
@@ -42,10 +42,20 @@ Full parameter spec for every Memtrace tool: `references/mcp-parameters.md` (bun
 ### 2. Dead code
 
 ```json
-{ "repo_id": "memdb", "include_tests": false, "limit": 50 }
+{ "repo_id": "memdb", "include_tests": false, "limit": 50, "min_confidence": "high" }
 ```
 
-Exported symbols and entry points excluded by default. Results are candidates, not proof — callers via dynamic dispatch or reflection are invisible to the graph; verify before deleting.
+`find_dead_code` seeds **roots** (`main`, exported symbols, HANDLES targets,
+`trait_impl`, Magalz/framework allowlists), BFS-walks CALLS / REFERENCES /
+MAKES_API_CALL forward, and reports Function/Method nodes **unreachable from
+roots**. Each row includes `confidence` (`high` / `medium` / `low`) and
+`confidence_score` (Skylos-style penalties for dynamic languages, ambiguous
+hook names, methods). Use `min_confidence: "high"` for CI-safe cleanup;
+omit or `"low"` to see all bands.
+
+Results are still candidates, not proof — unmodeled dynamic dispatch can look
+live or dead incorrectly. Verify before deleting. Prefer false-live over
+false-dead.
 
 ### 3. Complexity hotspots
 
@@ -72,7 +82,7 @@ Ordered by call-graph out-degree.
 
 | Result | Carries |
 |--------|---------|
-| Dead-code entry (`find_dead_code`) | Symbol name + kind with zero graph callers — e.g. `format_legacy` (Function) |
+| Dead-code entry (`find_dead_code`) | Name, kind, path, `reason` (`unreachable from roots`), `confidence`, `confidence_score` |
 | Complexity row (`find_most_complex_functions`) | Symbol, complexity score, risk level — e.g. `processOrder` — 27, Critical |
 | Single score (`calculate_cyclomatic_complexity`) | Cyclomatic complexity for `target` |
 | Stats (`get_repository_stats`) | Node counts by kind, edge counts, community and process counts for `repo_id`/`branch` |
@@ -81,6 +91,8 @@ Ordered by call-graph out-degree.
 
 | Mistake | Reality |
 |---------|---------|
+| Treating every dead-code row as deletable | Filter with `min_confidence: "high"`; still verify framework/dynamic use |
+| Assuming “no inbound edge” is the model | Dead means unreachable from roots, not merely unreferenced |
 | `find_most_complex_functions(limit: 10)` | Param is **`top_n`** |
 | `calculate_cyclomatic_complexity(symbol_id=...)` | Required param is **`target`** |
 | Only looking at the highest complexity | Medium-complexity functions that are growing (check `get_evolution`) are often more urgent |

package/skills/workflows/memtrace-refactoring-guide.md

@@ -35,7 +35,7 @@ Run these three tools in parallel to build a candidate list:
 Call `find_most_complex_functions` with `top_n: 20`
 
 **b) Dead code:**
-Call `find_dead_code` to find unused symbols
+Call `find_dead_code` (prefer `min_confidence: "high"`) for symbols unreachable from roots
 
 **c) Architectural bottlenecks:**
 Call `find_bridge_symbols` to find chokepoints with too much responsibility
@@ -122,7 +122,7 @@ For each item, include:
 |-----------|--------|
 | Complex + volatile + high blast radius | Highest priority — but plan carefully; incremental approach |
 | Complex + stable + low blast radius | Can wait; refactor when you're already touching nearby code |
-| Dead code with zero callers | Run Cortex provenance/recall first; zero callers is not proof that no decision/contract keeps it |
+| Dead code (`unreachable from roots`, high confidence) | Run Cortex provenance/recall first; reachability is not proof that no decision/contract keeps it |
 | Bridge symbol with many dependents | Extract interface first, then refactor implementation behind it |
 | Symbol in cross-repo API | Coordinate with consumers; backward-compatible changes only |
 | Cortex returns a held ban/contract | Preserve it or ask before overriding it |