@vpxa/kb 0.1.13 → 0.1.16

package/packages/tools/dist/find.d.ts

@@ -1,47 +1,45 @@
-/**
- * kb_find — Federated search across vector similarity, keyword (FTS), and file glob.
- *
- * Combines multiple search strategies in a single call, deduplicates,
- * and returns unified results with source attribution.
- */
-import type { IEmbedder } from '@kb/embeddings';
-import type { IKnowledgeStore } from '@kb/store';
-export interface FindOptions {
-    /** Semantic search query (optional) */
-    query?: string;
-    /** File glob pattern (optional) */
-    glob?: string;
-    /** Keyword/regex pattern for text search (optional) */
-    pattern?: string;
-    /** Max results per strategy (default: 10) */
-    limit?: number;
-    /** Filter by content type */
-    contentType?: string;
-    /** Working directory for glob resolution (default: cwd) */
-    cwd?: string;
+import { IEmbedder } from "@kb/embeddings";
+import { IKnowledgeStore } from "@kb/store";
+import { ContentType } from "@kb/core";
+
+//#region packages/tools/src/find.d.ts
+interface FindOptions {
+  /** Semantic search query (optional) */
+  query?: string;
+  /** File glob pattern (optional) */
+  glob?: string;
+  /** Keyword/regex pattern for text search (optional) */
+  pattern?: string;
+  /** Max results per strategy (default: 10) */
+  limit?: number;
+  /** Filter by content type */
+  contentType?: ContentType;
+  /** Working directory for glob resolution (default: cwd) */
+  cwd?: string;
 }
-export interface FindResult {
-    /** File path (relative to cwd) */
-    path: string;
-    /** How this result was found */
-    source: 'vector' | 'keyword' | 'glob' | 'pattern';
-    /** Relevance score (0-1 for vector/keyword, 1 for glob/pattern matches) */
-    score: number;
-    /** Line range if from KB search */
-    lineRange?: {
-        start: number;
-        end: number;
-    };
-    /** Content preview */
-    preview?: string;
+interface FindResult {
+  /** File path (relative to cwd) */
+  path: string;
+  /** How this result was found */
+  source: 'vector' | 'keyword' | 'glob' | 'pattern';
+  /** Relevance score (0-1 for vector/keyword, 1 for glob/pattern matches) */
+  score: number;
+  /** Line range if from KB search */
+  lineRange?: {
+    start: number;
+    end: number;
+  };
+  /** Content preview */
+  preview?: string;
 }
-export interface FindResults {
-    results: FindResult[];
-    strategies: string[];
-    totalFound: number;
+interface FindResults {
+  results: FindResult[];
+  strategies: string[];
+  totalFound: number;
 }
 /**
  * Run federated search across multiple strategies.
  */
-export declare function find(embedder: IEmbedder, store: IKnowledgeStore, options: FindOptions): Promise<FindResults>;
-//# sourceMappingURL=find.d.ts.map
+declare function find(embedder: IEmbedder, store: IKnowledgeStore, options: FindOptions): Promise<FindResults>;
+//#endregion
+export { FindOptions, FindResult, FindResults, find };

package/packages/tools/dist/find.js

@@ -1 +1 @@
-async function y(f,u,b){const{query:d,glob:h,pattern:l,limit:i=10,contentType:p,cwd:m=process.cwd()}=b,a=[],n=[],o=new Set;if(d){a.push("vector");const s=await f.embed(d),e={limit:i,contentType:p},t=await u.search(s,e);for(const r of t){const c=`${r.record.sourcePath}:${r.record.startLine}`;o.has(c)||(o.add(c),n.push({path:r.record.sourcePath,source:"vector",score:r.score,lineRange:{start:r.record.startLine,end:r.record.endLine},preview:r.record.content.slice(0,200)}))}}if(d){a.push("keyword");try{const s=await u.ftsSearch(d,{limit:i,contentType:p});for(const e of s){const t=`${e.record.sourcePath}:${e.record.startLine}`;o.has(t)||(o.add(t),n.push({path:e.record.sourcePath,source:"keyword",score:e.score,lineRange:{start:e.record.startLine,end:e.record.endLine},preview:e.record.content.slice(0,200)}))}}catch{}}if(h){a.push("glob");try{const{globSync:s}=await import("node:fs"),e=s(h,{cwd:m}),t=new Set(["node_modules",".git","dist","build","coverage",".turbo",".cache","cdk.out",".kb-state",".kb-data"]),r=e.filter(c=>!c.replace(/\\/g,"/").split("/").some(w=>t.has(w)));for(const c of r.slice(0,i)){const g=`glob:${c}`;o.has(g)||(o.add(g),n.push({path:c,source:"glob",score:1}))}}catch{}}if(l){a.push("pattern");try{const s=new RegExp(l,"i"),e=await u.ftsSearch(l,{limit:i*2,contentType:p});for(const t of e)if(s.test(t.record.content)){const r=`${t.record.sourcePath}:${t.record.startLine}`;o.has(r)||(o.add(r),n.push({path:t.record.sourcePath,source:"pattern",score:t.score,lineRange:{start:t.record.startLine,end:t.record.endLine},preview:t.record.content.slice(0,200)}))}}catch{}}return n.sort((s,e)=>e.score-s.score),{results:n.slice(0,i),strategies:a,totalFound:n.length}}export{y as find};
+import{KB_PATHS as e}from"../../core/dist/index.js";async function t(t,n,r){let{query:i,glob:a,pattern:o,limit:s=10,contentType:c,cwd:l=process.cwd()}=r,u=[],d=[],f=new Set;if(i){u.push(`vector`);let e=await t.embed(i),r={limit:s,contentType:c},a=await n.search(e,r);for(let e of a){let t=`${e.record.sourcePath}:${e.record.startLine}`;f.has(t)||(f.add(t),d.push({path:e.record.sourcePath,source:`vector`,score:e.score,lineRange:{start:e.record.startLine,end:e.record.endLine},preview:e.record.content.slice(0,200)}))}}if(i){u.push(`keyword`);try{let e=await n.ftsSearch(i,{limit:s,contentType:c});for(let t of e){let e=`${t.record.sourcePath}:${t.record.startLine}`;f.has(e)||(f.add(e),d.push({path:t.record.sourcePath,source:`keyword`,score:t.score,lineRange:{start:t.record.startLine,end:t.record.endLine},preview:t.record.content.slice(0,200)}))}}catch{}}if(a){u.push(`glob`);try{let{globSync:t}=await import(`node:fs`),n=t(a,{cwd:l,withFileTypes:!1}),r=new Set([`node_modules`,`.git`,`dist`,`build`,`coverage`,`.turbo`,`.cache`,`cdk.out`,e.state,e.data]),i=n.filter(e=>!e.replace(/\\/g,`/`).split(`/`).some(e=>r.has(e)));for(let e of i.slice(0,s)){let t=`glob:${e}`;f.has(t)||(f.add(t),d.push({path:e,source:`glob`,score:1}))}}catch{}}if(o){u.push(`pattern`);try{let e=new RegExp(o,`i`),t=await n.ftsSearch(o,{limit:s*2,contentType:c});for(let n of t)if(e.test(n.record.content)){let e=`${n.record.sourcePath}:${n.record.startLine}`;f.has(e)||(f.add(e),d.push({path:n.record.sourcePath,source:`pattern`,score:n.score,lineRange:{start:n.record.startLine,end:n.record.endLine},preview:n.record.content.slice(0,200)}))}}catch{}}return d.sort((e,t)=>t.score-e.score),{results:d.slice(0,s),strategies:u,totalFound:d.length}}export{t as find};

package/packages/tools/dist/forge-classify.d.ts

@@ -1,44 +1,40 @@
-/**
- * kb_forge_classify — Automated FORGE tier classification.
- *
- * Determines Floor/Standard/Critical tier from file analysis.
- * Uses path patterns, export scanning, and structural heuristics.
- * No LLM needed.
- */
-import type { ForgeTier } from './evidence-map.js';
-export interface ForgeClassifyOptions {
-    /** Files being modified (absolute or relative paths) */
-    files: string[];
-    /** Task description for keyword detection */
-    task: string;
-    /** Root path for package boundary detection */
-    rootPath: string;
+import { ForgeTier } from "./evidence-map.js";
+
+//#region packages/tools/src/forge-classify.d.ts
+interface ForgeClassifyOptions {
+  /** Files being modified (absolute or relative paths) */
+  files: string[];
+  /** Task description for keyword detection */
+  task: string;
+  /** Root path for package boundary detection */
+  rootPath: string;
 }
-export interface ClassifyTrigger {
-    rule: string;
-    detail: string;
-    source: 'blast_radius' | 'cross_package' | 'schema_contract' | 'security_auth' | 'task_hint' | 'default';
+interface ClassifyTrigger {
+  rule: string;
+  detail: string;
+  source: 'blast_radius' | 'cross_package' | 'schema_contract' | 'security_auth' | 'task_hint' | 'default';
 }
-export interface TypedUnknownSeed {
-    description: string;
-    type: 'contract' | 'convention' | 'freshness' | 'runtime' | 'data-flow' | 'impact';
-    suggestedTool: string;
+interface TypedUnknownSeed {
+  description: string;
+  type: 'contract' | 'convention' | 'freshness' | 'runtime' | 'data-flow' | 'impact';
+  suggestedTool: string;
 }
-export interface ForgeClassifyCeremony {
-    ground: string;
-    build: string;
-    break: string;
-    evidenceMap: string;
-    gate: string;
+interface ForgeClassifyCeremony {
+  ground: string;
+  build: string;
+  break: string;
+  evidenceMap: string;
+  gate: string;
 }
-export interface ForgeClassifyResult {
-    tier: ForgeTier;
-    triggers: ClassifyTrigger[];
-    packagesCrossed: string[];
-    hasSchemaChange: boolean;
-    hasSecurityPath: boolean;
-    typedUnknownSeeds: TypedUnknownSeed[];
-    ceremony: ForgeClassifyCeremony;
+interface ForgeClassifyResult {
+  tier: ForgeTier;
+  triggers: ClassifyTrigger[];
+  packagesCrossed: string[];
+  hasSchemaChange: boolean;
+  hasSecurityPath: boolean;
+  typedUnknownSeeds: TypedUnknownSeed[];
+  ceremony: ForgeClassifyCeremony;
 }
-export declare function forgeClassify(options: ForgeClassifyOptions): Promise<ForgeClassifyResult>;
-//# sourceMappingURL=forge-classify.d.ts.map
+declare function forgeClassify(options: ForgeClassifyOptions): Promise<ForgeClassifyResult>;
+//#endregion
+export { ClassifyTrigger, ForgeClassifyCeremony, ForgeClassifyOptions, ForgeClassifyResult, TypedUnknownSeed, forgeClassify };

package/packages/tools/dist/forge-classify.js

@@ -1,2 +1,2 @@
-import{existsSync as g,readdirSync as _,readFileSync as S,statSync as k}from"node:fs";import{dirname as m,extname as C,relative as p,resolve as a}from"node:path";import{fileSummary as w}from"./file-summary.js";const E=1e5,x=200,v=new Set([".ts",".tsx",".js",".jsx",".mts",".cts",".mjs",".cjs"]),A=new Set([".git",".kb-data",".kb-state",".turbo",".yarn","build","coverage","dist","node_modules"]),N=/auth|token|permission|acl|encrypt|secret|credential|jwt|oauth|password/i,R=/\b(hash|sign|verify|bcrypt|jwt|decrypt|secret|password)\b/i,P=/auth|security|permission|encrypt|secret|credential/i,F=/types\.ts$|schema\.ts$|contract\.ts$|\.proto$|openapi|swagger|\.graphql$/i,U=/(?:^|\/)(events|contracts|shared)(?:\/|$)/i,$=/export\s+interface\b|export\s+type\b|export\s+const\s+\w*Schema\w*\s*=\s*z\./i,j=/schema|contract|migration|breaking.change|api.change/i,I=/migration|data.?model|multi.?service|breaking|backward.?compat/i,D={floor:{ground:"Parasitic \u2014 read target file only",build:"Implement directly",break:"Skip",evidenceMap:"Not required",gate:"Self-certify"},standard:{ground:"Scope map + blast radius + constraint seed",build:"TDD \u2014 test first, then implement",break:"Error paths + edge cases",evidenceMap:"3-8 critical-path entries",gate:"YIELD/HOLD evaluation"},critical:{ground:"Full scope map + blast radius + trace + patterns + constraint pack",build:"TDD + contract verification + cross-service validation",break:"Error paths + edge cases + security dimensions + data-flow verification",evidenceMap:"Comprehensive \u2014 all critical-path claims with receipts",gate:"Strict YIELD/HOLD/HARD_BLOCK evaluation"}};async function W(t){const s=a(t.rootPath),r=t.task.trim(),e=t.files.map(c=>a(s,c)),n=[];let i=!1,o=!1;for(const c of e){const f=O(c,s),T=b(c);(N.test(f)||R.test(T)||P.test(r))&&(i=!0),(F.test(f)||U.test(f)||j.test(r)||$.test(T)||await M(c))&&(o=!0)}i&&l(n,{rule:"security-path",detail:"Security/auth path, task, or content matched security heuristics",source:"security_auth"}),o&&l(n,{rule:"schema-contract",detail:"Schema or contract path, task, or export shape matched contract heuristics",source:"schema_contract"});const d=H(e,s);d.affectedFiles>5&&l(n,{rule:"blast-radius-importers",detail:`${d.affectedFiles} affected files via direct import scanning`,source:"blast_radius"});const u=[...new Set(e.map(c=>B(c,s)).filter(c=>!!c))].sort();u.length>=2&&l(n,{rule:"cross-package-boundary",detail:`Files span ${u.length} packages: ${u.join(", ")}`,source:"cross_package"}),I.test(r)&&l(n,{rule:"task-hint-critical",detail:"Task description matched migration or compatibility criticality hints",source:"task_hint"});const y=n.length>0?"critical":e.length===1?"floor":"standard";return{tier:y,triggers:n,packagesCrossed:u,hasSchemaChange:o,hasSecurityPath:i,typedUnknownSeeds:q(n),ceremony:D[y]}}function l(t,s){t.some(r=>r.rule===s.rule&&r.source===s.source)||t.push(s)}function O(t,s){const r=a(s,t),e=p(s,r);return(e&&!e.startsWith("..")?e:r).replace(/\\/g,"/")}function h(t){if(!g(t))return!1;try{return k(t).size<=E}catch{return!1}}function b(t){if(!h(t))return"";try{return S(t,"utf-8").split(/\r?\n/).slice(0,x).join(`
-`)}catch{return""}}async function M(t){if(!h(t))return!1;try{const s=await w({path:t}),r=new Set(s.exports);return s.interfaces.some(e=>r.has(e.name))||s.types.some(e=>r.has(e.name))}catch{return!1}}function H(t,s){const r=new Set(t.filter(n=>g(n)));if(r.size===0)return{affectedFiles:t.length,importers:[]};const e=new Set;for(const n of L(s)){if(r.has(n)||!h(n))continue;const i=b(n);if(!i)continue;z(i).some(d=>Y(d,n,r))&&e.add(n)}return{affectedFiles:t.length+e.size,importers:[...e].map(n=>p(s,n).replace(/\\/g,"/"))}}function L(t){const s=[];function r(e){let n=[];try{n=_(e)}catch{return}for(const i of n){if(A.has(i))continue;const o=a(e,i);let d;try{d=k(o)}catch{continue}if(d.isDirectory()){r(o);continue}v.has(C(i).toLowerCase())&&s.push(o)}}return r(t),s}function z(t){const s=new Set,r=/(?:from\s+['"]([^'"]+)['"]|import\s+['"]([^'"]+)['"]|require\(\s*['"]([^'"]+)['"]\s*\))/g;for(const e of t.matchAll(r)){const n=e[1]??e[2]??e[3];n&&s.add(n)}return[...s]}function Y(t,s,r){if(!t.startsWith("."))return!1;const e=a(m(s),t);return[e,`${e}.ts`,`${e}.tsx`,`${e}.js`,`${e}.jsx`,`${e}.mts`,`${e}.cts`,`${e}.mjs`,`${e}.cjs`,a(e,"index.ts"),a(e,"index.tsx"),a(e,"index.js"),a(e,"index.jsx")].some(i=>r.has(i))}function q(t){return t.map(s=>{switch(s.source){case"security_auth":return{description:"Verify auth and security assumptions before yielding",type:"contract",suggestedTool:"kb_search"};case"schema_contract":return{description:"Confirm schema and contract compatibility",type:"contract",suggestedTool:"kb_schema_validate"};case"blast_radius":return{description:"Inspect affected importers before delivery",type:"impact",suggestedTool:"kb_blast_radius"};case"cross_package":return{description:"Assess downstream package impact across boundaries",type:"impact",suggestedTool:"kb_blast_radius"};case"task_hint":return{description:"Check established conventions for migrations or compatibility work",type:"convention",suggestedTool:"kb_find"};default:return{description:"No explicit unknown routing required",type:"freshness",suggestedTool:"kb_lookup"}}})}function B(t,s){let r=m(a(s,t));const e=a(s);for(;r.length>=e.length;){const n=a(r,"package.json");if(g(n))try{return JSON.parse(S(n,"utf-8")).name??p(e,r).replace(/\\/g,"/")}catch{return p(e,r).replace(/\\/g,"/")}const i=m(r);if(i===r)break;r=i}}export{W as forgeClassify};
+import{fileSummary as e}from"./file-summary.js";import{dirname as t,extname as n,relative as r,resolve as i}from"node:path";import{existsSync as a,readFileSync as o,readdirSync as s,statSync as c}from"node:fs";import{KB_PATHS as l}from"../../core/dist/index.js";const u=new Set([`.ts`,`.tsx`,`.js`,`.jsx`,`.mts`,`.cts`,`.mjs`,`.cjs`]),d=new Set([`.git`,l.data,l.state,`.turbo`,`.yarn`,`build`,`coverage`,`dist`,`node_modules`]),f=/auth|token|permission|acl|encrypt|secret|credential|jwt|oauth|password/i,p=/\b(hash|sign|verify|bcrypt|jwt|decrypt|secret|password)\b/i,m=/auth|security|permission|encrypt|secret|credential/i,h=/types\.ts$|schema\.ts$|contract\.ts$|\.proto$|openapi|swagger|\.graphql$/i,g=/(?:^|\/)(events|contracts|shared)(?:\/|$)/i,_=/export\s+interface\b|export\s+type\b|export\s+const\s+\w*Schema\w*\s*=\s*z\./i,v=/schema|contract|migration|breaking.change|api.change/i,y=/migration|data.?model|multi.?service|breaking|backward.?compat/i,b={floor:{ground:`Parasitic — read target file only`,build:`Implement directly`,break:`Skip`,evidenceMap:`Not required`,gate:`Self-certify`},standard:{ground:`Scope map + blast radius + constraint seed`,build:`TDD — test first, then implement`,break:`Error paths + edge cases`,evidenceMap:`3-8 critical-path entries`,gate:`YIELD/HOLD evaluation`},critical:{ground:`Full scope map + blast radius + trace + patterns + constraint pack`,build:`TDD + contract verification + cross-service validation`,break:`Error paths + edge cases + security dimensions + data-flow verification`,evidenceMap:`Comprehensive — all critical-path claims with receipts`,gate:`Strict YIELD/HOLD/HARD_BLOCK evaluation`}};async function x(e){let t=i(e.rootPath),n=e.task.trim(),r=e.files.map(e=>i(t,e)),a=[],o=!1,s=!1;for(let e of r){let r=C(e,t),i=T(e);(f.test(r)||p.test(i)||m.test(n))&&(o=!0),(h.test(r)||g.test(r)||v.test(n)||_.test(i)||await E(e))&&(s=!0)}o&&S(a,{rule:`security-path`,detail:`Security/auth path, task, or content matched security heuristics`,source:`security_auth`}),s&&S(a,{rule:`schema-contract`,detail:`Schema or contract path, task, or export shape matched contract heuristics`,source:`schema_contract`});let c=D(r,t);c.affectedFiles>5&&S(a,{rule:`blast-radius-importers`,detail:`${c.affectedFiles} affected files via direct import scanning`,source:`blast_radius`});let l=[...new Set(r.map(e=>M(e,t)).filter(e=>!!e))].sort();l.length>=2&&S(a,{rule:`cross-package-boundary`,detail:`Files span ${l.length} packages: ${l.join(`, `)}`,source:`cross_package`}),y.test(n)&&S(a,{rule:`task-hint-critical`,detail:`Task description matched migration or compatibility criticality hints`,source:`task_hint`});let u=a.length>0?`critical`:r.length===1?`floor`:`standard`;return{tier:u,triggers:a,packagesCrossed:l,hasSchemaChange:s,hasSecurityPath:o,typedUnknownSeeds:j(a),ceremony:b[u]}}function S(e,t){e.some(e=>e.rule===t.rule&&e.source===t.source)||e.push(t)}function C(e,t){let n=i(t,e),a=r(t,n);return(a&&!a.startsWith(`..`)?a:n).replace(/\\/g,`/`)}function w(e){if(!a(e))return!1;try{return c(e).size<=1e5}catch{return!1}}function T(e){if(!w(e))return``;try{return o(e,`utf-8`).split(/\r?\n/).slice(0,200).join(`
+`)}catch{return``}}async function E(t){if(!w(t))return!1;try{let n=await e({path:t}),r=new Set(n.exports);return n.interfaces.some(e=>r.has(e.name))||n.types.some(e=>r.has(e.name))}catch{return!1}}function D(e,t){let n=new Set(e.filter(e=>a(e)));if(n.size===0)return{affectedFiles:e.length,importers:[]};let i=new Set;for(let e of O(t)){if(n.has(e)||!w(e))continue;let t=T(e);t&&k(t).some(t=>A(t,e,n))&&i.add(e)}return{affectedFiles:e.length+i.size,importers:[...i].map(e=>r(t,e).replace(/\\/g,`/`))}}function O(e){let t=[];function r(e){let a=[];try{a=s(e)}catch{return}for(let o of a){if(d.has(o))continue;let a=i(e,o),s;try{s=c(a)}catch{continue}if(s.isDirectory()){r(a);continue}u.has(n(o).toLowerCase())&&t.push(a)}}return r(e),t}function k(e){let t=new Set;for(let n of e.matchAll(/(?:from\s+['"]([^'"]+)['"]|import\s+['"]([^'"]+)['"]|require\(\s*['"]([^'"]+)['"]\s*\))/g)){let e=n[1]??n[2]??n[3];e&&t.add(e)}return[...t]}function A(e,n,r){if(!e.startsWith(`.`))return!1;let a=i(t(n),e);return[a,`${a}.ts`,`${a}.tsx`,`${a}.js`,`${a}.jsx`,`${a}.mts`,`${a}.cts`,`${a}.mjs`,`${a}.cjs`,i(a,`index.ts`),i(a,`index.tsx`),i(a,`index.js`),i(a,`index.jsx`)].some(e=>r.has(e))}function j(e){return e.map(e=>{switch(e.source){case`security_auth`:return{description:`Verify auth and security assumptions before yielding`,type:`contract`,suggestedTool:`kb_search`};case`schema_contract`:return{description:`Confirm schema and contract compatibility`,type:`contract`,suggestedTool:`kb_schema_validate`};case`blast_radius`:return{description:`Inspect affected importers before delivery`,type:`impact`,suggestedTool:`kb_blast_radius`};case`cross_package`:return{description:`Assess downstream package impact across boundaries`,type:`impact`,suggestedTool:`kb_blast_radius`};case`task_hint`:return{description:`Check established conventions for migrations or compatibility work`,type:`convention`,suggestedTool:`kb_find`};default:return{description:`No explicit unknown routing required`,type:`freshness`,suggestedTool:`kb_lookup`}}})}function M(e,n){let s=t(i(n,e)),c=i(n);for(;s.length>=c.length;){let e=i(s,`package.json`);if(a(e))try{return JSON.parse(o(e,`utf-8`)).name??r(c,s).replace(/\\/g,`/`)}catch{return r(c,s).replace(/\\/g,`/`)}let n=t(s);if(n===s)break;s=n}}export{x as forgeClassify};

package/packages/tools/dist/forge-ground.d.ts

@@ -1,64 +1,61 @@
-/**
- * kb_forge_ground — FORGE Phase 1 (Ground) batch executor.
- *
- * Executes the complete Ground phase as a single tool call:
- * tier classification → scope map → typed unknowns → constraint seed → file summaries.
- */
-import type { IEmbedder } from '@kb/embeddings';
-import type { IKnowledgeStore } from '@kb/store';
-import { type ForgeTier } from './evidence-map.js';
-import { type ClassifyTrigger, type TypedUnknownSeed } from './forge-classify.js';
-import { type ScopeMapResult } from './scope-map.js';
-export interface ForgeGroundOptions {
-    /** Task description */
-    task: string;
-    /** Target files being modified (absolute paths) */
-    files: string[];
-    /** Root path of the codebase */
-    rootPath: string;
-    /** Max constraint entries to load (default: 3) */
-    maxConstraints?: number;
-    /** Force a specific tier (skip auto-classify) */
-    forceTier?: ForgeTier;
-    /** Task ID for evidence map creation (default: auto-generated from task) */
-    taskId?: string;
+import { ForgeTier } from "./evidence-map.js";
+import { ClassifyTrigger, TypedUnknownSeed } from "./forge-classify.js";
+import { ScopeMapResult } from "./scope-map.js";
+import { IEmbedder } from "@kb/embeddings";
+import { IKnowledgeStore } from "@kb/store";
+
+//#region packages/tools/src/forge-ground.d.ts
+interface ForgeGroundOptions {
+  /** Task description */
+  task: string;
+  /** Target files being modified (absolute paths) */
+  files: string[];
+  /** Root path of the codebase */
+  rootPath: string;
+  /** Max constraint entries to load (default: 3) */
+  maxConstraints?: number;
+  /** Force a specific tier (skip auto-classify) */
+  forceTier?: ForgeTier;
+  /** Task ID for evidence map creation (default: auto-generated from task) */
+  taskId?: string;
 }
-export interface ConstraintRef {
-    source: string;
-    snippet: string;
-    relevance: number;
+interface ConstraintRef {
+  source: string;
+  snippet: string;
+  relevance: number;
 }
-export interface ForgeGroundResult {
-    /** Computed or forced tier */
-    tier: ForgeTier;
-    /** Classification triggers (empty if tier was forced) */
-    classifyTriggers: ClassifyTrigger[];
-    /** Scope map (relevant files with focus ranges) — null for Floor tier */
-    scopeMap: ScopeMapResult | null;
-    /** Typed Unknown Queue seeds */
-    typedUnknownSeeds: TypedUnknownSeed[];
-    /** Constraint seed — relevant KB entries from decisions/patterns */
-    constraints: ConstraintRef[];
-    /** File summaries for target files */
-    fileSummaries: Array<{
-        path: string;
-        exports: string[];
-        functions: string[];
-        lines: number;
-        error?: string;
-    }>;
-    /** Evidence map task ID (created if Standard or Critical) */
-    evidenceMapTaskId: string | null;
-    /** Total estimated tokens for this Ground output */
-    estimatedTokens: number;
-    /** Ceremony recommendations for this tier */
-    ceremony: {
-        ground: string;
-        build: string;
-        break: string;
-        evidenceMap: string;
-        gate: string;
-    };
+interface ForgeGroundResult {
+  /** Computed or forced tier */
+  tier: ForgeTier;
+  /** Classification triggers (empty if tier was forced) */
+  classifyTriggers: ClassifyTrigger[];
+  /** Scope map (relevant files with focus ranges) — null for Floor tier */
+  scopeMap: ScopeMapResult | null;
+  /** Typed Unknown Queue seeds */
+  typedUnknownSeeds: TypedUnknownSeed[];
+  /** Constraint seed — relevant KB entries from decisions/patterns */
+  constraints: ConstraintRef[];
+  /** File summaries for target files */
+  fileSummaries: Array<{
+    path: string;
+    exports: string[];
+    functions: string[];
+    lines: number;
+    error?: string;
+  }>;
+  /** Evidence map task ID (created if Standard or Critical) */
+  evidenceMapTaskId: string | null;
+  /** Total estimated tokens for this Ground output */
+  estimatedTokens: number;
+  /** Ceremony recommendations for this tier */
+  ceremony: {
+    ground: string;
+    build: string;
+    break: string;
+    evidenceMap: string;
+    gate: string;
+  };
 }
-export declare function forgeGround(embedder: IEmbedder, store: IKnowledgeStore, options: ForgeGroundOptions): Promise<ForgeGroundResult>;
-//# sourceMappingURL=forge-ground.d.ts.map
+declare function forgeGround(embedder: IEmbedder, store: IKnowledgeStore, options: ForgeGroundOptions): Promise<ForgeGroundResult>;
+//#endregion
+export { ConstraintRef, ForgeGroundOptions, ForgeGroundResult, forgeGround };

package/packages/tools/dist/forge-ground.js

@@ -1 +1 @@
-import{evidenceMap as g}from"./evidence-map.js";import{fileSummary as m}from"./file-summary.js";import{forgeClassify as p}from"./forge-classify.js";import{scopeMap as f}from"./scope-map.js";import{estimateTokens as y}from"./text-utils.js";const S=3,c=200,T={floor:{ground:"Parasitic \u2014 read target file only",build:"Implement directly",break:"Skip",evidenceMap:"Not required",gate:"Self-certify"},standard:{ground:"Scope map + blast radius + constraint seed",build:"TDD \u2014 test first, then implement",break:"Error paths + edge cases",evidenceMap:"3-8 critical-path entries",gate:"YIELD/HOLD evaluation"},critical:{ground:"Full scope map + blast radius + trace + patterns + constraint pack",build:"TDD + contract verification + cross-service validation",break:"Error paths + edge cases + security dimensions + data-flow verification",evidenceMap:"Comprehensive \u2014 all critical-path claims with receipts",gate:"Strict YIELD/HOLD/HARD_BLOCK evaluation"}};async function D(e,r,t){const i=t.maxConstraints??S,n=await k(t),s=await F(t.files);if(n.tier==="floor")return u({tier:n.tier,classifyTriggers:n.classifyTriggers,scopeMap:null,typedUnknownSeeds:n.typedUnknownSeeds,constraints:[],fileSummaries:s,evidenceMapTaskId:null,ceremony:n.ceremony});const[a,o,d]=await Promise.all([R(e,r,t.task,n.tier),w(e,r,t.task,i),h(t.rootPath,t.taskId??C(t.task),n.tier)]);return u({tier:n.tier,classifyTriggers:n.classifyTriggers,scopeMap:a,typedUnknownSeeds:n.typedUnknownSeeds,constraints:o,fileSummaries:s,evidenceMapTaskId:d,ceremony:n.ceremony})}async function k(e){if(e.forceTier)return{tier:e.forceTier,classifyTriggers:[],typedUnknownSeeds:[],ceremony:l(e.forceTier)};try{const r=await p({files:e.files,task:e.task,rootPath:e.rootPath});return{tier:r.tier,classifyTriggers:r.triggers,typedUnknownSeeds:r.typedUnknownSeeds,ceremony:r.ceremony}}catch{return{tier:"standard",classifyTriggers:[],typedUnknownSeeds:[],ceremony:l("standard")}}}async function R(e,r,t,i){try{return await f(e,r,{task:t,maxFiles:i==="critical"?20:10})}catch{return null}}async function w(e,r,t,i){try{const n=`decision pattern convention ${t}`,s=typeof e.embedQuery=="function"?await e.embedQuery(n):await e.embed(n);return(await r.search(s,{limit:i,origin:"curated"})).slice(0,i).map(o=>v(o))}catch{return[]}}async function F(e){return Promise.all(e.map(async r=>b(r)))}async function b(e){try{const r=await m({path:e});return M(r)}catch(r){return{path:e,exports:[],functions:[],lines:0,error:r instanceof Error?r.message:"Unable to summarize file"}}}async function h(e,r,t){try{return g({action:"create",taskId:r,tier:t},e),r}catch{return null}}function v(e){return{source:e.record.sourcePath,snippet:I(e.record.content),relevance:e.score}}function I(e){const r=e.replace(/\s+/g," ").trim();return r.length<=c?r:`${r.slice(0,c-3).trimEnd()}...`}function M(e){return{path:e.path,exports:e.exports,functions:e.functions.map(r=>r.name),lines:e.lines}}function l(e){return{...T[e]}}function u(e){return{...e,estimatedTokens:y(JSON.stringify(e))}}function C(e){const r=e.toLowerCase().replace(/[^a-z0-9\s]/g," ").split(/\s+/).filter(Boolean).slice(0,5).join("-"),t=Date.now().toString(36);return`${r||"task"}-${t}`}export{D as forgeGround};
+import{estimateTokens as e}from"./text-utils.js";import{evidenceMap as t}from"./evidence-map.js";import{fileSummary as n}from"./file-summary.js";import{forgeClassify as r}from"./forge-classify.js";import{scopeMap as i}from"./scope-map.js";const a={floor:{ground:`Parasitic — read target file only`,build:`Implement directly`,break:`Skip`,evidenceMap:`Not required`,gate:`Self-certify`},standard:{ground:`Scope map + blast radius + constraint seed`,build:`TDD — test first, then implement`,break:`Error paths + edge cases`,evidenceMap:`3-8 critical-path entries`,gate:`YIELD/HOLD evaluation`},critical:{ground:`Full scope map + blast radius + trace + patterns + constraint pack`,build:`TDD + contract verification + cross-service validation`,break:`Error paths + edge cases + security dimensions + data-flow verification`,evidenceMap:`Comprehensive — all critical-path claims with receipts`,gate:`Strict YIELD/HOLD/HARD_BLOCK evaluation`}};async function o(e,t,n){let r=n.maxConstraints??3,i=await s(n),a=await u(n.files);if(i.tier===`floor`)return _({tier:i.tier,classifyTriggers:i.classifyTriggers,scopeMap:null,typedUnknownSeeds:i.typedUnknownSeeds,constraints:[],fileSummaries:a,evidenceMapTaskId:null,ceremony:i.ceremony});let[o,d,p]=await Promise.all([c(e,t,n.task,i.tier),l(e,t,n.task,r),f(n.rootPath,n.taskId??v(n.task),i.tier)]);return _({tier:i.tier,classifyTriggers:i.classifyTriggers,scopeMap:o,typedUnknownSeeds:i.typedUnknownSeeds,constraints:d,fileSummaries:a,evidenceMapTaskId:p,ceremony:i.ceremony})}async function s(e){if(e.forceTier)return{tier:e.forceTier,classifyTriggers:[],typedUnknownSeeds:[],ceremony:g(e.forceTier)};try{let t=await r({files:e.files,task:e.task,rootPath:e.rootPath});return{tier:t.tier,classifyTriggers:t.triggers,typedUnknownSeeds:t.typedUnknownSeeds,ceremony:t.ceremony}}catch{return{tier:`standard`,classifyTriggers:[],typedUnknownSeeds:[],ceremony:g(`standard`)}}}async function c(e,t,n,r){try{return await i(e,t,{task:n,maxFiles:r===`critical`?20:10})}catch{return null}}async function l(e,t,n,r){try{let i=`decision pattern convention ${n}`,a=typeof e.embedQuery==`function`?await e.embedQuery(i):await e.embed(i);return(await t.search(a,{limit:r,origin:`curated`})).slice(0,r).map(e=>p(e))}catch{return[]}}async function u(e){return Promise.all(e.map(async e=>d(e)))}async function d(e){try{return h(await n({path:e}))}catch(t){return{path:e,exports:[],functions:[],lines:0,error:t instanceof Error?t.message:`Unable to summarize file`}}}async function f(e,n,r){try{return t({action:`create`,taskId:n,tier:r},e),n}catch{return null}}function p(e){return{source:e.record.sourcePath,snippet:m(e.record.content),relevance:e.score}}function m(e){let t=e.replace(/\s+/g,` `).trim();return t.length<=200?t:`${t.slice(0,197).trimEnd()}...`}function h(e){return{path:e.path,exports:e.exports,functions:e.functions.map(e=>e.name),lines:e.lines}}function g(e){return{...a[e]}}function _(t){return{...t,estimatedTokens:e(JSON.stringify(t))}}function v(e){let t=e.toLowerCase().replace(/[^a-z0-9\s]/g,` `).split(/\s+/).filter(Boolean).slice(0,5).join(`-`),n=Date.now().toString(36);return`${t||`task`}-${n}`}export{o as forgeGround};

package/packages/tools/dist/git-context.d.ts

@@ -1,22 +1,24 @@
-export interface GitContextOptions {
-    cwd?: string;
-    commitCount?: number;
-    includeDiff?: boolean;
+//#region packages/tools/src/git-context.d.ts
+interface GitContextOptions {
+  cwd?: string;
+  commitCount?: number;
+  includeDiff?: boolean;
 }
-export interface GitContextResult {
-    branch: string;
-    status: {
-        staged: string[];
-        modified: string[];
-        untracked: string[];
-    };
-    recentCommits: Array<{
-        hash: string;
-        message: string;
-        author: string;
-        date: string;
-    }>;
-    diff?: string;
+interface GitContextResult {
+  branch: string;
+  status: {
+    staged: string[];
+    modified: string[];
+    untracked: string[];
+  };
+  recentCommits: Array<{
+    hash: string;
+    message: string;
+    author: string;
+    date: string;
+  }>;
+  diff?: string;
 }
-export declare function gitContext(options?: GitContextOptions): Promise<GitContextResult>;
-//# sourceMappingURL=git-context.d.ts.map
+declare function gitContext(options?: GitContextOptions): Promise<GitContextResult>;
+//#endregion
+export { GitContextOptions, GitContextResult, gitContext };

package/packages/tools/dist/git-context.js

@@ -1,3 +1,3 @@
-import{execFile as x}from"node:child_process";import{promisify as w}from"node:util";const C=w(x);async function o(n,t){try{const{stdout:a}=await C("git",n,{cwd:t});return a.toString().trim()}catch{return""}}async function R(n={}){const t=n.cwd??process.cwd(),a=n.commitCount??5,[u,g,l,d]=await Promise.all([o(["rev-parse","--abbrev-ref","HEAD"],t),o(["status","--porcelain"],t),o(["log",`--max-count=${a}`,"--format=%h|%s|%an|%ai"],t),n.includeDiff?o(["diff","--stat","--no-color"],t):Promise.resolve("")]),c=[],f=[],m=[];for(const i of g.split(`
-`).filter(Boolean)){const s=i[0],e=i[1],r=i.slice(3).trim();s!==" "&&s!=="?"&&c.push(r),(e==="M"||e==="D")&&f.push(r),s==="?"&&m.push(r)}const p=l.split(`
-`).filter(Boolean).map(i=>{const[s,e,r,h]=i.split("|");return{hash:s,message:e,author:r,date:h}});return{branch:u||"unknown",status:{staged:c,modified:f,untracked:m},recentCommits:p,diff:d||void 0}}export{R as gitContext};
+import{execFile as e}from"node:child_process";import{promisify as t}from"node:util";const n=t(e);async function r(e,t){try{let{stdout:r}=await n(`git`,e,{cwd:t,timeout:15e3});return r.toString().trim()}catch{return``}}async function i(e={}){let t=e.cwd??process.cwd(),n=e.commitCount??5,[i,a,o,s]=await Promise.all([r([`rev-parse`,`--abbrev-ref`,`HEAD`],t),r([`status`,`--porcelain`],t),r([`log`,`--max-count=${n}`,`--format=%h|%s|%an|%ai`],t),e.includeDiff?r([`diff`,`--stat`,`--no-color`],t):Promise.resolve(``)]),c=[],l=[],u=[];for(let e of a.split(`
+`).filter(Boolean)){let t=e[0],n=e[1],r=e.slice(3).trim();t!==` `&&t!==`?`&&c.push(r),(n===`M`||n===`D`)&&l.push(r),t===`?`&&u.push(r)}let d=o.split(`
+`).filter(Boolean).map(e=>{let[t,n,r,i]=e.split(`|`);return{hash:t,message:n,author:r,date:i}});return{branch:i||`unknown`,status:{staged:c,modified:l,untracked:u},recentCommits:d,diff:s||void 0}}export{i as gitContext};

package/packages/tools/dist/graph-query.d.ts

@@ -1,89 +1,85 @@
-/**
- * kb_graph — Knowledge graph query tools.
- *
- * Query, traverse, and manage the entity-relationship knowledge graph.
- * The graph complements vector search with structural reasoning:
- * vector search finds similar content, graph traversal finds connected concepts.
- */
-import type { GraphEdge, GraphNode, GraphStats, GraphTraversalResult, IGraphStore } from '@kb/store';
-export interface GraphQueryOptions {
-    /** Action: query nodes, traverse from a node, get stats, or add data */
-    action: 'find_nodes' | 'find_edges' | 'neighbors' | 'traverse' | 'stats' | 'add' | 'delete' | 'clear';
-    /** Node type filter (for find_nodes) */
-    nodeType?: string;
-    /** Name pattern (LIKE %pattern%) for find_nodes */
-    namePattern?: string;
-    /** Source path filter */
+import { GraphEdge, GraphNode, GraphStats, GraphTraversalResult, IGraphStore } from "@kb/store";
+
+//#region packages/tools/src/graph-query.d.ts
+interface GraphQueryOptions {
+  /** Action: query nodes, traverse from a node, get stats, or add data */
+  action: 'find_nodes' | 'find_edges' | 'neighbors' | 'traverse' | 'stats' | 'add' | 'delete' | 'clear';
+  /** Node type filter (for find_nodes) */
+  nodeType?: string;
+  /** Name pattern (LIKE %pattern%) for find_nodes */
+  namePattern?: string;
+  /** Source path filter */
+  sourcePath?: string;
+  /** Node ID for neighbors/traverse/delete */
+  nodeId?: string;
+  /** Edge type filter */
+  edgeType?: string;
+  /** From node ID (for find_edges) */
+  fromId?: string;
+  /** To node ID (for find_edges) */
+  toId?: string;
+  /** Traversal direction */
+  direction?: 'outgoing' | 'incoming' | 'both';
+  /** Max traversal depth (default: 2) */
+  maxDepth?: number;
+  /** Max results (default: 50) */
+  limit?: number;
+  /** Nodes to add (for action=add) */
+  nodes?: Array<{
+    id?: string;
+    type: string;
+    name: string;
+    properties?: Record<string, unknown>;
+    sourceRecordId?: string;
     sourcePath?: string;
-    /** Node ID for neighbors/traverse/delete */
-    nodeId?: string;
-    /** Edge type filter */
-    edgeType?: string;
-    /** From node ID (for find_edges) */
-    fromId?: string;
-    /** To node ID (for find_edges) */
-    toId?: string;
-    /** Traversal direction */
-    direction?: 'outgoing' | 'incoming' | 'both';
-    /** Max traversal depth (default: 2) */
-    maxDepth?: number;
-    /** Max results (default: 50) */
-    limit?: number;
-    /** Nodes to add (for action=add) */
-    nodes?: Array<{
-        id?: string;
-        type: string;
-        name: string;
-        properties?: Record<string, unknown>;
-        sourceRecordId?: string;
-        sourcePath?: string;
-    }>;
-    /** Edges to add (for action=add) */
-    edges?: Array<{
-        id?: string;
-        fromId: string;
-        toId: string;
-        type: string;
-        weight?: number;
-        properties?: Record<string, unknown>;
-    }>;
+  }>;
+  /** Edges to add (for action=add) */
+  edges?: Array<{
+    id?: string;
+    fromId: string;
+    toId: string;
+    type: string;
+    weight?: number;
+    properties?: Record<string, unknown>;
+  }>;
 }
-export interface GraphQueryResult {
-    action: string;
-    nodes?: GraphNode[];
-    edges?: GraphEdge[];
-    stats?: GraphStats;
-    nodesAdded?: number;
-    edgesAdded?: number;
-    deleted?: number;
-    summary: string;
+interface GraphQueryResult {
+  action: string;
+  nodes?: GraphNode[];
+  edges?: GraphEdge[];
+  stats?: GraphStats;
+  nodesAdded?: number;
+  edgesAdded?: number;
+  deleted?: number;
+  summary: string;
 }
-export declare function graphQuery(graphStore: IGraphStore, options: GraphQueryOptions): Promise<GraphQueryResult>;
-export interface GraphAugmentOptions {
-    /** Max graph hops from each vector hit (default: 1) */
-    hops?: number;
-    /** Edge type filter for graph expansion */
-    edgeType?: string;
-    /** Max graph nodes per vector hit (default: 5) */
-    maxPerHit?: number;
+declare function graphQuery(graphStore: IGraphStore, options: GraphQueryOptions): Promise<GraphQueryResult>;
+interface GraphAugmentOptions {
+  /** Max graph hops from each vector hit (default: 1) */
+  hops?: number;
+  /** Edge type filter for graph expansion */
+  edgeType?: string;
+  /** Max graph nodes per vector hit (default: 5) */
+  maxPerHit?: number;
 }
-export interface GraphAugmentedResult {
-    /** Original search result record ID */
-    recordId: string;
-    /** Original similarity score */
-    score: number;
-    /** Source path of the matched record */
-    sourcePath: string;
-    /** Graph nodes connected to this record (via sourceRecordId) */
-    graphContext: GraphTraversalResult;
+interface GraphAugmentedResult {
+  /** Original search result record ID */
+  recordId: string;
+  /** Original similarity score */
+  score: number;
+  /** Source path of the matched record */
+  sourcePath: string;
+  /** Graph nodes connected to this record (via sourceRecordId) */
+  graphContext: GraphTraversalResult;
 }
 /**
  * Augment vector search results with graph context.
  * For each search hit, finds linked graph nodes and traverses their connections.
  */
-export declare function graphAugmentSearch(graphStore: IGraphStore, hits: Array<{
-    recordId: string;
-    score: number;
-    sourcePath: string;
+declare function graphAugmentSearch(graphStore: IGraphStore, hits: Array<{
+  recordId: string;
+  score: number;
+  sourcePath: string;
 }>, options?: GraphAugmentOptions): Promise<GraphAugmentedResult[]>;
-//# sourceMappingURL=graph-query.d.ts.map
+//#endregion
+export { GraphAugmentOptions, GraphAugmentedResult, GraphQueryOptions, GraphQueryResult, graphAugmentSearch, graphQuery };