@fenglimg/fabric-server 2.3.0-rc.7 → 2.3.0-rc.9

package/dist/index.d.ts

@@ -745,36 +745,6 @@ interface RelatedGraphNode {
  * id index carries both forms for every node.
  */
 declare function buildRelatedGraph(nodes: RelatedGraphNode[]): RelatedGraphInspection;
-/** A richer node carrying the text/metadata signals the suggestion heuristic reads. */
-interface RelatedGraphNodeRich {
-    /** Store-qualified id (`<alias>:<stableId>`). */
-    qualifiedId: string;
-    summary: string;
-    /** RuleDescription.intent_clues (NOT `keywords` — RuleDescription has no such field). */
-    intentClues: string[];
-    tags: string[];
-    relevancePaths: string[];
-    /** Existing declared `related` edges — a pair already connected here is never re-proposed. */
-    related: string[];
-}
-/** A proposed related edge: an ordered id pair, a confidence, and the signals that fired. */
-interface SuggestedRelatedEdge {
-    source: string;
-    target: string;
-    confidence: number;
-    provenance: string[];
-}
-/**
- * Propose related edges the corpus is missing. For every unordered pair NOT already
- * connected via existing `related`, score:
- *   - token Jaccard over tokenize(summary + intent_clues) — the DOMINANT signal
- *   - tag-set intersection — an INDEPENDENT boolean bonus (never folded into tokens)
- *   - shared relevance_paths — an INDEPENDENT boolean bonus
- * confidence = jaccard + bonuses, clamped [0,1]. Only pairs >= 0.6 are returned, each
- * with a non-empty provenance[] naming the firing signals. Pure + deterministic
- * (same input → same output; sorted confidence desc, then source, then target).
- */
-declare function suggestRelatedEdges(nodes: RelatedGraphNodeRich[]): SuggestedRelatedEdge[];
 /**
  * Walk the store canonical corpus and build the related graph. Never throws —
  * collectStoreCanonicalEntries degrades to [] when no store is in the read-set.
@@ -786,13 +756,6 @@ declare function suggestRelatedEdges(nodes: RelatedGraphNodeRich[]): SuggestedRe
  * read `description.related` directly (the single source the recall path uses).
  */
 declare function inspectRelatedGraph(projectRoot: string): Promise<RelatedGraphInspection>;
-/**
- * Walk the store canonical corpus and PROPOSE the top-N missing related edges via the
- * pure suggestRelatedEdges heuristic. Never throws — collectStoreCanonicalEntries
- * degrades to [] when no store is in the read-set. READ-ONLY: it computes suggestions
- * and writes nothing; edge creation stays on the fabric-review modify path.
- */
-declare function inspectSuggestedRelatedEdges(projectRoot: string): Promise<SuggestedRelatedEdge[]>;
 
 interface StoreReachability {
     uuid: string;
@@ -1186,4 +1149,4 @@ interface ShutdownHandlerDeps {
  */
 declare function createShutdownHandler(deps: ShutdownHandlerDeps): () => void;
 
-export { AGENTS_MD_RESOURCE_URI, type AlwaysActiveBody, type ArchiveHistoryEntry, type ArchiveHistoryReport, COLD_EVAL_RUBRIC, type CiteCoverageReport, type ColdEvalBatch, type ColdEvalCandidate, type ColdEvalVerdict, type ConflictEntry, type ConflictJudge, type ConflictLintReport, type ConflictPair, type ConflictVerdict, type ConsumptionEntry, type ConsumptionInspection, type ConsumptionLintConfig, DEFAULT_CONFLICT_SIMILARITY_THRESHOLD, type DoctorApplyLintMutation, type DoctorApplyLintMutationKind, type DoctorApplyLintReport, type DoctorFixReport, type DoctorIssue, type DoctorReport, EVENT_LEDGER_PATH, type EnrichDescriptionsCandidate, type EnrichDescriptionsMode, type EnrichDescriptionsReport, FABRIC_SERVER_INSTRUCTIONS, type HistoryAllReport, type HistoryDayRow, type InFlightTracker, type KnowledgeCensus, LEDGER_PATH, LEGACY_LEDGER_PATH, METRICS_LEDGER_PATH, METRIC_COUNTER_NAMES, type MetricCounterName, type MetricsRow, OPTIONAL_EMBED_PACKAGE, type PlanContextInput, type PlanContextResult, type PrecheckResult, RETIRED_TOKENS, type RecallInput, type RecallResult, type RelatedBrokenLink, type RelatedGraphInspection, type RelatedGraphNode, type RelatedGraphNodeRich, type RelatedHubEntry, type RequirementProfile, type RetiredReferenceHit, type RetiredReferenceInspection, type RetiredToken, type SelectionTokenState, type ShutdownHandlerDeps, type StoreCanonicalEntry, type StoreReachability, type SuggestedRelatedEdge, type SurfaceVerdict, type UnboundProjectViolation, type WhyNotSurfacedResult, aggregateConsumption, appendEventLedgerEvent, buildAlwaysActiveBodies, buildColdEvalBatch, buildKnowledgeCensus, buildRelatedGraph, bumpCounter, clearPrecheckCache, collectStoreCanonicalEntries, contextCache, createFabricServer, createInFlightTracker, createShutdownHandler, defaultEmbedCacheDir, detectUnboundProject, drainCounters, enrichDescriptions, evaluateStoreDir, explainWhyNotSurfaced, extractKnowledge, findConflictCandidates, flushAndSyncEventLedger, flushMetrics, formatPreexistingRootMessage, getEventLedgerPath, getLedgerPath, getLegacyLedgerPath, getMetricsLedgerPath, inspectConsumption, inspectRelatedGraph, inspectRetiredReferences, inspectSuggestedRelatedEdges, isEmbedderResolvable, lintConflicts, loadConflictEntries, loadEmbedder, pairSimilarity, planContext, precheckStoreReachability, readEmbedConfig, readEventLedger, readFusion, readLedger, readMetrics, readSelectionToken, recall, rehydrateAgentsMetaAt, resolveLedgerPaths, reviewKnowledge, reviewPending, runDoctorApplyLint, runDoctorArchiveHistory, runDoctorCiteCoverage, runDoctorConflictLint, runDoctorFix, runDoctorHistoryAll, runDoctorReport, startMetricsFlush, startRotationTick, startStdioServer, stopMetricsFlush, stopRotationTick, suggestRelatedEdges };
+export { AGENTS_MD_RESOURCE_URI, type AlwaysActiveBody, type ArchiveHistoryEntry, type ArchiveHistoryReport, COLD_EVAL_RUBRIC, type CiteCoverageReport, type ColdEvalBatch, type ColdEvalCandidate, type ColdEvalVerdict, type ConflictEntry, type ConflictJudge, type ConflictLintReport, type ConflictPair, type ConflictVerdict, type ConsumptionEntry, type ConsumptionInspection, type ConsumptionLintConfig, DEFAULT_CONFLICT_SIMILARITY_THRESHOLD, type DoctorApplyLintMutation, type DoctorApplyLintMutationKind, type DoctorApplyLintReport, type DoctorFixReport, type DoctorIssue, type DoctorReport, EVENT_LEDGER_PATH, type EnrichDescriptionsCandidate, type EnrichDescriptionsMode, type EnrichDescriptionsReport, FABRIC_SERVER_INSTRUCTIONS, type HistoryAllReport, type HistoryDayRow, type InFlightTracker, type KnowledgeCensus, LEDGER_PATH, LEGACY_LEDGER_PATH, METRICS_LEDGER_PATH, METRIC_COUNTER_NAMES, type MetricCounterName, type MetricsRow, OPTIONAL_EMBED_PACKAGE, type PlanContextInput, type PlanContextResult, type PrecheckResult, RETIRED_TOKENS, type RecallInput, type RecallResult, type RelatedBrokenLink, type RelatedGraphInspection, type RelatedGraphNode, type RelatedHubEntry, type RequirementProfile, type RetiredReferenceHit, type RetiredReferenceInspection, type RetiredToken, type SelectionTokenState, type ShutdownHandlerDeps, type StoreCanonicalEntry, type StoreReachability, type SurfaceVerdict, type UnboundProjectViolation, type WhyNotSurfacedResult, aggregateConsumption, appendEventLedgerEvent, buildAlwaysActiveBodies, buildColdEvalBatch, buildKnowledgeCensus, buildRelatedGraph, bumpCounter, clearPrecheckCache, collectStoreCanonicalEntries, contextCache, createFabricServer, createInFlightTracker, createShutdownHandler, defaultEmbedCacheDir, detectUnboundProject, drainCounters, enrichDescriptions, evaluateStoreDir, explainWhyNotSurfaced, extractKnowledge, findConflictCandidates, flushAndSyncEventLedger, flushMetrics, formatPreexistingRootMessage, getEventLedgerPath, getLedgerPath, getLegacyLedgerPath, getMetricsLedgerPath, inspectConsumption, inspectRelatedGraph, inspectRetiredReferences, isEmbedderResolvable, lintConflicts, loadConflictEntries, loadEmbedder, pairSimilarity, planContext, precheckStoreReachability, readEmbedConfig, readEventLedger, readFusion, readLedger, readMetrics, readSelectionToken, recall, rehydrateAgentsMetaAt, resolveLedgerPaths, reviewKnowledge, reviewPending, runDoctorApplyLint, runDoctorArchiveHistory, runDoctorCiteCoverage, runDoctorConflictLint, runDoctorFix, runDoctorHistoryAll, runDoctorReport, startMetricsFlush, startRotationTick, startStdioServer, stopMetricsFlush, stopRotationTick };

package/dist/index.js

@@ -5421,6 +5421,9 @@ ${content}`;
   if (patch.relevance_paths !== void 0) updates.relevance_paths = `relevance_paths: ${flowArray(patch.relevance_paths)}`;
   if (patch.semantic_scope !== void 0) updates.semantic_scope = `semantic_scope: ${patch.semantic_scope}`;
   if (patch.related !== void 0) updates.related = `related: ${flowArray(patch.related)}`;
+  if (patch.must_read_if !== void 0) updates.must_read_if = `must_read_if: ${quoteIfNeeded(patch.must_read_if)}`;
+  if (patch.intent_clues !== void 0) updates.intent_clues = `intent_clues: ${flowArray(patch.intent_clues)}`;
+  if (patch.impact !== void 0) updates.impact = `impact: ${flowArray(patch.impact)}`;
   if (patch.status !== void 0) updates.status = `status: ${patch.status}`;
   if (patch.deferred_until !== void 0) updates.deferred_until = `deferred_until: ${quoteIfNeeded(patch.deferred_until)}`;
   if (patch.last_review_confirmed_at !== void 0) updates.last_review_confirmed_at = `last_review_confirmed_at: ${quoteIfNeeded(patch.last_review_confirmed_at)}`;
@@ -5458,6 +5461,9 @@ function appendPatchLines(lines, patch) {
   if (patch.relevance_scope !== void 0) lines.push(`relevance_scope: ${patch.relevance_scope}`);
   if (patch.relevance_paths !== void 0) lines.push(`relevance_paths: ${flowArray(patch.relevance_paths)}`);
   if (patch.related !== void 0) lines.push(`related: ${flowArray(patch.related)}`);
+  if (patch.must_read_if !== void 0) lines.push(`must_read_if: ${quoteIfNeeded(patch.must_read_if)}`);
+  if (patch.intent_clues !== void 0) lines.push(`intent_clues: ${flowArray(patch.intent_clues)}`);
+  if (patch.impact !== void 0) lines.push(`impact: ${flowArray(patch.impact)}`);
   if (patch.status !== void 0) lines.push(`status: ${patch.status}`);
   if (patch.deferred_until !== void 0) lines.push(`deferred_until: ${quoteIfNeeded(patch.deferred_until)}`);
   if (patch.last_review_confirmed_at !== void 0) lines.push(`last_review_confirmed_at: ${quoteIfNeeded(patch.last_review_confirmed_at)}`);
@@ -7672,7 +7678,13 @@ async function inspectHooksWired(projectRoot) {
   const required = [
     { event: "Stop", hookFile: "fabric-hint.cjs" },
     { event: "SessionStart", hookFile: "knowledge-hint-broad.cjs" },
-    { event: "PreToolUse", hookFile: "knowledge-hint-narrow.cjs" }
+    // ux-w2-6 (rc.9): PreToolUse is the SINGLE merged orchestrator
+    // knowledge-pretooluse.cjs which internally requires knowledge-hint-narrow.cjs
+    // (and cite-policy-evict.cjs) so a single edit produces ONE additionalContext
+    // envelope instead of two. The stale reference to narrow.cjs here was the
+    // rc.30 BUG-M3 false-negative source — narrow.cjs still exists on disk as a
+    // lib but is NOT registered as a PreToolUse hook.
+    { event: "PreToolUse", hookFile: "knowledge-pretooluse.cjs" }
   ];
   const missing = [];
   const hooksSection = isRecord(parsed) ? parsed.hooks : void 0;
@@ -11087,7 +11099,6 @@ function buildColdEvalBatch(candidates) {
 }
 
 // src/services/doctor-related-graph.ts
-import { tokenize as tokenize3 } from "@fenglimg/fabric-shared";
 function buildRelatedGraph(nodes) {
   const brokenLinks = [];
   const inDegree = /* @__PURE__ */ new Map();
@@ -11128,66 +11139,6 @@ function extractBareStableId(qualifiedId) {
   }
   return null;
 }
-var SUGGEST_CONFIDENCE_THRESHOLD = 0.6;
-var TAG_OVERLAP_BONUS = 0.15;
-var PATH_OVERLAP_BONUS = 0.15;
-function suggestRelatedEdges(nodes) {
-  const pairKey = (a, b) => a < b ? `${a}|${b}` : `${b}|${a}`;
-  const prepared = nodes.map((node) => ({
-    qualifiedId: node.qualifiedId,
-    bareId: extractBareStableId(node.qualifiedId) ?? node.qualifiedId,
-    tokens: new Set(tokenize3(`${node.summary} ${node.intentClues.join(" ")}`)),
-    tags: new Set(node.tags),
-    paths: new Set(node.relevancePaths)
-  }));
-  const existing = /* @__PURE__ */ new Set();
-  for (const node of nodes) {
-    const aBare = extractBareStableId(node.qualifiedId) ?? node.qualifiedId;
-    for (const rel of node.related) {
-      existing.add(pairKey(aBare, extractBareStableId(rel) ?? rel));
-    }
-  }
-  const out = [];
-  for (let i = 0; i < prepared.length; i++) {
-    for (let j = i + 1; j < prepared.length; j++) {
-      const a = prepared[i];
-      const b = prepared[j];
-      if (a.bareId === b.bareId) continue;
-      if (existing.has(pairKey(a.bareId, b.bareId))) continue;
-      let intersection = 0;
-      for (const t of a.tokens) if (b.tokens.has(t)) intersection++;
-      const union = a.tokens.size + b.tokens.size - intersection;
-      const jaccard = union === 0 ? 0 : intersection / union;
-      let tagOverlap = false;
-      for (const t of a.tags)
-        if (b.tags.has(t)) {
-          tagOverlap = true;
-          break;
-        }
-      let pathOverlap = false;
-      for (const p of a.paths)
-        if (b.paths.has(p)) {
-          pathOverlap = true;
-          break;
-        }
-      let confidence = jaccard;
-      if (tagOverlap) confidence += TAG_OVERLAP_BONUS;
-      if (pathOverlap) confidence += PATH_OVERLAP_BONUS;
-      confidence = Math.min(1, confidence);
-      if (confidence < SUGGEST_CONFIDENCE_THRESHOLD) continue;
-      const provenance = [];
-      if (jaccard > 0) provenance.push("token-jaccard");
-      if (tagOverlap) provenance.push("tag-overlap");
-      if (pathOverlap) provenance.push("shared-path");
-      const [source, target] = a.qualifiedId < b.qualifiedId ? [a.qualifiedId, b.qualifiedId] : [b.qualifiedId, a.qualifiedId];
-      out.push({ source, target, confidence, provenance });
-    }
-  }
-  out.sort(
-    (x, y) => y.confidence - x.confidence || x.source.localeCompare(y.source) || x.target.localeCompare(y.target)
-  );
-  return out;
-}
 async function inspectRelatedGraph(projectRoot) {
   const entries = await collectStoreCanonicalEntries(projectRoot);
   return buildRelatedGraph(
@@ -11197,24 +11148,6 @@ async function inspectRelatedGraph(projectRoot) {
     }))
   );
 }
-var SUGGESTED_EDGES_TOP_N = 20;
-async function inspectSuggestedRelatedEdges(projectRoot) {
-  let entries;
-  try {
-    entries = await collectStoreCanonicalEntries(projectRoot);
-  } catch {
-    return [];
-  }
-  const nodes = entries.map((entry) => ({
-    qualifiedId: entry.qualifiedId,
-    summary: entry.description.summary ?? "",
-    intentClues: entry.description.intent_clues ?? [],
-    tags: entry.description.tags ?? [],
-    relevancePaths: entry.description.relevance_paths ?? [],
-    related: entry.description.related ?? []
-  }));
-  return suggestRelatedEdges(nodes).slice(0, SUGGESTED_EDGES_TOP_N);
-}
 
 // src/services/store-precheck.ts
 import { existsSync as existsSync9, readFileSync as readFileSync4 } from "fs";
@@ -11696,7 +11629,7 @@ function createFabricServer(tracker) {
   const server = new McpServer(
     {
       name: "fabric-knowledge-server",
-      version: "2.3.0-rc.7"
+      version: "2.3.0-rc.9"
     },
     {
       instructions: FABRIC_SERVER_INSTRUCTIONS
@@ -11850,7 +11783,6 @@ export {
   inspectConsumption,
   inspectRelatedGraph,
   inspectRetiredReferences,
-  inspectSuggestedRelatedEdges,
   isEmbedderResolvable,
   lintConflicts,
   loadConflictEntries,
@@ -11880,6 +11812,5 @@ export {
   startRotationTick,
   startStdioServer,
   stopMetricsFlush,
-  stopRotationTick,
-  suggestRelatedEdges
+  stopRotationTick
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fenglimg/fabric-server",
-  "version": "2.3.0-rc.7",
+  "version": "2.3.0-rc.9",
   "description": "Fabric MCP knowledge server — stdio transport for Claude Code / Codex CLI, manages .fabric/ knowledge base + agents.meta.json + event ledger.",
   "license": "MIT",
   "author": "wangzhichao <fenglimg90@gmail.com>",
@@ -37,7 +37,7 @@
     "@modelcontextprotocol/sdk": "^1.29.0",
     "minimatch": "^10.0.1",
     "zod": "^3.25.0",
-    "@fenglimg/fabric-shared": "2.3.0-rc.7"
+    "@fenglimg/fabric-shared": "2.3.0-rc.9"
   },
   "optionalDependencies": {
     "fastembed": "^2.0.0"