open-multi-agent-kit 0.90.3 → 0.90.4

package/dist/core/reasoning-router.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Reasoning-effort router: pure, side-effect-free task classification and
+ * ThinkingLevel resolution for the `auto` thinking mode.
+ *
+ * Deterministic by construction: consumes only the prompt text and an optional
+ * subagent lane type. No clock, randomness, I/O, or imports from session, TUI,
+ * or provider code (the ThinkingLevel import below is type-only and erased).
+ */
+import type { ThinkingLevel } from "omk-agent-core";
+/** Closed set of task classes the router can assign to a turn. */
+export type TaskClass = "trivial" | "simple-edit" | "code-gen" | "debug" | "refactor" | "review" | "plan";
+/** Subagent lane types recognized by the classifier and resolver. */
+export type ReasoningLaneType = "planner" | "security" | "explorer" | "coder" | "reviewer" | "tester";
+export interface TaskClassifierInput {
+    prompt: string;
+    laneType?: ReasoningLaneType;
+}
+/**
+ * Classify a turn deterministically. Signal precedence (first match wins):
+ * 1. Keyword families (debug > refactor > review > plan > simple-edit > code-gen)
+ * 2. Code fence or diff markers -> code-gen
+ * 3. Trimmed length < TRIVIAL_MAX_CHARS -> trivial
+ * 4. Trimmed length >= COMPLEX_PROSE_MIN_CHARS -> plan (long prose brief)
+ * 5. Lane fallback (see LANE_FALLBACK_CLASS)
+ * 6. Default -> code-gen
+ */
+export declare function classifyTask(input: TaskClassifierInput): TaskClass;
+/** Static rule table: task class -> recommended ThinkingLevel (before lane adjustment and clamping). */
+export declare const TASK_CLASS_THINKING_LEVELS: Readonly<Record<TaskClass, ThinkingLevel>>;
+/**
+ * Resolve the recommended ThinkingLevel for a task class:
+ * 1. Look up the static rule table.
+ * 2. Apply the lane adjustment (one ladder step, saturating at ladder ends).
+ * 3. Clamp to the highest level in `availableLevels` that is <= the target;
+ *    if no available level is at/below the target, return the lowest available
+ *    reasoning level. Never invents a level outside `availableLevels`.
+ *
+ * `"off"` is never a router output for reasoning models. If `availableLevels`
+ * contains no ladder level at all (e.g. a non-reasoning model exposing only
+ * "off"), the first available level is returned; callers are expected to
+ * bypass the router entirely for models with `reasoning: false`.
+ */
+export declare function resolveThinkingLevel(taskClass: TaskClass, availableLevels: readonly ThinkingLevel[], laneType?: ReasoningLaneType): ThinkingLevel;
+//# sourceMappingURL=reasoning-router.d.ts.map

package/dist/core/reasoning-router.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reasoning-router.d.ts","sourceRoot":"","sources":["../../src/core/reasoning-router.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAEpD,kEAAkE;AAClE,MAAM,MAAM,SAAS,GAAG,SAAS,GAAG,aAAa,GAAG,UAAU,GAAG,OAAO,GAAG,UAAU,GAAG,QAAQ,GAAG,MAAM,CAAC;AAE1G,qEAAqE;AACrE,MAAM,MAAM,iBAAiB,GAAG,SAAS,GAAG,UAAU,GAAG,UAAU,GAAG,OAAO,GAAG,UAAU,GAAG,QAAQ,CAAC;AAEtG,MAAM,WAAW,mBAAmB;IACnC,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,iBAAiB,CAAC;CAC7B;AAqED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,mBAAmB,GAAG,SAAS,CAYlE;AAKD,wGAAwG;AACxG,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,MAAM,CAAC,SAAS,EAAE,aAAa,CAAC,CAQjF,CAAC;AASF;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CACnC,SAAS,EAAE,SAAS,EACpB,eAAe,EAAE,SAAS,aAAa,EAAE,EACzC,QAAQ,CAAC,EAAE,iBAAiB,GAC1B,aAAa,CAef","sourcesContent":["/**\n * Reasoning-effort router: pure, side-effect-free task classification and\n * ThinkingLevel resolution for the `auto` thinking mode.\n *\n * Deterministic by construction: consumes only the prompt text and an optional\n * subagent lane type. No clock, randomness, I/O, or imports from session, TUI,\n * or provider code (the ThinkingLevel import below is type-only and erased).\n */\n\nimport type { ThinkingLevel } from \"omk-agent-core\";\n\n/** Closed set of task classes the router can assign to a turn. */\nexport type TaskClass = \"trivial\" | \"simple-edit\" | \"code-gen\" | \"debug\" | \"refactor\" | \"review\" | \"plan\";\n\n/** Subagent lane types recognized by the classifier and resolver. */\nexport type ReasoningLaneType = \"planner\" | \"security\" | \"explorer\" | \"coder\" | \"reviewer\" | \"tester\";\n\nexport interface TaskClassifierInput {\n\tprompt: string;\n\tlaneType?: ReasoningLaneType;\n}\n\n/** Prompts shorter than this (trimmed) classify as trivial when no stronger signal matches. */\nconst TRIVIAL_MAX_CHARS = 40;\n/** Prompts at/above this length with no keyword/code/diff signal are treated as long prose briefs (plan). */\nconst COMPLEX_PROSE_MIN_CHARS = 2400;\n\n/**\n * Keyword families in FIXED precedence order:\n * debug > refactor > review > plan > simple-edit > code-gen.\n * The first matching family wins; ties are impossible by construction.\n * Patterns are case-insensitive and stateless (no `g` flag, so no lastIndex carry-over).\n */\nconst KEYWORD_FAMILIES: ReadonlyArray<{ taskClass: TaskClass; pattern: RegExp }> = [\n\t{\n\t\ttaskClass: \"debug\",\n\t\tpattern:\n\t\t\t/\\b(debug(ging)?|bugs?|fix(es|ing|ed)?|errors?|exceptions?|crash(es|ing|ed)?|stack\\s*trace|traceback|regressions?|broken|fail(s|ing|ed|ure|ures)?|flaky|reproduce)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"refactor\",\n\t\tpattern:\n\t\t\t/\\b(refactor(ing|ed)?|restructur(e|ing)|renam(e|ing)|extract(ing)?|clean\\s*up|cleanup|simplif(y|ying|ied)|deduplicat(e|ing)|reorganiz(e|ing)|rewrit(e|ing)|modulariz(e|ing))\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"review\",\n\t\tpattern: /\\b(review(s|ing|ed)?|audit(s|ing|ed)?|critique|assess(ing|ment)?|inspect(ing)?|lgtm|approve)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"plan\",\n\t\tpattern:\n\t\t\t/\\b(plan(s|ning)?|design(s|ing)?|architect(s|ure|ing)?|roadmap|spec(s|ification|ifications)?|strateg(y|ies|ize)|decompos(e|ing|ition)|break\\s+(this\\s+|it\\s+)?down|milestones?)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"simple-edit\",\n\t\tpattern:\n\t\t\t/\\b(typos?|tweak(s|ing|ed)?|one-?liner?|single\\s+line|bump(s|ing|ed)?|whitespace|reword(s|ing|ed)?|indentation|punctuation)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"code-gen\",\n\t\tpattern:\n\t\t\t/\\b(implement(s|ing|ation)?|writ(e|ing)|creat(e|es|ing)|add(s|ing|ed)?|build(s|ing)?|generat(e|es|ing)|scaffold(ing)?|prototype)\\b/i,\n\t},\n];\n\n/** Fallback class per lane when no keyword, code/diff, or length signal decides. */\nconst LANE_FALLBACK_CLASS: Record<ReasoningLaneType, TaskClass> = {\n\tplanner: \"plan\",\n\tsecurity: \"review\",\n\texplorer: \"review\",\n\tcoder: \"code-gen\",\n\treviewer: \"review\",\n\ttester: \"code-gen\",\n};\n\nfunction hasCodeFence(text: string): boolean {\n\treturn text.includes(\"```\");\n}\n\n/**\n * Diff detection: explicit hunk (`@@ ... @@`) or `diff --git` headers count alone;\n * bare `+`/`-` line starts only count when both added AND removed lines are present\n * (avoids false positives on markdown bullet lists).\n */\nfunction hasDiffMarkers(text: string): boolean {\n\tif (/^@@[^\\n]*@@/m.test(text) || /^diff --git /m.test(text)) return true;\n\treturn /^\\+(?!\\+)/m.test(text) && /^-(?!-)/m.test(text);\n}\n\n/**\n * Classify a turn deterministically. Signal precedence (first match wins):\n * 1. Keyword families (debug > refactor > review > plan > simple-edit > code-gen)\n * 2. Code fence or diff markers -> code-gen\n * 3. Trimmed length < TRIVIAL_MAX_CHARS -> trivial\n * 4. Trimmed length >= COMPLEX_PROSE_MIN_CHARS -> plan (long prose brief)\n * 5. Lane fallback (see LANE_FALLBACK_CLASS)\n * 6. Default -> code-gen\n */\nexport function classifyTask(input: TaskClassifierInput): TaskClass {\n\tconst prompt = input.prompt.trim();\n\n\tfor (const family of KEYWORD_FAMILIES) {\n\t\tif (family.pattern.test(prompt)) return family.taskClass;\n\t}\n\n\tif (hasCodeFence(prompt) || hasDiffMarkers(prompt)) return \"code-gen\";\n\tif (prompt.length < TRIVIAL_MAX_CHARS) return \"trivial\";\n\tif (prompt.length >= COMPLEX_PROSE_MIN_CHARS) return \"plan\";\n\tif (input.laneType) return LANE_FALLBACK_CLASS[input.laneType];\n\treturn \"code-gen\";\n}\n\n/** Reasoning ladder used for targets and clamping. Intentionally excludes \"off\". */\nconst REASONING_LADDER: readonly ThinkingLevel[] = [\"minimal\", \"low\", \"medium\", \"high\", \"xhigh\", \"max\"];\n\n/** Static rule table: task class -> recommended ThinkingLevel (before lane adjustment and clamping). */\nexport const TASK_CLASS_THINKING_LEVELS: Readonly<Record<TaskClass, ThinkingLevel>> = {\n\ttrivial: \"minimal\",\n\t\"simple-edit\": \"low\",\n\t\"code-gen\": \"medium\",\n\tdebug: \"high\",\n\trefactor: \"high\",\n\treview: \"high\",\n\tplan: \"xhigh\",\n};\n\n/** Lane adjustment in ladder steps: planner/security escalate, explorer de-escalates. */\nconst LANE_STEP: Readonly<Partial<Record<ReasoningLaneType, 1 | -1>>> = {\n\tplanner: 1,\n\tsecurity: 1,\n\texplorer: -1,\n};\n\n/**\n * Resolve the recommended ThinkingLevel for a task class:\n * 1. Look up the static rule table.\n * 2. Apply the lane adjustment (one ladder step, saturating at ladder ends).\n * 3. Clamp to the highest level in `availableLevels` that is <= the target;\n *    if no available level is at/below the target, return the lowest available\n *    reasoning level. Never invents a level outside `availableLevels`.\n *\n * `\"off\"` is never a router output for reasoning models. If `availableLevels`\n * contains no ladder level at all (e.g. a non-reasoning model exposing only\n * \"off\"), the first available level is returned; callers are expected to\n * bypass the router entirely for models with `reasoning: false`.\n */\nexport function resolveThinkingLevel(\n\ttaskClass: TaskClass,\n\tavailableLevels: readonly ThinkingLevel[],\n\tlaneType?: ReasoningLaneType,\n): ThinkingLevel {\n\tconst baseIndex = REASONING_LADDER.indexOf(TASK_CLASS_THINKING_LEVELS[taskClass]);\n\tconst step = laneType ? (LANE_STEP[laneType] ?? 0) : 0;\n\tconst targetIndex = Math.min(Math.max(baseIndex + step, 0), REASONING_LADDER.length - 1);\n\n\tconst availableOnLadder = REASONING_LADDER.filter((level) => availableLevels.includes(level));\n\tif (availableOnLadder.length === 0) {\n\t\treturn availableLevels[0] ?? \"off\";\n\t}\n\n\tfor (let i = targetIndex; i >= 0; i--) {\n\t\tconst candidate = REASONING_LADDER[i];\n\t\tif (availableOnLadder.includes(candidate)) return candidate;\n\t}\n\treturn availableOnLadder[0];\n}\n"]}

