@event4u/agent-config 16.4.0 → 17.0.0

package/dist/cli/mcp/dispatch.js

@@ -25,7 +25,7 @@
  * trigger by ADR-112 and restated as the distribution shape by ADR-207 on
  * Node-only grounds; Phase 1.1 widens what is READ, never what is executed.
  */
-import { rankSkills } from '../../shared/skillRanking.js';
+import { DEFAULT_SUGGEST_LIMIT, rankSkills } from '../../shared/skillRanking.js';
 import { entriesOfKind } from './content.js';
 export const RPC_PARSE_ERROR = -32700;
 export const RPC_INVALID_REQUEST = -32600;
@@ -141,14 +141,22 @@ export const LITE_TOOLS = [
         name: 'suggest_skill_for_task',
         description: 'Rank skills against a free-form task description. Use when the ' +
             'skill you need is not in the catalogue the host delivered, so ' +
-            'asking by name is impossible and asking by task is not. Returns ' +
-            'names, scores and personas only — never bodies.',
+            'asking by name is impossible and asking by task is not. Each row ' +
+            "carries the skill's own description — its routing criteria, " +
+            'including any clause saying when to use something else. CHOOSE BY ' +
+            'READING THE ROWS, then open at most two bodies with read_skill. ' +
+            'Returns names, scores, personas and descriptions — never bodies.',
         inputSchema: {
             type: 'object',
             required: ['task'],
             properties: {
                 task: { type: 'string', description: 'The task to match skills against.' },
-                limit: { type: 'integer', minimum: 1, default: 5, description: 'Max results. Default 5.' },
+                limit: {
+                    type: 'integer',
+                    minimum: 1,
+                    default: DEFAULT_SUGGEST_LIMIT,
+                    description: `Max results. Default ${String(DEFAULT_SUGGEST_LIMIT)}.`,
+                },
             },
             additionalProperties: false,
         },
@@ -212,21 +220,30 @@ function tierState(tree) {
 }
 /**
  * `suggest_skill_for_task`. Mirrors the kernel handler's envelope — `status`,
- * `suggestions[]` of `{skill, score, personas}` — so a consumer that learned the
- * shape on one server does not have to relearn it on the other. `tiers` is
- * Phase 3.3's field and reports `unknown` until a tier file is wired in.
+ * `suggestions[]` of `{skill, score, personas, description}` — so a consumer
+ * that learned the shape on one server does not have to relearn it on the
+ * other. `tiers` is Phase 3.3's field and reports `unknown` until a tier file
+ * is wired in.
+ *
+ * `description` rides with the row because a NAME is not a choosing criterion:
+ * a caller handed five names either guesses or opens five bodies. It is capped
+ * at 200 characters per skill by `skill.schema.json`, so the envelope grows by
+ * a bounded amount per row and no body is returned at any depth.
  */
 function suggestSkillForTask(tree, params) {
     const task = typeof params.task === 'string' ? params.task.trim() : '';
     if (!task)
         return { status: 'error', error: 'params.task is required', suggestions: [] };
-    const rawLimit = typeof params.limit === 'number' ? Math.floor(params.limit) : 5;
+    const rawLimit = typeof params.limit === 'number' ? Math.floor(params.limit) : DEFAULT_SUGGEST_LIMIT;
     const limit = Math.max(1, rawLimit);
     const skills = rankableSkills(tree);
     if (skills.length === 0) {
         return { status: 'no_catalogue', suggestions: [], tiers: 'unknown' };
     }
     const all = rankSkills(task, skills);
+    // Built from the same `skills` array that was ranked, so a row can never
+    // carry the description of a skill the ranker did not see.
+    const descriptionOf = new Map(skills.map((s) => [s.name, s.description]));
     const tiers = tierState(tree);
     const tierA = tree.tier_a;
     const filtered = tierA ? all.filter((r) => !tierA.has(r.name)) : all;
@@ -237,7 +254,12 @@ function suggestSkillForTask(tree, params) {
         skills_indexed: skills.length,
         tiers,
         ...(tierA && filtered.length === 0 && all.length > 0 ? { tier_filter: 'bypassed-to-avoid-empty' } : {}),
-        suggestions: kept.slice(0, limit).map((r) => ({ skill: r.name, score: r.score, personas: r.personas })),
+        suggestions: kept.slice(0, limit).map((r) => ({
+            skill: r.name,
+            score: r.score,
+            personas: r.personas,
+            description: descriptionOf.get(r.name) ?? '',
+        })),
     };
 }
 /** `read_skill`. Name lookup through the uri map; no path is ever constructed. */

package/dist/cli/python/knowledge_ingest.js

@@ -53,8 +53,9 @@
  * - uuid7 uses `crypto.randomBytes` for `secrets.randbits` via `BigInt`; the
  *   value is random so it is NOT byte-comparable (tests normalise it), but the
  *   layout regex `^[0-9a-f]{8}-...-7...-[89ab]...$` validates.
- * - PII regexes are ported with the `g` flag for `subn`-equivalent counting.
- *   Node V8 supports the Python `(?<=\s)|(?<=^)` lookbehind in `_RE_PHONE`.
+ * - PII is detected by the egress rule table's identifier rows, not by the
+ *   Python port's own regexes: a value is tagged only where its checksum or
+ *   context holds.
  * - `chunk_text` measures bytes with `Buffer.byteLength(s, 'utf-8')`; the
  *   hard-split slices a `Buffer` and `.toString('utf-8')` (Node's lenient
  *   decode ≈ Python `decode(errors="ignore")` for whole-codepoint boundaries).
@@ -75,6 +76,7 @@ import * as os from 'node:os';
 import * as path from 'node:path';
 import process from 'node:process';
 import { fileURLToPath, pathToFileURL } from 'node:url';
+import { redactIdentifiers } from '../../scripts/_lib/identifier_redaction.js';
 import * as workspace_secrets from './workspace_secrets.js';
 // --- Bounds (contract §Bounds) ---------------------------------------------
 export const KNOWLEDGE_ROOT = path.join('agents', 'memory', 'knowledge');
@@ -172,25 +174,8 @@ export function uuid7_ts(value) {
     return Number.parseInt(hex_str.slice(0, 12), 16);
 }
 // --- Redaction (contract §Redaction defaults) -------------------------------
-const _RE_EMAIL = /[A-Za-z0-9._%+\-]+@[A-Za-z0-9.\-]+\.[A-Za-z]{2,}/g;
-const _RE_PHONE = new RegExp('(?:(?<=\\s)|(?<=^))' +
-    '(?:\\+?\\d{1,3}[\\s.\\-]?)?' +
-    '(?:\\(\\d{2,4}\\)[\\s.\\-]?|\\d{2,4}[\\s.\\-])' +
-    '\\d{2,4}[\\s.\\-]?\\d{2,4}(?:[\\s.\\-]?\\d{2,4})?', 'gm');
-const _RE_IBAN = /\b[A-Z]{2}\d{2}[A-Z0-9]{11,30}\b/g;
-const _RE_CC = /\b(?:\d[ \-]?){13,19}\b/g;
-const _RE_SSN = /\b\d{3}-\d{2}-\d{4}\b/g;
 // Secret patterns live in the shared leaf module ``workspace_secrets`` so the
 // ingestion redactor and the per-store pre-write guard stay in lock-step.
-/** `pat.subn(repl, text)` → `[clean, count]` (non-overlapping, left-to-right). */
-function _subn(pat, repl, text) {
-    let count = 0;
-    const clean = text.replace(pat, () => {
-        count += 1;
-        return repl;
-    });
-    return [clean, count];
-}
 /**
  * Replace PII and secret patterns with class placeholders.
  *
@@ -198,28 +183,11 @@ function _subn(pat, repl, text) {
  * names without brackets so the manifest can sum them.
  */
 export function redact(text, counters) {
-    const _bump = (name, n = 1) => {
-        counters[name] = (counters[name] ?? 0) + n;
-    };
     // Secrets first — never stored, manifest counter incremented. The shared
     // module replaces every match with ``[SECRET]`` (both tiers).
-    let [out, secrets_count] = workspace_secrets.scrub(text);
-    // PII placeholders.
-    const patterns = [
-        [_RE_IBAN, 'IBAN'],
-        [_RE_CC, 'CC'],
-        [_RE_SSN, 'SSN'],
-        [_RE_EMAIL, 'EMAIL'],
-        [_RE_PHONE, 'PHONE'],
-    ];
-    for (const [pat, tag] of patterns) {
-        const [next, n] = _subn(pat, `[${tag}]`, out);
-        out = next;
-        if (n) {
-            _bump(tag, n);
-        }
-    }
-    return [out, secrets_count];
+    const [out, secrets_count] = workspace_secrets.scrub(text);
+    // PII placeholders, detected by the rule table's identifier rows.
+    return [redactIdentifiers(out, counters), secrets_count];
 }
 // --- Chunking ---------------------------------------------------------------
 /** Python `len(s.encode("utf-8"))`. */

package/dist/cli/python/workspace_secrets.js

@@ -1,180 +1,7 @@
 /**
- * Shared secret-detection + scrub primitives for the workspace stores.
- *
- * TypeScript twin of `src/cli/python/workspace_secrets.py` (ADR-200,
- * py2ts Phase 1). Byte-for-byte behavioral mirror — same exported
- * snake_case names, same regex semantics (Python `re` → JS `RegExp`),
- * same `subn`/`finditer` counting, same `scrub_obj` depth + cycle guard,
- * same `[SECRET]` placeholder.
- *
- * Leaf module — `RegExp` only, **zero internal imports** — so the
- * hot-path analytics `emit()` and the heavier `knowledge_ingest` can both
- * depend on it cheaply without dragging in PII redaction, chunking, or file
- * I/O. Every workspace store that persists text or arbitrary payloads at rest
- * routes through this module before writing (Phase 8 Step 5 secret-hygiene
- * sweep).
- *
- * Two confidence tiers:
- *
- * - **HIGH** — structurally unambiguous credentials (AWS access-key id, GitHub
- *   PAT, OpenAI key, PEM private-key block). Near-zero false-positive rate, so
- *   safe to scrub destructively or to refuse a write over.
- * - **FUZZY** — the generic `key/secret/token/password = <value>` assignment.
- *   Fires on legitimate prose ("password reset token: see attached"), so it is
- *   warn-only on user-authored content and only scrubbed on disposable,
- *   machine-generated telemetry (sessions / analytics).
- *
- * The `[SECRET]` placeholder matches the knowledge-ingestion redactor so the
- * two surfaces stay byte-consistent.
+ * The workspace stores' secret scan and scrub. The module lives in
+ * `src/scripts/_lib/workspace_secrets.ts`, which the package ships; this path
+ * is kept so the stores' imports stay where they were.
  */
-export const PLACEHOLDER = '[SECRET]';
-// --- HIGH-confidence patterns (gitleaks-equivalent subset) ------------------
-//
-// Python compiles each pattern once; JS needs a FRESH `RegExp` per match call
-// because the `g` flag carries `lastIndex` state. `_finditer` / `_subn` below
-// each construct a local global-flagged copy, so the module-level patterns
-// stay stateless (matching Python's stateless compiled patterns).
-//
-// `[\s\S]` mirrors Python `re.DOTALL`-style `[\s\S]` (the .py uses the same
-// idiom, not the DOTALL flag). `*?` is lazy in both engines.
-const _RE_PRIVATE_KEY = /-----BEGIN [A-Z ]+PRIVATE KEY-----[\s\S]*?-----END [A-Z ]+PRIVATE KEY-----/;
-const _RE_AWS = /AKIA[0-9A-Z]{16}/;
-const _RE_GH = /gh[pousr]_[A-Za-z0-9]{36,}/;
-const _RE_OPENAI = /sk-[A-Za-z0-9]{20,}/;
-// --- FUZZY pattern (heuristic key/value assignment) -------------------------
-// Python `(?i)` inline flag → JS `i` flag. Character class is identical.
-const _RE_KV_SECRET = /(?:api[_-]?key|secret|token|password|passwd|bearer)\s*[:=]\s*['"]?[A-Za-z0-9_\-+/=]{12,}['"]?/i;
-// Ordered HIGH-confidence first so the private-key block is consumed before
-// the narrower key patterns can fragment it.
-export const HIGH_CONFIDENCE = [
-    ['private_key', _RE_PRIVATE_KEY],
-    ['aws_access_key', _RE_AWS],
-    ['github_pat', _RE_GH],
-    ['openai_key', _RE_OPENAI],
-];
-export const FUZZY = [['kv_secret', _RE_KV_SECRET]];
-export const ALL_PATTERNS = [...HIGH_CONFIDENCE, ...FUZZY];
-// Recursion guard for `scrub_obj` — deep / cyclic structures degrade to a
-// controlled return instead of a RangeError on the never-raises hot path.
-const _MAX_DEPTH = 50;
-/**
- * Build a global-flagged clone of `pat` so `matchAll` / `replace` get
- * left-to-right non-overlapping iteration matching Python `finditer` / `subn`,
- * without mutating the shared stateless module-level pattern.
- */
-function _global(pat) {
-    const flags = pat.flags.includes('g') ? pat.flags : pat.flags + 'g';
-    return new RegExp(pat.source, flags);
-}
-/** Count of non-overlapping matches — mirrors `len(list(pat.finditer(text)))`. */
-function _finditerCount(pat, text) {
-    let n = 0;
-    for (const _m of text.matchAll(_global(pat)))
-        n += 1;
-    return n;
-}
-/** `pat.subn(repl, text)` → `[clean, count]` (non-overlapping, left-to-right). */
-function _subn(pat, repl, text) {
-    let count = 0;
-    const clean = text.replace(_global(pat), () => {
-        count += 1;
-        return repl;
-    });
-    return [clean, count];
-}
-/**
- * Non-destructive detection: one {@link Finding} per match.
- *
- * Never echoes the matched secret value — only the pattern name and tier,
- * so a caller can warn or refuse without re-leaking the secret into a log.
- */
-export function scan(text, opts) {
-    const include_fuzzy = opts?.include_fuzzy ?? true;
-    if (typeof text !== 'string' || !text) {
-        return [];
-    }
-    const out = [];
-    for (const [name, pat] of HIGH_CONFIDENCE) {
-        const n = _finditerCount(pat, text);
-        for (let i = 0; i < n; i += 1)
-            out.push({ pattern: name, confidence: 'high' });
-    }
-    if (include_fuzzy) {
-        for (const [name, pat] of FUZZY) {
-            const n = _finditerCount(pat, text);
-            for (let i = 0; i < n; i += 1)
-                out.push({ pattern: name, confidence: 'fuzzy' });
-        }
-    }
-    return out;
-}
-/** Replace every secret match with `[SECRET]`; return `[clean, count]`. */
-export function scrub(text, opts) {
-    const include_fuzzy = opts?.include_fuzzy ?? true;
-    if (typeof text !== 'string' || !text) {
-        return [text, 0];
-    }
-    let out = text;
-    let count = 0;
-    const patterns = include_fuzzy ? ALL_PATTERNS : HIGH_CONFIDENCE;
-    for (const [, pat] of patterns) {
-        const [next, n] = _subn(pat, PLACEHOLDER, out);
-        out = next;
-        count += n;
-    }
-    return [out, count];
-}
-/**
- * Recursively scrub string leaves in object / array structures.
- *
- * Non-string leaves (number, boolean, null) pass through untouched. Recursion
- * is bounded by a depth cap and a cycle guard so malformed or self-referential
- * payloads degrade to a controlled return, never a stack overflow — callers on
- * a never-raises hot path (`workspace_analytics.emit`) rely on this. Returns
- * `[clean, count]`.
- *
- * Python distinguishes `list` (→ list) from `tuple` (→ tuple); JS has only
- * `Array`, so an array round-trips as an array, matching the Python `list`
- * branch (the workspace stores never feed a tuple through this path).
- */
-export function scrub_obj(obj, opts) {
-    const include_fuzzy = opts?.include_fuzzy ?? true;
-    const _depth = opts?._depth ?? 0;
-    const _seen = opts?._seen ?? new Set();
-    if (_depth > _MAX_DEPTH) {
-        return [obj, 0];
-    }
-    if (typeof obj === 'string') {
-        return scrub(obj, { include_fuzzy });
-    }
-    if (Array.isArray(obj)) {
-        if (_seen.has(obj)) {
-            return [obj, 0];
-        }
-        _seen.add(obj);
-        let total = 0;
-        const items = [];
-        for (const value of obj) {
-            const [cv, n] = scrub_obj(value, { include_fuzzy, _depth: _depth + 1, _seen });
-            items.push(cv);
-            total += n;
-        }
-        return [items, total];
-    }
-    if (obj !== null && typeof obj === 'object') {
-        if (_seen.has(obj)) {
-            return [obj, 0];
-        }
-        _seen.add(obj);
-        let total = 0;
-        const clean = {};
-        for (const [key, value] of Object.entries(obj)) {
-            const [cv, n] = scrub_obj(value, { include_fuzzy, _depth: _depth + 1, _seen });
-            clean[key] = cv;
-            total += n;
-        }
-        return [clean, total];
-    }
-    return [obj, 0];
-}
+export * from '../../scripts/_lib/workspace_secrets.js';
 //# sourceMappingURL=workspace_secrets.js.map

package/dist/cli/registry.js

@@ -37,7 +37,7 @@ export const REGISTRY = [
     { name: 'rtk:detect', disposition: 'native', synopsis: 'rtk (Rust Token Killer) presence + identity readout — contract: docs/contracts/rtk-detection.md.' },
     { name: 'ui:serve', disposition: 'native', synopsis: 'Start the local UI server.' },
     { name: 'ui:audit', disposition: 'native', synopsis: 'Inventory a UI tree into agents/runtime/state/ui-audit.json (Class A; the artefact ui-audit-gate reads).' },
-    { name: 'ui:render', disposition: 'native', synopsis: 'Headless capture at desktop / 375px / 320px into agents/runtime/state/render/ (Class A; no process survives).' },
+    { name: 'ui:render', disposition: 'native', synopsis: 'Headless capture at desktop / 375px / 320px, or --profile asset for one SVG per class on a light and a dark background, into agents/runtime/state/render/ (Class A; no process survives).' },
     { name: 'config', disposition: 'native', synopsis: 'Open the configuration GUI (global by default; --project for the project surface).' },
     { name: 'settings', disposition: 'native', synopsis: 'Open the local Settings GUI (alias of config).' },
     { name: 'install', disposition: 'native', synopsis: 'Open the install wizard (UI server, lands on Step 1 / AI tools).' },
@@ -46,6 +46,9 @@ export const REGISTRY = [
     { name: 'packs', disposition: 'native', synopsis: 'List packs from the discovery manifest (ls subcommand).' },
     { name: 'packs:active', disposition: 'delegate', synopsis: 'Which packs are active here, from which file — names the degraded zero-pack case.' },
     { name: 'brand:status', disposition: 'delegate', synopsis: 'Whether a consumer brand tokens file is present, where, and dot-prefixed near-misses.' },
+    { name: 'ci:settle', disposition: 'delegate', synopsis: "Wait for a PR's checks to settle; the last output line is the verdict." },
+    { name: 'audit:deps', disposition: 'delegate', synopsis: "Security advisories for this project's packages, runtimes and toolchain; only `refresh` touches the network." },
+    { name: 'worktree:cleanup', disposition: 'delegate', synopsis: 'Worktree inventory and removal of the proven-merged, clean, unused set; never with force.' },
     { name: 'commands', disposition: 'native', synopsis: 'List/explain the command surface from the discovery manifest (ls / explain subcommands); ls --candidates reports surface-reduction signals.' },
     { name: 'help', disposition: 'native', synopsis: 'Show TS-shell help; delegates --tier=N to Bash.' },
     { name: 'explain', disposition: 'delegate', synopsis: 'Read-only decision-chain trace (config | rule <name> | route "<text>") or command explanation.' },
@@ -81,7 +84,7 @@ export const REGISTRY = [
     { name: 'hooks:effect', disposition: 'delegate', synopsis: 'Does a bound concern actually FIRE here? Sandboxed synthetic dispatch per concern; five per-concern states, four host verdicts (read-only).' },
     { name: 'routing:doctor', disposition: 'delegate', synopsis: 'Live routing diagnosis: per-gate ACTIVE/INACTIVE with reason, chain, freshness, orchestration state (read-only).' },
     { name: 'workspace:doctor', disposition: 'delegate', synopsis: 'Workspace identity with provenance (repo root, main worktree, current worktree, branch, PR base) + session claim and worktree pressure (read-only).' },
-    { name: 'route:explain', disposition: 'delegate', synopsis: 'Deterministic rule-routing trace for one prompt: matched triggers, tier, disposition, budget, rejected candidates (trigger-match level only).' },
+    { name: 'route:explain', disposition: 'delegate', synopsis: 'Deterministic rule-routing trace for one prompt: matched triggers, tier, disposition, budget, rejected candidates (trigger-match level only). --skills "<task>" ranks SKILLS instead, with each row\'s description, on a host with no MCP server.' },
     { name: 'route:audit', disposition: 'delegate', synopsis: 'Replay the router matcher over the last N chat-history prompts; opt-in recorder + --weekly rolling render (trigger-match level only).' },
     { name: 'hooks:replay', disposition: 'delegate', synopsis: 'Replay a fixture through the universal hook dispatcher (no state writes).' },
     { name: 'reach:doctor', disposition: 'delegate', synopsis: 'Reach-channel health report: active backend + pinned fix per channel (read-only; --deep opts into network).' },

package/dist/cli-delegate/archive_completed_roadmaps.js

@@ -10,13 +10,14 @@ import {
   blocker_is_resolved,
   collect,
   parse_blockers
-} from "./chunk-PHD7OOLE.js";
+} from "./chunk-MQ2UDEGV.js";
+import "./chunk-DSY6LLCQ.js";
 import "./chunk-ULET4BYS.js";
 import {
   isCliEntry
 } from "./chunk-5EK5WQN6.js";
 import "./chunk-YWVXLR44.js";
-import "./chunk-7XGD2OEU.js";
+import "./chunk-UXWHY6CQ.js";
 import {
   guardedBaselineProblems,
   parseGuardedBaselines