loopctl-mcp-server 2.24.0 → 2.26.0

package/index.js

@@ -848,6 +848,7 @@ async function knowledgeCreate({
   tags,
   project_id,
   draft,
+  force,
   source_type,
   source_id,
   idempotency_key,
@@ -868,6 +869,10 @@ async function knowledgeCreate({
   // knowledge_publish.
   if (draft) payload.draft = true;
 
+  // The server-side novelty gate dedups the proposal against the corpus (verdict in
+  // the response `gate`). force:true bypasses it.
+  if (force) payload.force = true;
+
   const result = await apiCall(
     "POST",
     "/api/v1/articles",
@@ -1022,9 +1027,9 @@ async function knowledgeBulkDelete({
 
 async function knowledgeDrafts({ limit, offset, project_id }) {
   const params = new URLSearchParams();
-  // Pass `limit` through verbatim (like knowledge_list/index/search) so the
-  // server honors it up to its max page size and returns 400 above it — rather
-  // than silently clamping client-side, which would truncate draft enumeration.
+  // Pass `limit` through verbatim (like knowledge_list/index/search) so the server
+  // honors it up to its max page size, clamping above it server-side rather than
+  // silently clamping client-side (which would truncate draft enumeration).
   if (limit != null) params.set("limit", String(limit));
   if (offset != null) params.set("offset", String(offset));
   if (project_id) params.set("project_id", project_id);
@@ -1033,6 +1038,18 @@ async function knowledgeDrafts({ limit, offset, project_id }) {
   return toContent(result);
 }
 
+async function knowledgeConflicts({ limit, offset }) {
+  const params = new URLSearchParams();
+  if (limit != null) params.set("limit", String(limit));
+  if (offset != null) params.set("offset", String(offset));
+  const qs = params.toString();
+  const path = qs
+    ? `/api/v1/knowledge/conflicts?${qs}`
+    : "/api/v1/knowledge/conflicts";
+  const result = await apiCall("GET", path, null, process.env.LOOPCTL_AGENT_KEY);
+  return toContent(result);
+}
+
 async function knowledgeLint({ project_id, stale_days, min_coverage, max_per_category }) {
   const params = new URLSearchParams();
   if (stale_days != null) params.set("stale_days", String(stale_days));
@@ -2565,6 +2582,13 @@ const TOOLS = [
       "to agents (search/index/context) right away — no separate publish step is needed. Pass " +
       "draft: true to stage the article for later review instead; the response `note` says which " +
       "outcome occurred, and a draft can be published afterwards with knowledge_publish. " +
+      "NOVELTY GATE (default ON): the server semantically dedups your proposal against the published " +
+      "corpus and returns a `gate.verdict` — `duplicate` means a near-identical article already exists, " +
+      "so NOTHING was created (HTTP 200, `deduplicated: true`); read/update the article at `data.id` " +
+      "instead (its `gate.similarity` ~1.0). `gated_to_draft` means high overlap, so the article was " +
+      "created as a DRAFT (not published) with the near-neighbors in metadata.proposal_novelty for you " +
+      "to merge or publish. `created` means it was novel and went through normally. Pass force: true to " +
+      "bypass the gate when you intentionally want an article near an existing one. " +
       "Concurrency-safe: if a create races/retries against an " +
       "existing article with the same title AND an identical body (ignoring surrounding whitespace), the " +
       "server returns that existing article idempotently (HTTP 200) instead of a 422. A same-title create " +
@@ -2600,6 +2624,13 @@ const TOOLS = [
             "Optional: stage as a draft instead of publishing on create (default false → " +
             "published immediately). Publish later with knowledge_publish.",
         },
+        force: {
+          type: "boolean",
+          description:
+            "Optional: bypass the novelty gate (default false). When true, the server skips " +
+            "semantic dedup and creates on the requested path even if a near-duplicate exists. " +
+            "Use only when you've already checked and intend an article close to an existing one.",
+        },
         idempotency_key: {
           type: "string",
           description:
@@ -2833,8 +2864,8 @@ const TOOLS = [
     description:
       "List draft (unpublished) knowledge articles. Requires orchestrator role. " +
       "Returns paginated drafts with total_count in meta. Paginate via offset/limit " +
-      "(limit honored up to 1000; a limit above the max is rejected with 400, not " +
-      "silently clamped).",
+      "(limit honored up to 1000; a limit above the max is clamped to the maximum, " +
+      "never rejected, so pagination stays complete).",
     inputSchema: {
       type: "object",
       properties: {
@@ -2842,7 +2873,7 @@ const TOOLS = [
           type: "integer",
           description:
             "Max drafts per page (default 20, max 1000). A limit above the max is " +
-            "rejected with 400 — not silently clamped — so offset pagination stays complete.",
+            "clamped to the maximum — never rejected — so offset pagination stays complete.",
           default: 20,
           minimum: 1,
           maximum: 1000,
@@ -2861,6 +2892,39 @@ const TOOLS = [
       required: [],
     },
   },
+  {
+    name: "knowledge_conflicts",
+    description:
+      "List potential-conflict article pairs — published articles flagged 'too similar " +
+      "to comfortably coexist' by the auto-linker / nightly lint sweep, highest-overlap " +
+      "first. The KB only FLAGS the pair (via a mechanical similarity threshold); it does " +
+      "NOT decide whether it's a redundancy to merge or a real contradiction — that's your " +
+      "call, with the live context. Each entry has the two articles (id/title/status/" +
+      "category) and their similarity. Read both, then merge (supersede one, knowledge_create " +
+      "the merged article, or PATCH) or, if they genuinely disagree, reconcile. Paginated " +
+      "with total_count in meta. Agent role.",
+    inputSchema: {
+      type: "object",
+      properties: {
+        limit: {
+          type: "integer",
+          description:
+            "Max pairs per page (default 50, max 1000). A limit above the max is clamped " +
+            "to the maximum — never rejected — so offset pagination stays complete.",
+          default: 50,
+          minimum: 1,
+          maximum: 1000,
+        },
+        offset: {
+          type: "integer",
+          description: "Pagination offset. Default 0.",
+          default: 0,
+          minimum: 0,
+        },
+      },
+      required: [],
+    },
+  },
   {
     name: "knowledge_lint",
     description:
@@ -3481,6 +3545,9 @@ server.setRequestHandler(CallToolRequestSchema, async (request) => {
     case "knowledge_drafts":
       return await knowledgeDrafts(args);
 
+    case "knowledge_conflicts":
+      return await knowledgeConflicts(args);
+
     case "knowledge_lint":
       return await knowledgeLint(args);
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "loopctl-mcp-server",
-  "version": "2.24.0",
+  "version": "2.26.0",
   "description": "MCP server for loopctl — structural trust for AI development loops",
   "type": "module",
   "main": "index.js",