package/dist/core/reasoning-router.js

@@ -0,0 +1,138 @@
+/**
+ * Reasoning-effort router: pure, side-effect-free task classification and
+ * ThinkingLevel resolution for the `auto` thinking mode.
+ *
+ * Deterministic by construction: consumes only the prompt text and an optional
+ * subagent lane type. No clock, randomness, I/O, or imports from session, TUI,
+ * or provider code (the ThinkingLevel import below is type-only and erased).
+ */
+/** Prompts shorter than this (trimmed) classify as trivial when no stronger signal matches. */
+const TRIVIAL_MAX_CHARS = 40;
+/** Prompts at/above this length with no keyword/code/diff signal are treated as long prose briefs (plan). */
+const COMPLEX_PROSE_MIN_CHARS = 2400;
+/**
+ * Keyword families in FIXED precedence order:
+ * debug > refactor > review > plan > simple-edit > code-gen.
+ * The first matching family wins; ties are impossible by construction.
+ * Patterns are case-insensitive and stateless (no `g` flag, so no lastIndex carry-over).
+ */
+const KEYWORD_FAMILIES = [
+    {
+        taskClass: "debug",
+        pattern: /\b(debug(ging)?|bugs?|fix(es|ing|ed)?|errors?|exceptions?|crash(es|ing|ed)?|stack\s*trace|traceback|regressions?|broken|fail(s|ing|ed|ure|ures)?|flaky|reproduce)\b/i,
+    },
+    {
+        taskClass: "refactor",
+        pattern: /\b(refactor(ing|ed)?|restructur(e|ing)|renam(e|ing)|extract(ing)?|clean\s*up|cleanup|simplif(y|ying|ied)|deduplicat(e|ing)|reorganiz(e|ing)|rewrit(e|ing)|modulariz(e|ing))\b/i,
+    },
+    {
+        taskClass: "review",
+        pattern: /\b(review(s|ing|ed)?|audit(s|ing|ed)?|critique|assess(ing|ment)?|inspect(ing)?|lgtm|approve)\b/i,
+    },
+    {
+        taskClass: "plan",
+        pattern: /\b(plan(s|ning)?|design(s|ing)?|architect(s|ure|ing)?|roadmap|spec(s|ification|ifications)?|strateg(y|ies|ize)|decompos(e|ing|ition)|break\s+(this\s+|it\s+)?down|milestones?)\b/i,
+    },
+    {
+        taskClass: "simple-edit",
+        pattern: /\b(typos?|tweak(s|ing|ed)?|one-?liner?|single\s+line|bump(s|ing|ed)?|whitespace|reword(s|ing|ed)?|indentation|punctuation)\b/i,
+    },
+    {
+        taskClass: "code-gen",
+        pattern: /\b(implement(s|ing|ation)?|writ(e|ing)|creat(e|es|ing)|add(s|ing|ed)?|build(s|ing)?|generat(e|es|ing)|scaffold(ing)?|prototype)\b/i,
+    },
+];
+/** Fallback class per lane when no keyword, code/diff, or length signal decides. */
+const LANE_FALLBACK_CLASS = {
+    planner: "plan",
+    security: "review",
+    explorer: "review",
+    coder: "code-gen",
+    reviewer: "review",
+    tester: "code-gen",
+};
+function hasCodeFence(text) {
+    return text.includes("```");
+}
+/**
+ * Diff detection: explicit hunk (`@@ ... @@`) or `diff --git` headers count alone;
+ * bare `+`/`-` line starts only count when both added AND removed lines are present
+ * (avoids false positives on markdown bullet lists).
+ */
+function hasDiffMarkers(text) {
+    if (/^@@[^\n]*@@/m.test(text) || /^diff --git /m.test(text))
+        return true;
+    return /^\+(?!\+)/m.test(text) && /^-(?!-)/m.test(text);
+}
+/**
+ * Classify a turn deterministically. Signal precedence (first match wins):
+ * 1. Keyword families (debug > refactor > review > plan > simple-edit > code-gen)
+ * 2. Code fence or diff markers -> code-gen
+ * 3. Trimmed length < TRIVIAL_MAX_CHARS -> trivial
+ * 4. Trimmed length >= COMPLEX_PROSE_MIN_CHARS -> plan (long prose brief)
+ * 5. Lane fallback (see LANE_FALLBACK_CLASS)
+ * 6. Default -> code-gen
+ */
+export function classifyTask(input) {
+    const prompt = input.prompt.trim();
+    for (const family of KEYWORD_FAMILIES) {
+        if (family.pattern.test(prompt))
+            return family.taskClass;
+    }
+    if (hasCodeFence(prompt) || hasDiffMarkers(prompt))
+        return "code-gen";
+    if (prompt.length < TRIVIAL_MAX_CHARS)
+        return "trivial";
+    if (prompt.length >= COMPLEX_PROSE_MIN_CHARS)
+        return "plan";
+    if (input.laneType)
+        return LANE_FALLBACK_CLASS[input.laneType];
+    return "code-gen";
+}
+/** Reasoning ladder used for targets and clamping. Intentionally excludes "off". */
+const REASONING_LADDER = ["minimal", "low", "medium", "high", "xhigh", "max"];
+/** Static rule table: task class -> recommended ThinkingLevel (before lane adjustment and clamping). */
+export const TASK_CLASS_THINKING_LEVELS = {
+    trivial: "minimal",
+    "simple-edit": "low",
+    "code-gen": "medium",
+    debug: "high",
+    refactor: "high",
+    review: "high",
+    plan: "xhigh",
+};
+/** Lane adjustment in ladder steps: planner/security escalate, explorer de-escalates. */
+const LANE_STEP = {
+    planner: 1,
+    security: 1,
+    explorer: -1,
+};
+/**
+ * Resolve the recommended ThinkingLevel for a task class:
+ * 1. Look up the static rule table.
+ * 2. Apply the lane adjustment (one ladder step, saturating at ladder ends).
+ * 3. Clamp to the highest level in `availableLevels` that is <= the target;
+ *    if no available level is at/below the target, return the lowest available
+ *    reasoning level. Never invents a level outside `availableLevels`.
+ *
+ * `"off"` is never a router output for reasoning models. If `availableLevels`
+ * contains no ladder level at all (e.g. a non-reasoning model exposing only
+ * "off"), the first available level is returned; callers are expected to
+ * bypass the router entirely for models with `reasoning: false`.
+ */
+export function resolveThinkingLevel(taskClass, availableLevels, laneType) {
+    const baseIndex = REASONING_LADDER.indexOf(TASK_CLASS_THINKING_LEVELS[taskClass]);
+    const step = laneType ? (LANE_STEP[laneType] ?? 0) : 0;
+    const targetIndex = Math.min(Math.max(baseIndex + step, 0), REASONING_LADDER.length - 1);
+    const availableOnLadder = REASONING_LADDER.filter((level) => availableLevels.includes(level));
+    if (availableOnLadder.length === 0) {
+        return availableLevels[0] ?? "off";
+    }
+    for (let i = targetIndex; i >= 0; i--) {
+        const candidate = REASONING_LADDER[i];
+        if (availableOnLadder.includes(candidate))
+            return candidate;
+    }
+    return availableOnLadder[0];
+}
+//# sourceMappingURL=reasoning-router.js.map

package/dist/core/reasoning-router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reasoning-router.js","sourceRoot":"","sources":["../../src/core/reasoning-router.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAeH,+FAA+F;AAC/F,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAC7B,6GAA6G;AAC7G,MAAM,uBAAuB,GAAG,IAAI,CAAC;AAErC;;;;;GAKG;AACH,MAAM,gBAAgB,GAA6D;IAClF;QACC,SAAS,EAAE,OAAO;QAClB,OAAO,EACN,sKAAsK;KACvK;IACD;QACC,SAAS,EAAE,UAAU;QACrB,OAAO,EACN,gLAAgL;KACjL;IACD;QACC,SAAS,EAAE,QAAQ;QACnB,OAAO,EAAE,iGAAiG;KAC1G;IACD;QACC,SAAS,EAAE,MAAM;QACjB,OAAO,EACN,mLAAmL;KACpL;IACD;QACC,SAAS,EAAE,aAAa;QACxB,OAAO,EACN,+HAA+H;KAChI;IACD;QACC,SAAS,EAAE,UAAU;QACrB,OAAO,EACN,oIAAoI;KACrI;CACD,CAAC;AAEF,oFAAoF;AACpF,MAAM,mBAAmB,GAAyC;IACjE,OAAO,EAAE,MAAM;IACf,QAAQ,EAAE,QAAQ;IAClB,QAAQ,EAAE,QAAQ;IAClB,KAAK,EAAE,UAAU;IACjB,QAAQ,EAAE,QAAQ;IAClB,MAAM,EAAE,UAAU;CAClB,CAAC;AAEF,SAAS,YAAY,CAAC,IAAY,EAAW;IAC5C,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAAA,CAC5B;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,IAAY,EAAW;IAC9C,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACzE,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAAA,CACxD;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAC,KAA0B,EAAa;IACnE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IAEnC,KAAK,MAAM,MAAM,IAAI,gBAAgB,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC,SAAS,CAAC;IAC1D,CAAC;IAED,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,cAAc,CAAC,MAAM,CAAC;QAAE,OAAO,UAAU,CAAC;IACtE,IAAI,MAAM,CAAC,MAAM,GAAG,iBAAiB;QAAE,OAAO,SAAS,CAAC;IACxD,IAAI,MAAM,CAAC,MAAM,IAAI,uBAAuB;QAAE,OAAO,MAAM,CAAC;IAC5D,IAAI,KAAK,CAAC,QAAQ;QAAE,OAAO,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC/D,OAAO,UAAU,CAAC;AAAA,CAClB;AAED,oFAAoF;AACpF,MAAM,gBAAgB,GAA6B,CAAC,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;AAExG,wGAAwG;AACxG,MAAM,CAAC,MAAM,0BAA0B,GAA+C;IACrF,OAAO,EAAE,SAAS;IAClB,aAAa,EAAE,KAAK;IACpB,UAAU,EAAE,QAAQ;IACpB,KAAK,EAAE,MAAM;IACb,QAAQ,EAAE,MAAM;IAChB,MAAM,EAAE,MAAM;IACd,IAAI,EAAE,OAAO;CACb,CAAC;AAEF,yFAAyF;AACzF,MAAM,SAAS,GAAyD;IACvE,OAAO,EAAE,CAAC;IACV,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,CAAC,CAAC;CACZ,CAAC;AAEF;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CACnC,SAAoB,EACpB,eAAyC,EACzC,QAA4B,EACZ;IAChB,MAAM,SAAS,GAAG,gBAAgB,CAAC,OAAO,CAAC,0BAA0B,CAAC,SAAS,CAAC,CAAC,CAAC;IAClF,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEzF,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9F,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpC,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;IACpC,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,iBAAiB,CAAC,QAAQ,CAAC,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;IAC7D,CAAC;IACD,OAAO,iBAAiB,CAAC,CAAC,CAAC,CAAC;AAAA,CAC5B","sourcesContent":["/**\n * Reasoning-effort router: pure, side-effect-free task classification and\n * ThinkingLevel resolution for the `auto` thinking mode.\n *\n * Deterministic by construction: consumes only the prompt text and an optional\n * subagent lane type. No clock, randomness, I/O, or imports from session, TUI,\n * or provider code (the ThinkingLevel import below is type-only and erased).\n */\n\nimport type { ThinkingLevel } from \"omk-agent-core\";\n\n/** Closed set of task classes the router can assign to a turn. */\nexport type TaskClass = \"trivial\" | \"simple-edit\" | \"code-gen\" | \"debug\" | \"refactor\" | \"review\" | \"plan\";\n\n/** Subagent lane types recognized by the classifier and resolver. */\nexport type ReasoningLaneType = \"planner\" | \"security\" | \"explorer\" | \"coder\" | \"reviewer\" | \"tester\";\n\nexport interface TaskClassifierInput {\n\tprompt: string;\n\tlaneType?: ReasoningLaneType;\n}\n\n/** Prompts shorter than this (trimmed) classify as trivial when no stronger signal matches. */\nconst TRIVIAL_MAX_CHARS = 40;\n/** Prompts at/above this length with no keyword/code/diff signal are treated as long prose briefs (plan). */\nconst COMPLEX_PROSE_MIN_CHARS = 2400;\n\n/**\n * Keyword families in FIXED precedence order:\n * debug > refactor > review > plan > simple-edit > code-gen.\n * The first matching family wins; ties are impossible by construction.\n * Patterns are case-insensitive and stateless (no `g` flag, so no lastIndex carry-over).\n */\nconst KEYWORD_FAMILIES: ReadonlyArray<{ taskClass: TaskClass; pattern: RegExp }> = [\n\t{\n\t\ttaskClass: \"debug\",\n\t\tpattern:\n\t\t\t/\\b(debug(ging)?|bugs?|fix(es|ing|ed)?|errors?|exceptions?|crash(es|ing|ed)?|stack\\s*trace|traceback|regressions?|broken|fail(s|ing|ed|ure|ures)?|flaky|reproduce)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"refactor\",\n\t\tpattern:\n\t\t\t/\\b(refactor(ing|ed)?|restructur(e|ing)|renam(e|ing)|extract(ing)?|clean\\s*up|cleanup|simplif(y|ying|ied)|deduplicat(e|ing)|reorganiz(e|ing)|rewrit(e|ing)|modulariz(e|ing))\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"review\",\n\t\tpattern: /\\b(review(s|ing|ed)?|audit(s|ing|ed)?|critique|assess(ing|ment)?|inspect(ing)?|lgtm|approve)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"plan\",\n\t\tpattern:\n\t\t\t/\\b(plan(s|ning)?|design(s|ing)?|architect(s|ure|ing)?|roadmap|spec(s|ification|ifications)?|strateg(y|ies|ize)|decompos(e|ing|ition)|break\\s+(this\\s+|it\\s+)?down|milestones?)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"simple-edit\",\n\t\tpattern:\n\t\t\t/\\b(typos?|tweak(s|ing|ed)?|one-?liner?|single\\s+line|bump(s|ing|ed)?|whitespace|reword(s|ing|ed)?|indentation|punctuation)\\b/i,\n\t},\n\t{\n\t\ttaskClass: \"code-gen\",\n\t\tpattern:\n\t\t\t/\\b(implement(s|ing|ation)?|writ(e|ing)|creat(e|es|ing)|add(s|ing|ed)?|build(s|ing)?|generat(e|es|ing)|scaffold(ing)?|prototype)\\b/i,\n\t},\n];\n\n/** Fallback class per lane when no keyword, code/diff, or length signal decides. */\nconst LANE_FALLBACK_CLASS: Record<ReasoningLaneType, TaskClass> = {\n\tplanner: \"plan\",\n\tsecurity: \"review\",\n\texplorer: \"review\",\n\tcoder: \"code-gen\",\n\treviewer: \"review\",\n\ttester: \"code-gen\",\n};\n\nfunction hasCodeFence(text: string): boolean {\n\treturn text.includes(\"```\");\n}\n\n/**\n * Diff detection: explicit hunk (`@@ ... @@`) or `diff --git` headers count alone;\n * bare `+`/`-` line starts only count when both added AND removed lines are present\n * (avoids false positives on markdown bullet lists).\n */\nfunction hasDiffMarkers(text: string): boolean {\n\tif (/^@@[^\\n]*@@/m.test(text) || /^diff --git /m.test(text)) return true;\n\treturn /^\\+(?!\\+)/m.test(text) && /^-(?!-)/m.test(text);\n}\n\n/**\n * Classify a turn deterministically. Signal precedence (first match wins):\n * 1. Keyword families (debug > refactor > review > plan > simple-edit > code-gen)\n * 2. Code fence or diff markers -> code-gen\n * 3. Trimmed length < TRIVIAL_MAX_CHARS -> trivial\n * 4. Trimmed length >= COMPLEX_PROSE_MIN_CHARS -> plan (long prose brief)\n * 5. Lane fallback (see LANE_FALLBACK_CLASS)\n * 6. Default -> code-gen\n */\nexport function classifyTask(input: TaskClassifierInput): TaskClass {\n\tconst prompt = input.prompt.trim();\n\n\tfor (const family of KEYWORD_FAMILIES) {\n\t\tif (family.pattern.test(prompt)) return family.taskClass;\n\t}\n\n\tif (hasCodeFence(prompt) || hasDiffMarkers(prompt)) return \"code-gen\";\n\tif (prompt.length < TRIVIAL_MAX_CHARS) return \"trivial\";\n\tif (prompt.length >= COMPLEX_PROSE_MIN_CHARS) return \"plan\";\n\tif (input.laneType) return LANE_FALLBACK_CLASS[input.laneType];\n\treturn \"code-gen\";\n}\n\n/** Reasoning ladder used for targets and clamping. Intentionally excludes \"off\". */\nconst REASONING_LADDER: readonly ThinkingLevel[] = [\"minimal\", \"low\", \"medium\", \"high\", \"xhigh\", \"max\"];\n\n/** Static rule table: task class -> recommended ThinkingLevel (before lane adjustment and clamping). */\nexport const TASK_CLASS_THINKING_LEVELS: Readonly<Record<TaskClass, ThinkingLevel>> = {\n\ttrivial: \"minimal\",\n\t\"simple-edit\": \"low\",\n\t\"code-gen\": \"medium\",\n\tdebug: \"high\",\n\trefactor: \"high\",\n\treview: \"high\",\n\tplan: \"xhigh\",\n};\n\n/** Lane adjustment in ladder steps: planner/security escalate, explorer de-escalates. */\nconst LANE_STEP: Readonly<Partial<Record<ReasoningLaneType, 1 | -1>>> = {\n\tplanner: 1,\n\tsecurity: 1,\n\texplorer: -1,\n};\n\n/**\n * Resolve the recommended ThinkingLevel for a task class:\n * 1. Look up the static rule table.\n * 2. Apply the lane adjustment (one ladder step, saturating at ladder ends).\n * 3. Clamp to the highest level in `availableLevels` that is <= the target;\n *    if no available level is at/below the target, return the lowest available\n *    reasoning level. Never invents a level outside `availableLevels`.\n *\n * `\"off\"` is never a router output for reasoning models. If `availableLevels`\n * contains no ladder level at all (e.g. a non-reasoning model exposing only\n * \"off\"), the first available level is returned; callers are expected to\n * bypass the router entirely for models with `reasoning: false`.\n */\nexport function resolveThinkingLevel(\n\ttaskClass: TaskClass,\n\tavailableLevels: readonly ThinkingLevel[],\n\tlaneType?: ReasoningLaneType,\n): ThinkingLevel {\n\tconst baseIndex = REASONING_LADDER.indexOf(TASK_CLASS_THINKING_LEVELS[taskClass]);\n\tconst step = laneType ? (LANE_STEP[laneType] ?? 0) : 0;\n\tconst targetIndex = Math.min(Math.max(baseIndex + step, 0), REASONING_LADDER.length - 1);\n\n\tconst availableOnLadder = REASONING_LADDER.filter((level) => availableLevels.includes(level));\n\tif (availableOnLadder.length === 0) {\n\t\treturn availableLevels[0] ?? \"off\";\n\t}\n\n\tfor (let i = targetIndex; i >= 0; i--) {\n\t\tconst candidate = REASONING_LADDER[i];\n\t\tif (availableOnLadder.includes(candidate)) return candidate;\n\t}\n\treturn availableOnLadder[0];\n}\n"]}

package/dist/core/router-feedback-collector.d.ts

@@ -0,0 +1,101 @@
+/**
+ * Router feedback collector — Goal 009 Wave 1 Lane L (privacy-safe learning ledger).
+ *
+ * Default-off, privacy-safe local ledger for a future reasoning-router learning
+ * feature. This module is a pure, standalone utility: nothing here is wired
+ * into agent-session.ts, settings-manager.ts, or any other product entry point
+ * by this lane. A future, separately-reviewed wiring lane decides where
+ * `enabled` comes from (a settings key) and when `appendRouterFeedbackRecord`
+ * is actually called.
+ *
+ * ============================================================================
+ * SCHEMA (exactly ten allowed keys — see `RouterFeedbackRecord`)
+ * ============================================================================
+ * routerVersion, laneType, predictedClass, resolvedLevel, acceptedLevel,
+ * signal, outcome, lenBucket, hadFence, hadDiff. Every field is a bounded
+ * enum/number/boolean value. There is no field, in this type or in the runtime
+ * validator below, that can carry raw prompt text, a prompt hash, an exact
+ * prompt length, a file path, a diff/code blob, a session id, a model id, a
+ * provider payload, or any hook/tool stdout/stderr. `isRouterFeedbackRecord`
+ * rejects ANY object with an unrecognized key (including all of the fields
+ * just listed) — the schema is the redaction policy, enforced structurally by
+ * an exact key-set check, not by a best-effort denylist of forbidden names.
+ * ============================================================================
+ */
+import type { ReasoningLaneTypeV3, TaskClassV3 } from "./reasoning-router-v3.ts";
+/** Router versions eligible to tag a feedback record (mirrors agent-session.ts's ThinkingRouterVersion). */
+export type RouterFeedbackVersion = "v1" | "v2" | "v3" | "v4";
+/** Lane type at record time, or "none" for a non-subagent turn. */
+export type RouterFeedbackLaneType = ReasoningLaneTypeV3 | "none";
+/** Router task class; reuses the v3 (== v2) closed task-class union — never a raw prompt. */
+export type RouterFeedbackTaskClass = TaskClassV3;
+/**
+ * Reasoning ladder level, excluding "off": mirrors REASONING_LADDER_V2 in
+ * reasoning-router-v2.ts. The router never *resolves* to "off"; turning
+ * thinking off entirely is a distinct manual action outside this ledger.
+ */
+export type RouterFeedbackLevel = "minimal" | "low" | "medium" | "high" | "xhigh" | "max";
+/** Feedback signal source. */
+export type RouterFeedbackSignal = "s1-override" | "s2-accept" | "s3-hook-outcome" | "s4-regression";
+/** Coarse outcome tag; never hook stdout/stderr or tool output. */
+export type RouterFeedbackOutcome = "up" | "down" | "same" | "accepted" | "pass" | "fail" | "debug-follow-up";
+/** floor(log2(len+1)) clamped to [0,7] — a coarse bucket, never the raw prompt length. */
+export type RouterFeedbackLenBucket = 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7;
+/**
+ * One JSONL ledger record. Exactly these ten keys; see `isRouterFeedbackRecord`
+ * for the runtime allowlist enforcement.
+ */
+export interface RouterFeedbackRecord {
+    readonly routerVersion: RouterFeedbackVersion;
+    readonly laneType: RouterFeedbackLaneType;
+    readonly predictedClass: RouterFeedbackTaskClass;
+    readonly resolvedLevel: RouterFeedbackLevel;
+    readonly acceptedLevel: RouterFeedbackLevel;
+    readonly signal: RouterFeedbackSignal;
+    readonly outcome: RouterFeedbackOutcome;
+    readonly lenBucket: RouterFeedbackLenBucket;
+    readonly hadFence: boolean;
+    readonly hadDiff: boolean;
+}
+export declare const ROUTER_FEEDBACK_VERSIONS: readonly RouterFeedbackVersion[];
+export declare const ROUTER_FEEDBACK_LANE_TYPES: readonly RouterFeedbackLaneType[];
+export declare const ROUTER_FEEDBACK_TASK_CLASSES: readonly RouterFeedbackTaskClass[];
+export declare const ROUTER_FEEDBACK_LEN_BUCKETS: readonly RouterFeedbackLenBucket[];
+/**
+ * Strict runtime validator: exactly the ten allowed keys (no more, no fewer),
+ * each within its bounded value set. Returns false for any extra key —
+ * including a raw prompt, file path, diff, session id, model id, provider
+ * payload, or hook/tool-output-shaped field — because ANY unrecognized key
+ * fails the exact key-set check before any per-field check runs.
+ */
+export declare function isRouterFeedbackRecord(value: unknown): value is RouterFeedbackRecord;
+/** Default ledger path: `<agentDir>/router-feedback/ledger.jsonl` (owner-only, never repo-local). */
+export declare function getDefaultRouterFeedbackLedgerPath(): string;
+export interface AppendRouterFeedbackOptions {
+    /** Consent gate. Must be exactly `true`; anything else performs zero filesystem access. */
+    readonly enabled: boolean;
+    /** Ledger file path override (tests / callers only); defaults to the owner-only agent-dir ledger. */
+    readonly ledgerPath?: string;
+}
+export type AppendRouterFeedbackReason = "disabled" | "invalid-schema" | "symlink-refused" | "not-regular-file" | "io-error";
+export type AppendRouterFeedbackResult = {
+    readonly appended: true;
+} | {
+    readonly appended: false;
+    readonly reason: AppendRouterFeedbackReason;
+};
+/**
+ * Append one validated feedback record as a single JSONL line.
+ *
+ * Requires `options.enabled === true` (checked first, before any filesystem
+ * access whatsoever — disabled or omitted consent never touches disk).
+ * Validates the record against the exact ten-key schema before any I/O.
+ * Refuses symlinks and non-regular files where the platform allows detecting
+ * them (`O_NOFOLLOW` plus an `lstat` pre-check as defense-in-depth; `O_NOFOLLOW`
+ * is unavailable on some platforms, hence "when possible"). Reuses the same
+ * `proper-lockfile` dependency as settings-manager.ts/auth-storage.ts for
+ * concurrent-session safety. Never throws for expected failure modes — it
+ * returns a tagged result so a caller can fail closed silently.
+ */
+export declare function appendRouterFeedbackRecord(record: unknown, options: AppendRouterFeedbackOptions): AppendRouterFeedbackResult;
+//# sourceMappingURL=router-feedback-collector.d.ts.map

package/dist/core/router-feedback-collector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"router-feedback-collector.d.ts","sourceRoot":"","sources":["../../src/core/router-feedback-collector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAgBH,OAAO,KAAK,EAAE,mBAAmB,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAEjF,4GAA4G;AAC5G,MAAM,MAAM,qBAAqB,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;AAE9D,mEAAmE;AACnE,MAAM,MAAM,sBAAsB,GAAG,mBAAmB,GAAG,MAAM,CAAC;AAElE,+FAA6F;AAC7F,MAAM,MAAM,uBAAuB,GAAG,WAAW,CAAC;AAElD;;;;GAIG;AACH,MAAM,MAAM,mBAAmB,GAAG,SAAS,GAAG,KAAK,GAAG,QAAQ,GAAG,MAAM,GAAG,OAAO,GAAG,KAAK,CAAC;AAE1F,8BAA8B;AAC9B,MAAM,MAAM,oBAAoB,GAAG,aAAa,GAAG,WAAW,GAAG,iBAAiB,GAAG,eAAe,CAAC;AAErG,mEAAmE;AACnE,MAAM,MAAM,qBAAqB,GAAG,IAAI,GAAG,MAAM,GAAG,MAAM,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,GAAG,iBAAiB,CAAC;AAE9G,4FAA0F;AAC1F,MAAM,MAAM,uBAAuB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAEpE;;;GAGG;AACH,MAAM,WAAW,oBAAoB;IACpC,QAAQ,CAAC,aAAa,EAAE,qBAAqB,CAAC;IAC9C,QAAQ,CAAC,QAAQ,EAAE,sBAAsB,CAAC;IAC1C,QAAQ,CAAC,cAAc,EAAE,uBAAuB,CAAC;IACjD,QAAQ,CAAC,aAAa,EAAE,mBAAmB,CAAC;IAC5C,QAAQ,CAAC,aAAa,EAAE,mBAAmB,CAAC;IAC5C,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,QAAQ,CAAC,OAAO,EAAE,qBAAqB,CAAC;IACxC,QAAQ,CAAC,SAAS,EAAE,uBAAuB,CAAC;IAC5C,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC1B;AAED,eAAO,MAAM,wBAAwB,EAAE,SAAS,qBAAqB,EAA6B,CAAC;AACnG,eAAO,MAAM,0BAA0B,EAAE,SAAS,sBAAsB,EAQvE,CAAC;AACF,eAAO,MAAM,4BAA4B,EAAE,SAAS,uBAAuB,EAQ1E,CAAC;AAiBF,eAAO,MAAM,2BAA2B,EAAE,SAAS,uBAAuB,EAA6B,CAAC;AA6BxG;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,oBAAoB,CAgBpF;AAED,qGAAqG;AACrG,wBAAgB,kCAAkC,IAAI,MAAM,CAE3D;AAED,MAAM,WAAW,2BAA2B;IAC3C,2FAA2F;IAC3F,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,qGAAqG;IACrG,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,MAAM,0BAA0B,GACnC,UAAU,GACV,gBAAgB,GAChB,iBAAiB,GACjB,kBAAkB,GAClB,UAAU,CAAC;AAEd,MAAM,MAAM,0BAA0B,GACnC;IAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAA;CAAE,GAC3B;IAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,0BAA0B,CAAA;CAAE,CAAC;AAgD7E;;;;;;;;;;;;GAYG;AACH,wBAAgB,0BAA0B,CACzC,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,2BAA2B,GAClC,0BAA0B,CAwD5B","sourcesContent":["/**\n * Router feedback collector — Goal 009 Wave 1 Lane L (privacy-safe learning ledger).\n *\n * Default-off, privacy-safe local ledger for a future reasoning-router learning\n * feature. This module is a pure, standalone utility: nothing here is wired\n * into agent-session.ts, settings-manager.ts, or any other product entry point\n * by this lane. A future, separately-reviewed wiring lane decides where\n * `enabled` comes from (a settings key) and when `appendRouterFeedbackRecord`\n * is actually called.\n *\n * ============================================================================\n * SCHEMA (exactly ten allowed keys — see `RouterFeedbackRecord`)\n * ============================================================================\n * routerVersion, laneType, predictedClass, resolvedLevel, acceptedLevel,\n * signal, outcome, lenBucket, hadFence, hadDiff. Every field is a bounded\n * enum/number/boolean value. There is no field, in this type or in the runtime\n * validator below, that can carry raw prompt text, a prompt hash, an exact\n * prompt length, a file path, a diff/code blob, a session id, a model id, a\n * provider payload, or any hook/tool stdout/stderr. `isRouterFeedbackRecord`\n * rejects ANY object with an unrecognized key (including all of the fields\n * just listed) — the schema is the redaction policy, enforced structurally by\n * an exact key-set check, not by a best-effort denylist of forbidden names.\n * ============================================================================\n */\n\nimport {\n\tchmodSync,\n\tcloseSync,\n\texistsSync,\n\tconstants as fsConstants,\n\tfstatSync,\n\tlstatSync,\n\tmkdirSync,\n\topenSync,\n\twriteSync,\n} from \"fs\";\nimport { dirname, join } from \"path\";\nimport lockfile from \"proper-lockfile\";\nimport { getAgentDir } from \"../config.ts\";\nimport type { ReasoningLaneTypeV3, TaskClassV3 } from \"./reasoning-router-v3.ts\";\n\n/** Router versions eligible to tag a feedback record (mirrors agent-session.ts's ThinkingRouterVersion). */\nexport type RouterFeedbackVersion = \"v1\" | \"v2\" | \"v3\" | \"v4\";\n\n/** Lane type at record time, or \"none\" for a non-subagent turn. */\nexport type RouterFeedbackLaneType = ReasoningLaneTypeV3 | \"none\";\n\n/** Router task class; reuses the v3 (== v2) closed task-class union — never a raw prompt. */\nexport type RouterFeedbackTaskClass = TaskClassV3;\n\n/**\n * Reasoning ladder level, excluding \"off\": mirrors REASONING_LADDER_V2 in\n * reasoning-router-v2.ts. The router never *resolves* to \"off\"; turning\n * thinking off entirely is a distinct manual action outside this ledger.\n */\nexport type RouterFeedbackLevel = \"minimal\" | \"low\" | \"medium\" | \"high\" | \"xhigh\" | \"max\";\n\n/** Feedback signal source. */\nexport type RouterFeedbackSignal = \"s1-override\" | \"s2-accept\" | \"s3-hook-outcome\" | \"s4-regression\";\n\n/** Coarse outcome tag; never hook stdout/stderr or tool output. */\nexport type RouterFeedbackOutcome = \"up\" | \"down\" | \"same\" | \"accepted\" | \"pass\" | \"fail\" | \"debug-follow-up\";\n\n/** floor(log2(len+1)) clamped to [0,7] — a coarse bucket, never the raw prompt length. */\nexport type RouterFeedbackLenBucket = 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7;\n\n/**\n * One JSONL ledger record. Exactly these ten keys; see `isRouterFeedbackRecord`\n * for the runtime allowlist enforcement.\n */\nexport interface RouterFeedbackRecord {\n\treadonly routerVersion: RouterFeedbackVersion;\n\treadonly laneType: RouterFeedbackLaneType;\n\treadonly predictedClass: RouterFeedbackTaskClass;\n\treadonly resolvedLevel: RouterFeedbackLevel;\n\treadonly acceptedLevel: RouterFeedbackLevel;\n\treadonly signal: RouterFeedbackSignal;\n\treadonly outcome: RouterFeedbackOutcome;\n\treadonly lenBucket: RouterFeedbackLenBucket;\n\treadonly hadFence: boolean;\n\treadonly hadDiff: boolean;\n}\n\nexport const ROUTER_FEEDBACK_VERSIONS: readonly RouterFeedbackVersion[] = [\"v1\", \"v2\", \"v3\", \"v4\"];\nexport const ROUTER_FEEDBACK_LANE_TYPES: readonly RouterFeedbackLaneType[] = [\n\t\"planner\",\n\t\"security\",\n\t\"explorer\",\n\t\"coder\",\n\t\"reviewer\",\n\t\"tester\",\n\t\"none\",\n];\nexport const ROUTER_FEEDBACK_TASK_CLASSES: readonly RouterFeedbackTaskClass[] = [\n\t\"trivial\",\n\t\"simple-edit\",\n\t\"code-gen\",\n\t\"debug\",\n\t\"refactor\",\n\t\"review\",\n\t\"plan\",\n];\nconst ROUTER_FEEDBACK_LEVELS: readonly RouterFeedbackLevel[] = [\"minimal\", \"low\", \"medium\", \"high\", \"xhigh\", \"max\"];\nconst ROUTER_FEEDBACK_SIGNALS: readonly RouterFeedbackSignal[] = [\n\t\"s1-override\",\n\t\"s2-accept\",\n\t\"s3-hook-outcome\",\n\t\"s4-regression\",\n];\nconst ROUTER_FEEDBACK_OUTCOMES: readonly RouterFeedbackOutcome[] = [\n\t\"up\",\n\t\"down\",\n\t\"same\",\n\t\"accepted\",\n\t\"pass\",\n\t\"fail\",\n\t\"debug-follow-up\",\n];\nexport const ROUTER_FEEDBACK_LEN_BUCKETS: readonly RouterFeedbackLenBucket[] = [0, 1, 2, 3, 4, 5, 6, 7];\n\n/** Exact allowed key set for `RouterFeedbackRecord`, sorted for canonical set-equality comparison. */\nconst ROUTER_FEEDBACK_RECORD_KEYS: readonly string[] = [\n\t\"routerVersion\",\n\t\"laneType\",\n\t\"predictedClass\",\n\t\"resolvedLevel\",\n\t\"acceptedLevel\",\n\t\"signal\",\n\t\"outcome\",\n\t\"lenBucket\",\n\t\"hadFence\",\n\t\"hadDiff\",\n].sort();\n\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\n\treturn typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\nfunction hasExactRouterFeedbackKeySet(value: Record<string, unknown>): boolean {\n\tconst keys = Object.keys(value).sort();\n\tif (keys.length !== ROUTER_FEEDBACK_RECORD_KEYS.length) return false;\n\tfor (let i = 0; i < keys.length; i++) {\n\t\tif (keys[i] !== ROUTER_FEEDBACK_RECORD_KEYS[i]) return false;\n\t}\n\treturn true;\n}\n\n/**\n * Strict runtime validator: exactly the ten allowed keys (no more, no fewer),\n * each within its bounded value set. Returns false for any extra key —\n * including a raw prompt, file path, diff, session id, model id, provider\n * payload, or hook/tool-output-shaped field — because ANY unrecognized key\n * fails the exact key-set check before any per-field check runs.\n */\nexport function isRouterFeedbackRecord(value: unknown): value is RouterFeedbackRecord {\n\tif (!isPlainObject(value)) return false;\n\tif (!hasExactRouterFeedbackKeySet(value)) return false;\n\n\tif (!ROUTER_FEEDBACK_VERSIONS.includes(value.routerVersion as RouterFeedbackVersion)) return false;\n\tif (!ROUTER_FEEDBACK_LANE_TYPES.includes(value.laneType as RouterFeedbackLaneType)) return false;\n\tif (!ROUTER_FEEDBACK_TASK_CLASSES.includes(value.predictedClass as RouterFeedbackTaskClass)) return false;\n\tif (!ROUTER_FEEDBACK_LEVELS.includes(value.resolvedLevel as RouterFeedbackLevel)) return false;\n\tif (!ROUTER_FEEDBACK_LEVELS.includes(value.acceptedLevel as RouterFeedbackLevel)) return false;\n\tif (!ROUTER_FEEDBACK_SIGNALS.includes(value.signal as RouterFeedbackSignal)) return false;\n\tif (!ROUTER_FEEDBACK_OUTCOMES.includes(value.outcome as RouterFeedbackOutcome)) return false;\n\tif (!ROUTER_FEEDBACK_LEN_BUCKETS.includes(value.lenBucket as RouterFeedbackLenBucket)) return false;\n\tif (typeof value.hadFence !== \"boolean\") return false;\n\tif (typeof value.hadDiff !== \"boolean\") return false;\n\n\treturn true;\n}\n\n/** Default ledger path: `<agentDir>/router-feedback/ledger.jsonl` (owner-only, never repo-local). */\nexport function getDefaultRouterFeedbackLedgerPath(): string {\n\treturn join(getAgentDir(), \"router-feedback\", \"ledger.jsonl\");\n}\n\nexport interface AppendRouterFeedbackOptions {\n\t/** Consent gate. Must be exactly `true`; anything else performs zero filesystem access. */\n\treadonly enabled: boolean;\n\t/** Ledger file path override (tests / callers only); defaults to the owner-only agent-dir ledger. */\n\treadonly ledgerPath?: string;\n}\n\nexport type AppendRouterFeedbackReason =\n\t| \"disabled\"\n\t| \"invalid-schema\"\n\t| \"symlink-refused\"\n\t| \"not-regular-file\"\n\t| \"io-error\";\n\nexport type AppendRouterFeedbackResult =\n\t| { readonly appended: true }\n\t| { readonly appended: false; readonly reason: AppendRouterFeedbackReason };\n\n/** True when `path` exists and is a symlink. Uses `lstat` so it never follows the link. */\nfunction isSymlinkPath(path: string): boolean {\n\ttry {\n\t\treturn lstatSync(path).isSymbolicLink();\n\t} catch {\n\t\treturn false;\n\t}\n}\n\nfunction errorCode(error: unknown): string | undefined {\n\treturn typeof error === \"object\" && error !== null && \"code\" in error\n\t\t? String((error as { code?: unknown }).code)\n\t\t: undefined;\n}\n\nfunction acquireLedgerLockSync(path: string): () => void {\n\tconst maxAttempts = 10;\n\tconst delayMs = 20;\n\tlet lastError: unknown;\n\n\tfor (let attempt = 1; attempt <= maxAttempts; attempt++) {\n\t\ttry {\n\t\t\treturn lockfile.lockSync(path, { realpath: false });\n\t\t} catch (error) {\n\t\t\tif (errorCode(error) !== \"ELOCKED\" || attempt === maxAttempts) {\n\t\t\t\tthrow error;\n\t\t\t}\n\t\t\tlastError = error;\n\t\t\tconst start = Date.now();\n\t\t\twhile (Date.now() - start < delayMs) {\n\t\t\t\t// Busy-wait briefly; mirrors the auth-storage/settings-manager sync retry pattern.\n\t\t\t}\n\t\t}\n\t}\n\n\tthrow (lastError as Error) ?? new Error(\"Failed to acquire router-feedback ledger lock\");\n}\n\n/**\n * O_NOFOLLOW is undefined on some platforms (notably Windows); `?? 0` keeps\n * the flag combination valid there, and the `lstat` pre-checks above/below\n * remain the fallback symlink guard on platforms without O_NOFOLLOW.\n */\nconst LEDGER_OPEN_FLAGS =\n\tfsConstants.O_CREAT | fsConstants.O_APPEND | fsConstants.O_WRONLY | (fsConstants.O_NOFOLLOW ?? 0);\n\n/**\n * Append one validated feedback record as a single JSONL line.\n *\n * Requires `options.enabled === true` (checked first, before any filesystem\n * access whatsoever — disabled or omitted consent never touches disk).\n * Validates the record against the exact ten-key schema before any I/O.\n * Refuses symlinks and non-regular files where the platform allows detecting\n * them (`O_NOFOLLOW` plus an `lstat` pre-check as defense-in-depth; `O_NOFOLLOW`\n * is unavailable on some platforms, hence \"when possible\"). Reuses the same\n * `proper-lockfile` dependency as settings-manager.ts/auth-storage.ts for\n * concurrent-session safety. Never throws for expected failure modes — it\n * returns a tagged result so a caller can fail closed silently.\n */\nexport function appendRouterFeedbackRecord(\n\trecord: unknown,\n\toptions: AppendRouterFeedbackOptions,\n): AppendRouterFeedbackResult {\n\tif (options.enabled !== true) {\n\t\treturn { appended: false, reason: \"disabled\" };\n\t}\n\tif (!isRouterFeedbackRecord(record)) {\n\t\treturn { appended: false, reason: \"invalid-schema\" };\n\t}\n\n\tconst ledgerPath = options.ledgerPath ?? getDefaultRouterFeedbackLedgerPath();\n\tconst ledgerDir = dirname(ledgerPath);\n\n\ttry {\n\t\tif (isSymlinkPath(ledgerDir)) {\n\t\t\treturn { appended: false, reason: \"symlink-refused\" };\n\t\t}\n\t\tif (!existsSync(ledgerDir)) {\n\t\t\tmkdirSync(ledgerDir, { recursive: true, mode: 0o700 });\n\t\t}\n\t\tif (isSymlinkPath(ledgerPath)) {\n\t\t\treturn { appended: false, reason: \"symlink-refused\" };\n\t\t}\n\n\t\tlet release: (() => void) | undefined;\n\t\ttry {\n\t\t\trelease = acquireLedgerLockSync(ledgerPath);\n\n\t\t\tif (isSymlinkPath(ledgerPath)) {\n\t\t\t\treturn { appended: false, reason: \"symlink-refused\" };\n\t\t\t}\n\n\t\t\tlet fd: number;\n\t\t\ttry {\n\t\t\t\tfd = openSync(ledgerPath, LEDGER_OPEN_FLAGS, 0o600);\n\t\t\t} catch (error) {\n\t\t\t\tif (errorCode(error) === \"ELOOP\") {\n\t\t\t\t\treturn { appended: false, reason: \"symlink-refused\" };\n\t\t\t\t}\n\t\t\t\tthrow error;\n\t\t\t}\n\n\t\t\ttry {\n\t\t\t\tif (!fstatSync(fd).isFile()) {\n\t\t\t\t\treturn { appended: false, reason: \"not-regular-file\" };\n\t\t\t\t}\n\t\t\t\twriteSync(fd, `${JSON.stringify(record)}\\n`);\n\t\t\t} finally {\n\t\t\t\tcloseSync(fd);\n\t\t\t}\n\t\t\tchmodSync(ledgerPath, 0o600);\n\t\t\treturn { appended: true };\n\t\t} finally {\n\t\t\tif (release) release();\n\t\t}\n\t} catch {\n\t\treturn { appended: false, reason: \"io-error\" };\n\t}\n}\n"]}

package/dist/core/router-feedback-collector.js

@@ -0,0 +1,239 @@
+/**
+ * Router feedback collector — Goal 009 Wave 1 Lane L (privacy-safe learning ledger).
+ *
+ * Default-off, privacy-safe local ledger for a future reasoning-router learning
+ * feature. This module is a pure, standalone utility: nothing here is wired
+ * into agent-session.ts, settings-manager.ts, or any other product entry point
+ * by this lane. A future, separately-reviewed wiring lane decides where
+ * `enabled` comes from (a settings key) and when `appendRouterFeedbackRecord`
+ * is actually called.
+ *
+ * ============================================================================
+ * SCHEMA (exactly ten allowed keys — see `RouterFeedbackRecord`)
+ * ============================================================================
+ * routerVersion, laneType, predictedClass, resolvedLevel, acceptedLevel,
+ * signal, outcome, lenBucket, hadFence, hadDiff. Every field is a bounded
+ * enum/number/boolean value. There is no field, in this type or in the runtime
+ * validator below, that can carry raw prompt text, a prompt hash, an exact
+ * prompt length, a file path, a diff/code blob, a session id, a model id, a
+ * provider payload, or any hook/tool stdout/stderr. `isRouterFeedbackRecord`
+ * rejects ANY object with an unrecognized key (including all of the fields
+ * just listed) — the schema is the redaction policy, enforced structurally by
+ * an exact key-set check, not by a best-effort denylist of forbidden names.
+ * ============================================================================
+ */
+import { chmodSync, closeSync, existsSync, constants as fsConstants, fstatSync, lstatSync, mkdirSync, openSync, writeSync, } from "fs";
+import { dirname, join } from "path";
+import lockfile from "proper-lockfile";
+import { getAgentDir } from "../config.js";
+export const ROUTER_FEEDBACK_VERSIONS = ["v1", "v2", "v3", "v4"];
+export const ROUTER_FEEDBACK_LANE_TYPES = [
+    "planner",
+    "security",
+    "explorer",
+    "coder",
+    "reviewer",
+    "tester",
+    "none",
+];
+export const ROUTER_FEEDBACK_TASK_CLASSES = [
+    "trivial",
+    "simple-edit",
+    "code-gen",
+    "debug",
+    "refactor",
+    "review",
+    "plan",
+];
+const ROUTER_FEEDBACK_LEVELS = ["minimal", "low", "medium", "high", "xhigh", "max"];
+const ROUTER_FEEDBACK_SIGNALS = [
+    "s1-override",
+    "s2-accept",
+    "s3-hook-outcome",
+    "s4-regression",
+];
+const ROUTER_FEEDBACK_OUTCOMES = [
+    "up",
+    "down",
+    "same",
+    "accepted",
+    "pass",
+    "fail",
+    "debug-follow-up",
+];
+export const ROUTER_FEEDBACK_LEN_BUCKETS = [0, 1, 2, 3, 4, 5, 6, 7];
+/** Exact allowed key set for `RouterFeedbackRecord`, sorted for canonical set-equality comparison. */
+const ROUTER_FEEDBACK_RECORD_KEYS = [
+    "routerVersion",
+    "laneType",
+    "predictedClass",
+    "resolvedLevel",
+    "acceptedLevel",
+    "signal",
+    "outcome",
+    "lenBucket",
+    "hadFence",
+    "hadDiff",
+].sort();
+function isPlainObject(value) {
+    return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function hasExactRouterFeedbackKeySet(value) {
+    const keys = Object.keys(value).sort();
+    if (keys.length !== ROUTER_FEEDBACK_RECORD_KEYS.length)
+        return false;
+    for (let i = 0; i < keys.length; i++) {
+        if (keys[i] !== ROUTER_FEEDBACK_RECORD_KEYS[i])
+            return false;
+    }
+    return true;
+}
+/**
+ * Strict runtime validator: exactly the ten allowed keys (no more, no fewer),
+ * each within its bounded value set. Returns false for any extra key —
+ * including a raw prompt, file path, diff, session id, model id, provider
+ * payload, or hook/tool-output-shaped field — because ANY unrecognized key
+ * fails the exact key-set check before any per-field check runs.
+ */
+export function isRouterFeedbackRecord(value) {
+    if (!isPlainObject(value))
+        return false;
+    if (!hasExactRouterFeedbackKeySet(value))
+        return false;
+    if (!ROUTER_FEEDBACK_VERSIONS.includes(value.routerVersion))
+        return false;
+    if (!ROUTER_FEEDBACK_LANE_TYPES.includes(value.laneType))
+        return false;
+    if (!ROUTER_FEEDBACK_TASK_CLASSES.includes(value.predictedClass))
+        return false;
+    if (!ROUTER_FEEDBACK_LEVELS.includes(value.resolvedLevel))
+        return false;
+    if (!ROUTER_FEEDBACK_LEVELS.includes(value.acceptedLevel))
+        return false;
+    if (!ROUTER_FEEDBACK_SIGNALS.includes(value.signal))
+        return false;
+    if (!ROUTER_FEEDBACK_OUTCOMES.includes(value.outcome))
+        return false;
+    if (!ROUTER_FEEDBACK_LEN_BUCKETS.includes(value.lenBucket))
+        return false;
+    if (typeof value.hadFence !== "boolean")
+        return false;
+    if (typeof value.hadDiff !== "boolean")
+        return false;
+    return true;
+}
+/** Default ledger path: `<agentDir>/router-feedback/ledger.jsonl` (owner-only, never repo-local). */
+export function getDefaultRouterFeedbackLedgerPath() {
+    return join(getAgentDir(), "router-feedback", "ledger.jsonl");
+}
+/** True when `path` exists and is a symlink. Uses `lstat` so it never follows the link. */
+function isSymlinkPath(path) {
+    try {
+        return lstatSync(path).isSymbolicLink();
+    }
+    catch {
+        return false;
+    }
+}
+function errorCode(error) {
+    return typeof error === "object" && error !== null && "code" in error
+        ? String(error.code)
+        : undefined;
+}
+function acquireLedgerLockSync(path) {
+    const maxAttempts = 10;
+    const delayMs = 20;
+    let lastError;
+    for (let attempt = 1; attempt <= maxAttempts; attempt++) {
+        try {
+            return lockfile.lockSync(path, { realpath: false });
+        }
+        catch (error) {
+            if (errorCode(error) !== "ELOCKED" || attempt === maxAttempts) {
+                throw error;
+            }
+            lastError = error;
+            const start = Date.now();
+            while (Date.now() - start < delayMs) {
+                // Busy-wait briefly; mirrors the auth-storage/settings-manager sync retry pattern.
+            }
+        }
+    }
+    throw lastError ?? new Error("Failed to acquire router-feedback ledger lock");
+}
+/**
+ * O_NOFOLLOW is undefined on some platforms (notably Windows); `?? 0` keeps
+ * the flag combination valid there, and the `lstat` pre-checks above/below
+ * remain the fallback symlink guard on platforms without O_NOFOLLOW.
+ */
+const LEDGER_OPEN_FLAGS = fsConstants.O_CREAT | fsConstants.O_APPEND | fsConstants.O_WRONLY | (fsConstants.O_NOFOLLOW ?? 0);
+/**
+ * Append one validated feedback record as a single JSONL line.
+ *
+ * Requires `options.enabled === true` (checked first, before any filesystem
+ * access whatsoever — disabled or omitted consent never touches disk).
+ * Validates the record against the exact ten-key schema before any I/O.
+ * Refuses symlinks and non-regular files where the platform allows detecting
+ * them (`O_NOFOLLOW` plus an `lstat` pre-check as defense-in-depth; `O_NOFOLLOW`
+ * is unavailable on some platforms, hence "when possible"). Reuses the same
+ * `proper-lockfile` dependency as settings-manager.ts/auth-storage.ts for
+ * concurrent-session safety. Never throws for expected failure modes — it
+ * returns a tagged result so a caller can fail closed silently.
+ */
+export function appendRouterFeedbackRecord(record, options) {
+    if (options.enabled !== true) {
+        return { appended: false, reason: "disabled" };
+    }
+    if (!isRouterFeedbackRecord(record)) {
+        return { appended: false, reason: "invalid-schema" };
+    }
+    const ledgerPath = options.ledgerPath ?? getDefaultRouterFeedbackLedgerPath();
+    const ledgerDir = dirname(ledgerPath);
+    try {
+        if (isSymlinkPath(ledgerDir)) {
+            return { appended: false, reason: "symlink-refused" };
+        }
+        if (!existsSync(ledgerDir)) {
+            mkdirSync(ledgerDir, { recursive: true, mode: 0o700 });
+        }
+        if (isSymlinkPath(ledgerPath)) {
+            return { appended: false, reason: "symlink-refused" };
+        }
+        let release;
+        try {
+            release = acquireLedgerLockSync(ledgerPath);
+            if (isSymlinkPath(ledgerPath)) {
+                return { appended: false, reason: "symlink-refused" };
+            }
+            let fd;
+            try {
+                fd = openSync(ledgerPath, LEDGER_OPEN_FLAGS, 0o600);
+            }
+            catch (error) {
+                if (errorCode(error) === "ELOOP") {
+                    return { appended: false, reason: "symlink-refused" };
+                }
+                throw error;
+            }
+            try {
+                if (!fstatSync(fd).isFile()) {
+                    return { appended: false, reason: "not-regular-file" };
+                }
+                writeSync(fd, `${JSON.stringify(record)}\n`);
+            }
+            finally {
+                closeSync(fd);
+            }
+            chmodSync(ledgerPath, 0o600);
+            return { appended: true };
+        }
+        finally {
+            if (release)
+                release();
+        }
+    }
+    catch {
+        return { appended: false, reason: "io-error" };
+    }
+}
+//# sourceMappingURL=router-feedback-collector.js.map

package/dist/core/router-feedback-collector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"router-feedback-collector.js","sourceRoot":"","sources":["../../src/core/router-feedback-collector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EACN,SAAS,EACT,SAAS,EACT,UAAU,EACV,SAAS,IAAI,WAAW,EACxB,SAAS,EACT,SAAS,EACT,SAAS,EACT,QAAQ,EACR,SAAS,GACT,MAAM,IAAI,CAAC;AACZ,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,QAAQ,MAAM,iBAAiB,CAAC;AACvC,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AA6C3C,MAAM,CAAC,MAAM,wBAAwB,GAAqC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AACnG,MAAM,CAAC,MAAM,0BAA0B,GAAsC;IAC5E,SAAS;IACT,UAAU;IACV,UAAU;IACV,OAAO;IACP,UAAU;IACV,QAAQ;IACR,MAAM;CACN,CAAC;AACF,MAAM,CAAC,MAAM,4BAA4B,GAAuC;IAC/E,SAAS;IACT,aAAa;IACb,UAAU;IACV,OAAO;IACP,UAAU;IACV,QAAQ;IACR,MAAM;CACN,CAAC;AACF,MAAM,sBAAsB,GAAmC,CAAC,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;AACpH,MAAM,uBAAuB,GAAoC;IAChE,aAAa;IACb,WAAW;IACX,iBAAiB;IACjB,eAAe;CACf,CAAC;AACF,MAAM,wBAAwB,GAAqC;IAClE,IAAI;IACJ,MAAM;IACN,MAAM;IACN,UAAU;IACV,MAAM;IACN,MAAM;IACN,iBAAiB;CACjB,CAAC;AACF,MAAM,CAAC,MAAM,2BAA2B,GAAuC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAExG,sGAAsG;AACtG,MAAM,2BAA2B,GAAsB;IACtD,eAAe;IACf,UAAU;IACV,gBAAgB;IAChB,eAAe;IACf,eAAe;IACf,QAAQ;IACR,SAAS;IACT,WAAW;IACX,UAAU;IACV,SAAS;CACT,CAAC,IAAI,EAAE,CAAC;AAET,SAAS,aAAa,CAAC,KAAc,EAAoC;IACxE,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAAA,CAC5E;AAED,SAAS,4BAA4B,CAAC,KAA8B,EAAW;IAC9E,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IACvC,IAAI,IAAI,CAAC,MAAM,KAAK,2BAA2B,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,2BAA2B,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC9D,CAAC;IACD,OAAO,IAAI,CAAC;AAAA,CACZ;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAc,EAAiC;IACrF,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACxC,IAAI,CAAC,4BAA4B,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEvD,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAsC,CAAC;QAAE,OAAO,KAAK,CAAC;IACnG,IAAI,CAAC,0BAA0B,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAkC,CAAC;QAAE,OAAO,KAAK,CAAC;IACjG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAyC,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1G,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAoC,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/F,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAoC,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/F,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,KAAK,CAAC,MAA8B,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1F,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAgC,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7F,IAAI,CAAC,2BAA2B,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAoC,CAAC;QAAE,OAAO,KAAK,CAAC;IACpG,IAAI,OAAO,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACtD,IAAI,OAAO,KAAK,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAErD,OAAO,IAAI,CAAC;AAAA,CACZ;AAED,qGAAqG;AACrG,MAAM,UAAU,kCAAkC,GAAW;IAC5D,OAAO,IAAI,CAAC,WAAW,EAAE,EAAE,iBAAiB,EAAE,cAAc,CAAC,CAAC;AAAA,CAC9D;AAoBD,2FAA2F;AAC3F,SAAS,aAAa,CAAC,IAAY,EAAW;IAC7C,IAAI,CAAC;QACJ,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,cAAc,EAAE,CAAC;IACzC,CAAC;IAAC,MAAM,CAAC;QACR,OAAO,KAAK,CAAC;IACd,CAAC;AAAA,CACD;AAED,SAAS,SAAS,CAAC,KAAc,EAAsB;IACtD,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI,KAAK;QACpE,CAAC,CAAC,MAAM,CAAE,KAA4B,CAAC,IAAI,CAAC;QAC5C,CAAC,CAAC,SAAS,CAAC;AAAA,CACb;AAED,SAAS,qBAAqB,CAAC,IAAY,EAAc;IACxD,MAAM,WAAW,GAAG,EAAE,CAAC;IACvB,MAAM,OAAO,GAAG,EAAE,CAAC;IACnB,IAAI,SAAkB,CAAC;IAEvB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,WAAW,EAAE,OAAO,EAAE,EAAE,CAAC;QACzD,IAAI,CAAC;YACJ,OAAO,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QACrD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,IAAI,SAAS,CAAC,KAAK,CAAC,KAAK,SAAS,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;gBAC/D,MAAM,KAAK,CAAC;YACb,CAAC;YACD,SAAS,GAAG,KAAK,CAAC;YAClB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,OAAO,EAAE,CAAC;gBACrC,mFAAmF;YACpF,CAAC;QACF,CAAC;IACF,CAAC;IAED,MAAO,SAAmB,IAAI,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;AAAA,CACzF;AAED;;;;GAIG;AACH,MAAM,iBAAiB,GACtB,WAAW,CAAC,OAAO,GAAG,WAAW,CAAC,QAAQ,GAAG,WAAW,CAAC,QAAQ,GAAG,CAAC,WAAW,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC;AAEnG;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,0BAA0B,CACzC,MAAe,EACf,OAAoC,EACP;IAC7B,IAAI,OAAO,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;QAC9B,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;IAChD,CAAC;IACD,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,EAAE,CAAC;QACrC,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC;IACtD,CAAC;IAED,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,kCAAkC,EAAE,CAAC;IAC9E,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IAEtC,IAAI,CAAC;QACJ,IAAI,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;YAC9B,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;QACvD,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5B,SAAS,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;QACvD,CAAC;QAED,IAAI,OAAiC,CAAC;QACtC,IAAI,CAAC;YACJ,OAAO,GAAG,qBAAqB,CAAC,UAAU,CAAC,CAAC;YAE5C,IAAI,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC/B,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;YACvD,CAAC;YAED,IAAI,EAAU,CAAC;YACf,IAAI,CAAC;gBACJ,EAAE,GAAG,QAAQ,CAAC,UAAU,EAAE,iBAAiB,EAAE,KAAK,CAAC,CAAC;YACrD,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBAChB,IAAI,SAAS,CAAC,KAAK,CAAC,KAAK,OAAO,EAAE,CAAC;oBAClC,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;gBACvD,CAAC;gBACD,MAAM,KAAK,CAAC;YACb,CAAC;YAED,IAAI,CAAC;gBACJ,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;oBAC7B,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE,CAAC;gBACxD,CAAC;gBACD,SAAS,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9C,CAAC;oBAAS,CAAC;gBACV,SAAS,CAAC,EAAE,CAAC,CAAC;YACf,CAAC;YACD,SAAS,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YAC7B,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;QAC3B,CAAC;gBAAS,CAAC;YACV,IAAI,OAAO;gBAAE,OAAO,EAAE,CAAC;QACxB,CAAC;IACF,CAAC;IAAC,MAAM,CAAC;QACR,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;IAChD,CAAC;AAAA,CACD","sourcesContent":["/**\n * Router feedback collector — Goal 009 Wave 1 Lane L (privacy-safe learning ledger).\n *\n * Default-off, privacy-safe local ledger for a future reasoning-router learning\n * feature. This module is a pure, standalone utility: nothing here is wired\n * into agent-session.ts, settings-manager.ts, or any other product entry point\n * by this lane. A future, separately-reviewed wiring lane decides where\n * `enabled` comes from (a settings key) and when `appendRouterFeedbackRecord`\n * is actually called.\n *\n * ============================================================================\n * SCHEMA (exactly ten allowed keys — see `RouterFeedbackRecord`)\n * ============================================================================\n * routerVersion, laneType, predictedClass, resolvedLevel, acceptedLevel,\n * signal, outcome, lenBucket, hadFence, hadDiff. Every field is a bounded\n * enum/number/boolean value. There is no field, in this type or in the runtime\n * validator below, that can carry raw prompt text, a prompt hash, an exact\n * prompt length, a file path, a diff/code blob, a session id, a model id, a\n * provider payload, or any hook/tool stdout/stderr. `isRouterFeedbackRecord`\n * rejects ANY object with an unrecognized key (including all of the fields\n * just listed) — the schema is the redaction policy, enforced structurally by\n * an exact key-set check, not by a best-effort denylist of forbidden names.\n * ============================================================================\n */\n\nimport {\n\tchmodSync,\n\tcloseSync,\n\texistsSync,\n\tconstants as fsConstants,\n\tfstatSync,\n\tlstatSync,\n\tmkdirSync,\n\topenSync,\n\twriteSync,\n} from \"fs\";\nimport { dirname, join } from \"path\";\nimport lockfile from \"proper-lockfile\";\nimport { getAgentDir } from \"../config.ts\";\nimport type { ReasoningLaneTypeV3, TaskClassV3 } from \"./reasoning-router-v3.ts\";\n\n/** Router versions eligible to tag a feedback record (mirrors agent-session.ts's ThinkingRouterVersion). */\nexport type RouterFeedbackVersion = \"v1\" | \"v2\" | \"v3\" | \"v4\";\n\n/** Lane type at record time, or \"none\" for a non-subagent turn. */\nexport type RouterFeedbackLaneType = ReasoningLaneTypeV3 | \"none\";\n\n/** Router task class; reuses the v3 (== v2) closed task-class union — never a raw prompt. */\nexport type RouterFeedbackTaskClass = TaskClassV3;\n\n/**\n * Reasoning ladder level, excluding \"off\": mirrors REASONING_LADDER_V2 in\n * reasoning-router-v2.ts. The router never *resolves* to \"off\"; turning\n * thinking off entirely is a distinct manual action outside this ledger.\n */\nexport type RouterFeedbackLevel = \"minimal\" | \"low\" | \"medium\" | \"high\" | \"xhigh\" | \"max\";\n\n/** Feedback signal source. */\nexport type RouterFeedbackSignal = \"s1-override\" | \"s2-accept\" | \"s3-hook-outcome\" | \"s4-regression\";\n\n/** Coarse outcome tag; never hook stdout/stderr or tool output. */\nexport type RouterFeedbackOutcome = \"up\" | \"down\" | \"same\" | \"accepted\" | \"pass\" | \"fail\" | \"debug-follow-up\";\n\n/** floor(log2(len+1)) clamped to [0,7] — a coarse bucket, never the raw prompt length. */\nexport type RouterFeedbackLenBucket = 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7;\n\n/**\n * One JSONL ledger record. Exactly these ten keys; see `isRouterFeedbackRecord`\n * for the runtime allowlist enforcement.\n */\nexport interface RouterFeedbackRecord {\n\treadonly routerVersion: RouterFeedbackVersion;\n\treadonly laneType: RouterFeedbackLaneType;\n\treadonly predictedClass: RouterFeedbackTaskClass;\n\treadonly resolvedLevel: RouterFeedbackLevel;\n\treadonly acceptedLevel: RouterFeedbackLevel;\n\treadonly signal: RouterFeedbackSignal;\n\treadonly outcome: RouterFeedbackOutcome;\n\treadonly lenBucket: RouterFeedbackLenBucket;\n\treadonly hadFence: boolean;\n\treadonly hadDiff: boolean;\n}\n\nexport const ROUTER_FEEDBACK_VERSIONS: readonly RouterFeedbackVersion[] = [\"v1\", \"v2\", \"v3\", \"v4\"];\nexport const ROUTER_FEEDBACK_LANE_TYPES: readonly RouterFeedbackLaneType[] = [\n\t\"planner\",\n\t\"security\",\n\t\"explorer\",\n\t\"coder\",\n\t\"reviewer\",\n\t\"tester\",\n\t\"none\",\n];\nexport const ROUTER_FEEDBACK_TASK_CLASSES: readonly RouterFeedbackTaskClass[] = [\n\t\"trivial\",\n\t\"simple-edit\",\n\t\"code-gen\",\n\t\"debug\",\n\t\"refactor\",\n\t\"review\",\n\t\"plan\",\n];\nconst ROUTER_FEEDBACK_LEVELS: readonly RouterFeedbackLevel[] = [\"minimal\", \"low\", \"medium\", \"high\", \"xhigh\", \"max\"];\nconst ROUTER_FEEDBACK_SIGNALS: readonly RouterFeedbackSignal[] = [\n\t\"s1-override\",\n\t\"s2-accept\",\n\t\"s3-hook-outcome\",\n\t\"s4-regression\",\n];\nconst ROUTER_FEEDBACK_OUTCOMES: readonly RouterFeedbackOutcome[] = [\n\t\"up\",\n\t\"down\",\n\t\"same\",\n\t\"accepted\",\n\t\"pass\",\n\t\"fail\",\n\t\"debug-follow-up\",\n];\nexport const ROUTER_FEEDBACK_LEN_BUCKETS: readonly RouterFeedbackLenBucket[] = [0, 1, 2, 3, 4, 5, 6, 7];\n\n/** Exact allowed key set for `RouterFeedbackRecord`, sorted for canonical set-equality comparison. */\nconst ROUTER_FEEDBACK_RECORD_KEYS: readonly string[] = [\n\t\"routerVersion\",\n\t\"laneType\",\n\t\"predictedClass\",\n\t\"resolvedLevel\",\n\t\"acceptedLevel\",\n\t\"signal\",\n\t\"outcome\",\n\t\"lenBucket\",\n\t\"hadFence\",\n\t\"hadDiff\",\n].sort();\n\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\n\treturn typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\nfunction hasExactRouterFeedbackKeySet(value: Record<string, unknown>): boolean {\n\tconst keys = Object.keys(value).sort();\n\tif (keys.length !== ROUTER_FEEDBACK_RECORD_KEYS.length) return false;\n\tfor (let i = 0; i < keys.length; i++) {\n\t\tif (keys[i] !== ROUTER_FEEDBACK_RECORD_KEYS[i]) return false;\n\t}\n\treturn true;\n}\n\n/**\n * Strict runtime validator: exactly the ten allowed keys (no more, no fewer),\n * each within its bounded value set. Returns false for any extra key —\n * including a raw prompt, file path, diff, session id, model id, provider\n * payload, or hook/tool-output-shaped field — because ANY unrecognized key\n * fails the exact key-set check before any per-field check runs.\n */\nexport function isRouterFeedbackRecord(value: unknown): value is RouterFeedbackRecord {\n\tif (!isPlainObject(value)) return false;\n\tif (!hasExactRouterFeedbackKeySet(value)) return false;\n\n\tif (!ROUTER_FEEDBACK_VERSIONS.includes(value.routerVersion as RouterFeedbackVersion)) return false;\n\tif (!ROUTER_FEEDBACK_LANE_TYPES.includes(value.laneType as RouterFeedbackLaneType)) return false;\n\tif (!ROUTER_FEEDBACK_TASK_CLASSES.includes(value.predictedClass as RouterFeedbackTaskClass)) return false;\n\tif (!ROUTER_FEEDBACK_LEVELS.includes(value.resolvedLevel as RouterFeedbackLevel)) return false;\n\tif (!ROUTER_FEEDBACK_LEVELS.includes(value.acceptedLevel as RouterFeedbackLevel)) return false;\n\tif (!ROUTER_FEEDBACK_SIGNALS.includes(value.signal as RouterFeedbackSignal)) return false;\n\tif (!ROUTER_FEEDBACK_OUTCOMES.includes(value.outcome as RouterFeedbackOutcome)) return false;\n\tif (!ROUTER_FEEDBACK_LEN_BUCKETS.includes(value.lenBucket as RouterFeedbackLenBucket)) return false;\n\tif (typeof value.hadFence !== \"boolean\") return false;\n\tif (typeof value.hadDiff !== \"boolean\") return false;\n\n\treturn true;\n}\n\n/** Default ledger path: `<agentDir>/router-feedback/ledger.jsonl` (owner-only, never repo-local). */\nexport function getDefaultRouterFeedbackLedgerPath(): string {\n\treturn join(getAgentDir(), \"router-feedback\", \"ledger.jsonl\");\n}\n\nexport interface AppendRouterFeedbackOptions {\n\t/** Consent gate. Must be exactly `true`; anything else performs zero filesystem access. */\n\treadonly enabled: boolean;\n\t/** Ledger file path override (tests / callers only); defaults to the owner-only agent-dir ledger. */\n\treadonly ledgerPath?: string;\n}\n\nexport type AppendRouterFeedbackReason =\n\t| \"disabled\"\n\t| \"invalid-schema\"\n\t| \"symlink-refused\"\n\t| \"not-regular-file\"\n\t| \"io-error\";\n\nexport type AppendRouterFeedbackResult =\n\t| { readonly appended: true }\n\t| { readonly appended: false; readonly reason: AppendRouterFeedbackReason };\n\n/** True when `path` exists and is a symlink. Uses `lstat` so it never follows the link. */\nfunction isSymlinkPath(path: string): boolean {\n\ttry {\n\t\treturn lstatSync(path).isSymbolicLink();\n\t} catch {\n\t\treturn false;\n\t}\n}\n\nfunction errorCode(error: unknown): string | undefined {\n\treturn typeof error === \"object\" && error !== null && \"code\" in error\n\t\t? String((error as { code?: unknown }).code)\n\t\t: undefined;\n}\n\nfunction acquireLedgerLockSync(path: string): () => void {\n\tconst maxAttempts = 10;\n\tconst delayMs = 20;\n\tlet lastError: unknown;\n\n\tfor (let attempt = 1; attempt <= maxAttempts; attempt++) {\n\t\ttry {\n\t\t\treturn lockfile.lockSync(path, { realpath: false });\n\t\t} catch (error) {\n\t\t\tif (errorCode(error) !== \"ELOCKED\" || attempt === maxAttempts) {\n\t\t\t\tthrow error;\n\t\t\t}\n\t\t\tlastError = error;\n\t\t\tconst start = Date.now();\n\t\t\twhile (Date.now() - start < delayMs) {\n\t\t\t\t// Busy-wait briefly; mirrors the auth-storage/settings-manager sync retry pattern.\n\t\t\t}\n\t\t}\n\t}\n\n\tthrow (lastError as Error) ?? new Error(\"Failed to acquire router-feedback ledger lock\");\n}\n\n/**\n * O_NOFOLLOW is undefined on some platforms (notably Windows); `?? 0` keeps\n * the flag combination valid there, and the `lstat` pre-checks above/below\n * remain the fallback symlink guard on platforms without O_NOFOLLOW.\n */\nconst LEDGER_OPEN_FLAGS =\n\tfsConstants.O_CREAT | fsConstants.O_APPEND | fsConstants.O_WRONLY | (fsConstants.O_NOFOLLOW ?? 0);\n\n/**\n * Append one validated feedback record as a single JSONL line.\n *\n * Requires `options.enabled === true` (checked first, before any filesystem\n * access whatsoever — disabled or omitted consent never touches disk).\n * Validates the record against the exact ten-key schema before any I/O.\n * Refuses symlinks and non-regular files where the platform allows detecting\n * them (`O_NOFOLLOW` plus an `lstat` pre-check as defense-in-depth; `O_NOFOLLOW`\n * is unavailable on some platforms, hence \"when possible\"). Reuses the same\n * `proper-lockfile` dependency as settings-manager.ts/auth-storage.ts for\n * concurrent-session safety. Never throws for expected failure modes — it\n * returns a tagged result so a caller can fail closed silently.\n */\nexport function appendRouterFeedbackRecord(\n\trecord: unknown,\n\toptions: AppendRouterFeedbackOptions,\n): AppendRouterFeedbackResult {\n\tif (options.enabled !== true) {\n\t\treturn { appended: false, reason: \"disabled\" };\n\t}\n\tif (!isRouterFeedbackRecord(record)) {\n\t\treturn { appended: false, reason: \"invalid-schema\" };\n\t}\n\n\tconst ledgerPath = options.ledgerPath ?? getDefaultRouterFeedbackLedgerPath();\n\tconst ledgerDir = dirname(ledgerPath);\n\n\ttry {\n\t\tif (isSymlinkPath(ledgerDir)) {\n\t\t\treturn { appended: false, reason: \"symlink-refused\" };\n\t\t}\n\t\tif (!existsSync(ledgerDir)) {\n\t\t\tmkdirSync(ledgerDir, { recursive: true, mode: 0o700 });\n\t\t}\n\t\tif (isSymlinkPath(ledgerPath)) {\n\t\t\treturn { appended: false, reason: \"symlink-refused\" };\n\t\t}\n\n\t\tlet release: (() => void) | undefined;\n\t\ttry {\n\t\t\trelease = acquireLedgerLockSync(ledgerPath);\n\n\t\t\tif (isSymlinkPath(ledgerPath)) {\n\t\t\t\treturn { appended: false, reason: \"symlink-refused\" };\n\t\t\t}\n\n\t\t\tlet fd: number;\n\t\t\ttry {\n\t\t\t\tfd = openSync(ledgerPath, LEDGER_OPEN_FLAGS, 0o600);\n\t\t\t} catch (error) {\n\t\t\t\tif (errorCode(error) === \"ELOOP\") {\n\t\t\t\t\treturn { appended: false, reason: \"symlink-refused\" };\n\t\t\t\t}\n\t\t\t\tthrow error;\n\t\t\t}\n\n\t\t\ttry {\n\t\t\t\tif (!fstatSync(fd).isFile()) {\n\t\t\t\t\treturn { appended: false, reason: \"not-regular-file\" };\n\t\t\t\t}\n\t\t\t\twriteSync(fd, `${JSON.stringify(record)}\\n`);\n\t\t\t} finally {\n\t\t\t\tcloseSync(fd);\n\t\t\t}\n\t\t\tchmodSync(ledgerPath, 0o600);\n\t\t\treturn { appended: true };\n\t\t} finally {\n\t\t\tif (release) release();\n\t\t}\n\t} catch {\n\t\treturn { appended: false, reason: \"io-error\" };\n\t}\n}\n"]}