kibi-cli 2.5.1 → 2.6.0

package/README.md

@@ -0,0 +1,41 @@
+# kibi-cli
+
+The `kibi` command-line interface for [Kibi](https://looted.github.io/kibi/), an agent-native requirements compiler and enforcement layer. Kibi keeps a branch-local knowledge base of requirements, scenarios, tests, facts and code-symbol links in your repository's `.kb/` directory and checks it with Prolog.
+
+Most people install `kibi-cli` together with `kibi-core` and `kibi-mcp`, then let their coding agent drive it.
+
+## Install
+
+Requires Node.js 22+. SWI-Prolog is bundled for Linux (x64/arm64, glibc 2.28+) and macOS (Apple silicon/Intel); elsewhere, install SWI-Prolog 9.0+ and put `swipl` on your `PATH`.
+
+```bash
+npm install --save-dev kibi-core kibi-cli kibi-mcp
+npm exec -- kibi init
+```
+
+Do not install with `--omit=optional`: the bundled SWI-Prolog runtime is an optional dependency. The [installation guide](https://looted.github.io/kibi/guide/install.html) covers pnpm, Yarn and Bun.
+
+## Common commands
+
+```bash
+kibi init       # create the .kb/ layout and Git hooks
+kibi doctor     # diagnose the environment, including which SWI-Prolog is used
+kibi sync       # rebuild the KB from the checkout
+kibi status     # freshness and health of the current branch's KB
+kibi search     # ask a question of the KB
+kibi check      # validate traceability, contradictions and semantics
+kibi report     # write the kibi-report/ health page and badge
+kibi migrate    # preview and apply KB schema upgrades
+```
+
+Agents without MCP can call the same operations through JSON routes, for example `printf '%s\n' '{...}' | npx --no-install kibi <route> --input -`. See the [CLI reference](https://looted.github.io/kibi/reference/cli.html) for every command and route.
+
+## Links
+
+- [Documentation](https://looted.github.io/kibi/)
+- [Source](https://github.com/Looted/kibi)
+- [Issues](https://github.com/Looted/kibi/issues)
+
+## License
+
+AGPL-3.0-or-later

package/dist/intent-search.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"intent-search.d.ts","sourceRoot":"","sources":["../src/intent-search.ts"],"names":[],"mappings":"AAGA,OAAO,EAEL,KAAK,kBAAkB,EAKxB,MAAM,2CAA2C,CAAC;AACnD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AACvE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAIvD,MAAM,MAAM,qBAAqB,GAC7B,QAAQ,GACR,SAAS,GACT,SAAS,GACT,aAAa,GACb,SAAS,CAAC;AAGd,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CACvC,OAAO,CAAC,MAAM,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAC1D,CAAC;AAGF,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAAC,CAAC;AAGH,MAAM,MAAM,mBAAmB,GAAG,QAAQ,CAAC;IACzC,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;IACpD,cAAc,CAAC,EAAE,kBAAkB,CAAC;IACpC,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC,CAAC;AAGH,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC,CAAC;AAGH,MAAM,MAAM,eAAe,GAAG,QAAQ,CAAC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC,CAAC;AAGH,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,aAAa,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAC5C,UAAU,EAAE,SAAS,eAAe,EAAE,CAAC;IACvC,kBAAkB,EAAE,OAAO,CAAC;CAC7B,CAAC,CAAC;AAGH,MAAM,MAAM,iBAAiB,GAAG,WAAW,GAAG;IAC5C,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,CAAC;CACzC,CAAC;AAGF,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,WAAW,EAAE,WAAW,CAAC;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC,CAAC;AAGH,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;IACxC,OAAO,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACtC,QAAQ,EAAE,oBAAoB,CAAC;CAChC,CAAC,CAAC;AAEH,KAAK,SAAS,GAAG,QAAQ,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC,CAAC;AAobH,2EAA2E;AAE3E,MAAM,MAAM,iBAAiB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;AA8B3D,wBAAsB,kBAAkB,CACtC,QAAQ,EAAE,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAC5C,OAAO,EAAE,mBAAmB,EAC5B,aAAa,EAAE,MAAM,EACrB,UAAU,GAAE,SAAS,SAAS,EAAO,EACrC,SAAS,GAAE,iBAA6B,GACvC,OAAO,CAAC,kBAAkB,CAAC,CAsG7B;AAED,wBAAgB,SAAS,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAO1E;AAkHD,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,mBAAmB,EAC5B,MAAM,EAAE,UAAU,EAClB,aAAa,EAAE,MAAM,GACpB,OAAO,CAAC,kBAAkB,CAAC,CAoD7B;AAGD,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,mBAAmB,GAAG,IAAI,CA0C1E"}
+{"version":3,"file":"intent-search.d.ts","sourceRoot":"","sources":["../src/intent-search.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,KAAK,kBAAkB,EAIxB,MAAM,2CAA2C,CAAC;AACnD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AACvE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAIvD,MAAM,MAAM,qBAAqB,GAC7B,QAAQ,GACR,SAAS,GACT,SAAS,GACT,aAAa,GACb,SAAS,CAAC;AAGd,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CACvC,OAAO,CAAC,MAAM,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAC1D,CAAC;AAGF,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAAC,CAAC;AAGH,MAAM,MAAM,mBAAmB,GAAG,QAAQ,CAAC;IACzC,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;IACpD,cAAc,CAAC,EAAE,kBAAkB,CAAC;IACpC,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC,CAAC;AAGH,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC,CAAC;AAGH,MAAM,MAAM,eAAe,GAAG,QAAQ,CAAC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC,CAAC;AAGH,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,aAAa,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAC5C,UAAU,EAAE,SAAS,eAAe,EAAE,CAAC;IACvC,kBAAkB,EAAE,OAAO,CAAC;CAC7B,CAAC,CAAC;AAGH,MAAM,MAAM,iBAAiB,GAAG,WAAW,GAAG;IAC5C,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,CAAC;CACzC,CAAC;AAGF,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,WAAW,EAAE,WAAW,CAAC;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC,CAAC;AAGH,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;IACxC,OAAO,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACtC,QAAQ,EAAE,oBAAoB,CAAC;CAChC,CAAC,CAAC;AAEH,KAAK,SAAS,GAAG,QAAQ,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC,CAAC;AAobH,2EAA2E;AAE3E,MAAM,MAAM,iBAAiB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;AA8B3D,wBAAsB,kBAAkB,CACtC,QAAQ,EAAE,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAC5C,OAAO,EAAE,mBAAmB,EAC5B,aAAa,EAAE,MAAM,EACrB,UAAU,GAAE,SAAS,SAAS,EAAO,EACrC,SAAS,GAAE,iBAA6B,GACvC,OAAO,CAAC,kBAAkB,CAAC,CAsG7B;AAED,wBAAgB,SAAS,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAO1E;AA8FD,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,mBAAmB,EAC5B,MAAM,EAAE,UAAU,EAClB,aAAa,EAAE,MAAM,GACpB,OAAO,CAAC,kBAAkB,CAAC,CAoD7B;AAGD,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,mBAAmB,GAAG,IAAI,CA0C1E"}

package/dist/intent-search.js

@@ -1,6 +1,6 @@
 import path from "node:path";
 import { escapeAtom, normalizeEntityId, parseTriples } from "./prolog/codec.js";
-import { SEARCH_CANDIDATE_PAGE_SIZE, listSearchCandidates, loadEntities, loadEntityRows, loadSearchCandidates, } from "./public/operations/discovery-entities.js";
+import { listSearchCandidates, loadEntityRows, loadSearchCandidates, } from "./public/operations/discovery-entities.js";
 import { loadMarkdownBody } from "./search-ranking.js";
 const GRAPH_RELATIONSHIPS = [
     "implements",
@@ -502,28 +502,18 @@ async function loadIntentCandidates(prolog, options) {
             candidates.set(key, { ...entity });
         }
     };
+    // Source-located candidates are projected rows too, read through the
+    // same source filter kb_query_entities applies, so a file with many
+    // receipt-bearing tests does not ship their complete payloads.
     const sourceLocations = options.sourceLocations ?? [];
-    if (sourceLocations.length > 0 && prolog.queryEntities) {
-        for (const location of sourceLocations) {
-            if (candidates.size >= MAX_CANDIDATES)
-                break;
-            let offset = 0;
-            let total = Number.POSITIVE_INFINITY;
-            while (offset < total && candidates.size < MAX_CANDIDATES) {
-                const limit = Math.min(SEARCH_CANDIDATE_PAGE_SIZE, MAX_CANDIDATES - candidates.size);
-                const page = await prolog.queryEntities({
-                    ...(options.type !== undefined ? { type: options.type } : {}),
-                    sourceFile: location.path,
-                    limit,
-                    offset,
-                });
-                if (page.entities.length === 0)
-                    break;
-                addCandidates(page.entities);
-                total = page.count;
-                offset += page.entities.length;
-            }
-        }
+    for (const location of sourceLocations) {
+        if (candidates.size >= MAX_CANDIDATES)
+            break;
+        addCandidates(await listSearchCandidates(prolog, {
+            ...(options.type !== undefined ? { type: options.type } : {}),
+            sourceFile: location.path,
+            maxCandidates: MAX_CANDIDATES - candidates.size,
+        }));
     }
     // Lexical candidates are projected rows (no receipt histories or other
     // large structured properties); ports without the engine method run the
@@ -544,16 +534,6 @@ async function loadIntentCandidates(prolog, options) {
             maxCandidates: MAX_CANDIDATES,
         }));
     }
-    else if (sourceLocations.length > 0 && !prolog.queryEntities) {
-        for (const location of sourceLocations) {
-            if (candidates.size >= MAX_CANDIDATES)
-                break;
-            addCandidates(await loadEntities(prolog, {
-                ...(options.type !== undefined ? { type: options.type } : {}),
-                sourceFile: location.path,
-            }));
-        }
-    }
     // An unfamiliar host-agent alias may not exist in the lexical index at all.
     // For small facet-bearing corpora, scan the bounded entity set so a zero
     // lexical hit does not turn a valid semantic query into a false abstention.

package/dist/operations/bootstrap/generate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"generate.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/generate.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAOjF,OAAO,KAAK,EACV,SAAS,EACT,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAEpB,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,SAAS,gBAAgB,EAAE,EACpC,WAAW,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,GACzC,SAAS,gBAAgB,EAAE,CAI7B;AA8BD,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,EAChC,WAAW,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,EAC1C,OAAO,EAAE,MAAM,GACd;IACD,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,UAAU,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAClE,QAAQ,CAAC,iBAAiB,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACxD,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACzC,CAsFA;AAiHD,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,mBAAmB,CAAC,CA6F9B"}
+{"version":3,"file":"generate.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/generate.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAUjF,OAAO,KAAK,EACV,SAAS,EACT,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAGpB,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,SAAS,gBAAgB,EAAE,EACpC,WAAW,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,GACzC,SAAS,gBAAgB,EAAE,CAI7B;AA+BD,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,EAChC,WAAW,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,EAC1C,OAAO,EAAE,MAAM,GACd;IACD,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,UAAU,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAClE,QAAQ,CAAC,iBAAiB,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACxD,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACzC,CA6IA;AA+JD,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,mBAAmB,CAAC,CAqG9B"}

package/dist/operations/bootstrap/generate.js

@@ -3,6 +3,7 @@ import path from "node:path";
 import { loadEntityIds } from "../../public/operations/discovery-entities.js";
 import { executeStatus } from "../../public/operations/discovery-executors.js";
 import { readWorkspaceSnapshot } from "../../public/operations/workspace-snapshot.js";
+import { stagedLogicalGroundingError, } from "../semantic-advisor/ingestion-boundary.js";
 import { buildBootstrapCandidates } from "./candidates.js";
 import { discoverBootstrap } from "./discovery.js";
 import { buildIntentClaimCandidates } from "./intent-claims.js";
@@ -35,6 +36,7 @@ function firstUpsertId(candidate) {
 function sha256(value) {
     return createHash("sha256").update(value).digest("hex");
 }
+// implements REQ-bootstrap-write-safety, REQ-bootstrap-intent-claim-accounting, REQ-bootstrap-discovered-candidate-budget
 export function selectBootstrapCandidates(input, existingIds, entityTypes, maximum) {
     const allowed = entityTypes?.length ? new Set(entityTypes) : null;
     const lane = (candidate) => {
@@ -59,8 +61,12 @@ export function selectBootstrapCandidates(input, existingIds, entityTypes, maxim
     };
     const writable = input
         .filter((candidate) => {
-        if (allowed && !allowed.has(candidate.entityType))
+        if (allowed && !allowed.has(candidate.entityType)) {
+            // A filtered claim is the caller's choice, not a dropped claim.
+            if (candidate.sourceKind === "intent_claim")
+                suppress(candidate, "filtered_by_entity_type");
             return false;
+        }
         if (existingIds.has(firstUpsertId(candidate))) {
             suppress(candidate, "entity_exists");
             return false;
@@ -105,16 +111,100 @@ export function selectBootstrapCandidates(input, existingIds, entityTypes, maxim
         else
             selected.set(key, candidate);
     }
-    const unique = [...selected.values()];
-    for (const candidate of unique.slice(maximum))
-        suppress(candidate, "over_limit");
+    // Declared intent claims are never capped and sit outside the arithmetic:
+    // they are what the human pointed at, and the schema already bounds them.
+    // maxCandidates is the budget for candidates Kibi discovers itself, so a
+    // long list of declared intent never starves the code, test and document
+    // evidence that bootstrap is meant to link it to.
+    const written = new Map();
+    const staged = new Map();
+    const candidates = [];
+    let discoveredCount = 0;
+    let overLimit = 0;
+    for (const candidate of selected.values()) {
+        const discovered = candidate.sourceKind !== "intent_claim";
+        if (discovered && discoveredCount >= maximum) {
+            suppress(candidate, "over_limit");
+            overLimit += 1;
+            continue;
+        }
+        // Two candidates that write one entity ID with different content would
+        // overwrite each other mid-apply and break the earlier one's grounding.
+        const conflict = candidate.applyPlan.find((payload) => {
+            const id = payloadId(payload);
+            const previous = id ? written.get(id) : undefined;
+            return previous !== undefined && previous !== JSON.stringify(payload);
+        });
+        if (conflict) {
+            suppress(candidate, "duplicate_entity", `Entity ${payloadId(conflict)} is already written by another candidate with different content.`);
+            continue;
+        }
+        const groundingError = stagedGroundingError(candidate, staged);
+        if (groundingError) {
+            suppress(candidate, "invalid_write", groundingError);
+            diagnostics.push(`Invalid bootstrap candidate at ${candidate.sourcePath}: ${groundingError}`);
+            continue;
+        }
+        for (const payload of candidate.applyPlan) {
+            const id = payloadId(payload);
+            if (!id)
+                continue;
+            written.set(id, JSON.stringify(payload));
+            staged.set(id, stagedEntity(payload));
+        }
+        if (discovered)
+            discoveredCount += 1;
+        candidates.push(candidate);
+    }
+    if (overLimit > 0)
+        diagnostics.push(`${overLimit} discovered candidate(s) exceeded maxCandidates ${maximum} and are suppressed as over_limit; declared intent claims do not count against it.`);
     return {
-        candidates: unique.slice(0, maximum),
+        candidates,
         suppressed,
         sourceOnlySignals,
         diagnostics,
     };
 }
+function payloadId(payload) {
+    if (typeof payload.id === "string")
+        return payload.id;
+    const properties = payload.properties;
+    return properties !== null &&
+        typeof properties === "object" &&
+        "id" in properties &&
+        typeof properties.id === "string"
+        ? properties.id
+        : "";
+}
+function stagedEntity(payload) {
+    const properties = payload.properties !== null && typeof payload.properties === "object"
+        ? payload.properties
+        : {};
+    return { ...properties, id: payloadId(payload), type: payload.type };
+}
+/**
+ * Run the write-time claim_key grounding check against the plan's own
+ * earlier writes, so a mismatch is a suppressed candidate at plan time rather
+ * than a terminal partial apply. Targets outside the plan are left to apply.
+ */
+// implements REQ-bootstrap-intent-claim-accounting
+function stagedGroundingError(candidate, planned) {
+    const local = new Map(planned);
+    for (const payload of candidate.applyPlan) {
+        const id = payloadId(payload);
+        if (id)
+            local.set(id, stagedEntity(payload));
+    }
+    for (const payload of candidate.applyPlan) {
+        const relationships = Array.isArray(payload.relationships)
+            ? payload.relationships
+            : [];
+        const error = stagedLogicalGroundingError(payload, relationships, local);
+        if (error)
+            return error;
+    }
+    return null;
+}
 async function existingEntityIds(context) {
     if (!context.prolog)
         return new Set();
@@ -202,10 +292,15 @@ async function expectedSnapshots(context, evidencePaths) {
         };
     }
 }
-// implements REQ-KIBI-BOOTSTRAP-PLAN, REQ-kibi-operation-interface-parity
+// implements REQ-KIBI-BOOTSTRAP-PLAN, REQ-kibi-operation-interface-parity, REQ-bootstrap-discovered-candidate-budget
 // implements REQ-KIBI-BOOTSTRAP-PLAN
 export async function executePlanBootstrap(args, context) {
-    const includeGenericMarkdown = args.includeGenericMarkdown ?? true;
+    const declared = normalizeBootstrapContext(args.bootstrapContext);
+    // Declared intent claims already carry the human's sources of truth, so
+    // generic Markdown would mostly restate them as duplicate_title noise.
+    const genericMarkdownDefaultOff = args.includeGenericMarkdown === undefined &&
+        (declared.intentClaims?.length ?? 0) > 0;
+    const includeGenericMarkdown = args.includeGenericMarkdown ?? !genericMarkdownDefaultOff;
     const minConfidence = clamp(args.minConfidence ?? 0.8, 0.6, 0.95);
     const maxCandidates = clamp(Math.trunc(args.maxCandidates ?? 50), 1, 200);
     const entityBindingDiagnostics = [];
@@ -232,7 +327,7 @@ export async function executePlanBootstrap(args, context) {
     // Intent harvested from declared knowledge sources joins the repository
     // evidence under the same activation policy, filters, and selection.
     const claimed = discovery.activation.allowCandidateGeneration
-        ? buildIntentClaimCandidates(normalizeBootstrapContext(args.bootstrapContext), existingIds, minConfidence)
+        ? buildIntentClaimCandidates(declared, existingIds, minConfidence)
         : {
             candidates: [],
             sourceOnlySignals: [],
@@ -270,6 +365,11 @@ export async function executePlanBootstrap(args, context) {
         expected,
         bindingDiagnostics: [...bindingDiagnostics, ...entityBindingDiagnostics],
         contextDiagnostics: [
+            ...(genericMarkdownDefaultOff
+                ? [
+                    "Generic Markdown candidates are off by default because intent claims were declared; pass includeGenericMarkdown: true to include them.",
+                ]
+                : []),
             ...claimed.diagnostics,
             ...built.diagnostics,
             ...selected.diagnostics,

package/dist/operations/bootstrap/intent-claims.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"intent-claims.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/intent-claims.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EACV,wBAAwB,EAGxB,SAAS,EACT,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAQpB,MAAM,MAAM,sBAAsB,GAAG;IACnC,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,iBAAiB,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACxD,QAAQ,CAAC,UAAU,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAClE,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACzC,CAAC;AAcF;;;;;;;GAOG;AAEH,wBAAgB,0BAA0B,CACxC,QAAQ,EAAE,wBAAwB,EAClC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,EAChC,aAAa,EAAE,MAAM,GACpB,sBAAsB,CA2FxB"}
+{"version":3,"file":"intent-claims.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/intent-claims.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EACV,wBAAwB,EAGxB,SAAS,EACT,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAQpB,MAAM,MAAM,sBAAsB,GAAG;IACnC,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,iBAAiB,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACxD,QAAQ,CAAC,UAAU,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAClE,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACzC,CAAC;AAuKF;;;;;;;GAOG;AAEH,wBAAgB,0BAA0B,CACxC,QAAQ,EAAE,wBAAwB,EAClC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,EAChC,aAAa,EAAE,MAAM,GACpB,sBAAsB,CA8HxB"}

package/dist/operations/bootstrap/intent-claims.js

@@ -1,5 +1,6 @@
+import { createHash } from "node:crypto";
 import { buildStrictWriteSet } from "../../utils/strict-modeling.js";
-import { confidenceBand, strictPlan } from "./candidate-helpers.js";
+import { confidenceBand, strictPlan, upsert } from "./candidate-helpers.js";
 import { claimFor } from "./requirement-claims.js";
 /** How much a claim is trusted follows the authority the human assigned. */
 const AUTHORITY_CONFIDENCE = {
@@ -14,6 +15,132 @@ function citation(source, claim) {
         ...(source.connector ? [`connector:${source.connector}`] : []),
     ];
 }
+function digest(...parts) {
+    return createHash("sha256")
+        .update(parts.join("\u0000"))
+        .digest("hex")
+        .slice(0, 16)
+        .toUpperCase();
+}
+/**
+ * An observation or open question from a declared source is evidence for the
+ * human, not a requirement: it becomes a cited, non-blocking observation fact
+ * so the plan keeps it without entering the contradiction lane.
+ */
+// implements REQ-bootstrap-claim-kinds-and-conflicts
+function reviewClaimCandidate(source, claim, kind, confidence) {
+    const id = `FACT-BOOTSTRAP-${kind === "open_question" ? "QUESTION" : "OBSERVATION"}-${digest(source.id, claim.reference, claim.statement)}`;
+    const entity = {
+        type: "fact",
+        id,
+        title: claim.statement,
+        status: "active",
+        fact_kind: "observation",
+        source: `knowledge-source:${source.id}`,
+        text_ref: `${source.id}:${claim.reference}`,
+        tags: [
+            "bootstrap",
+            `knowledge-source:${source.id}`,
+            kind === "open_question" ? "review:open-question" : "claim:observation",
+        ],
+    };
+    return {
+        candidateId: `claim:${source.id}:${id.toLowerCase()}`,
+        entityType: "fact",
+        title: claim.statement,
+        sourceKind: "intent_claim",
+        sourcePath: claim.reference,
+        confidence,
+        confidenceBand: confidenceBand(confidence),
+        evidence: [
+            ...citation(source, claim),
+            `claim_kind:${kind}`,
+            ...(claim.excerpt ? [`excerpt:${claim.excerpt}`] : []),
+        ],
+        relationships: [],
+        applyPlan: [upsert(entity)],
+    };
+}
+/**
+ * A conflict the agent declared between claims becomes an observation fact
+ * tagged review:conflict that cites every conflicting claim, so the
+ * disagreement stays explicit in the KB instead of an external report.
+ */
+// implements REQ-bootstrap-claim-kinds-and-conflicts
+function conflictCandidates(declared, sources, existingIds, minConfidence) {
+    const claims = new Set((declared.intentClaims ?? []).map((claim) => `${claim.sourceId}\u0000${claim.reference}`));
+    const candidates = [];
+    const suppressed = [];
+    const diagnostics = [];
+    const confidence = AUTHORITY_CONFIDENCE.authoritative;
+    for (const conflict of declared.conflicts ?? []) {
+        const refs = conflict.claimReferences.map((ref) => `${ref.sourceId}:${ref.reference}`);
+        const undeclared = conflict.claimReferences.filter((ref) => !claims.has(`${ref.sourceId}\u0000${ref.reference}`));
+        if (undeclared.length > 0) {
+            diagnostics.push(`Conflict "${conflict.note}" cites claim(s) not declared in intentClaims: ${undeclared.map((ref) => `${ref.sourceId}:${ref.reference}`).join(", ")}; declare them or correct the reference.`);
+            continue;
+        }
+        const id = `FACT-BOOTSTRAP-CONFLICT-${digest(...[...refs].sort(), conflict.note)}`;
+        const candidateId = `conflict:${id.toLowerCase()}`;
+        if (confidence < minConfidence) {
+            suppressed.push({
+                candidateId,
+                reason: "below_min_confidence",
+                sourcePath: refs.join(", "),
+                entityType: "fact",
+            });
+            continue;
+        }
+        if (existingIds.has(id)) {
+            suppressed.push({
+                candidateId,
+                reason: "entity_exists",
+                sourcePath: refs.join(", "),
+                entityType: "fact",
+            });
+            continue;
+        }
+        const title = `Conflict between ${refs.join(" and ")}: ${conflict.note}`;
+        candidates.push({
+            candidateId,
+            entityType: "fact",
+            title,
+            sourceKind: "intent_claim",
+            sourcePath: refs.join(", "),
+            confidence,
+            confidenceBand: confidenceBand(confidence),
+            evidence: conflict.claimReferences.flatMap((ref) => {
+                const source = sources.get(ref.sourceId);
+                return [
+                    `intent_claim:${ref.sourceId}:${ref.reference}`,
+                    ...(source
+                        ? [`knowledge_source:${source.kind}:${source.locator}`]
+                        : []),
+                ];
+            }),
+            relationships: [],
+            applyPlan: [
+                upsert({
+                    type: "fact",
+                    id,
+                    title,
+                    status: "active",
+                    fact_kind: "observation",
+                    source: "bootstrap:declared-conflict",
+                    text_ref: refs.join("; "),
+                    tags: [
+                        "bootstrap",
+                        "review:conflict",
+                        ...[
+                            ...new Set(conflict.claimReferences.map((ref) => `knowledge-source:${ref.sourceId}`)),
+                        ],
+                    ],
+                }),
+            ],
+        });
+    }
+    return { candidates, sourceOnlySignals: [], suppressed, diagnostics };
+}
 /**
  * Turn intent the agent harvested from declared knowledge sources into cited
  * bootstrap candidates. Kibi never contacts those sources: it only records
@@ -22,7 +149,7 @@ function citation(source, claim) {
  * strict modeler cannot ground stays an explicit authoring follow-up instead
  * of becoming unverifiable knowledge.
  */
-// implements REQ-kibi-bootstrap-knowledge-sources
+// implements REQ-kibi-bootstrap-knowledge-sources, REQ-bootstrap-claim-kinds-and-conflicts
 export function buildIntentClaimCandidates(declared, existingIds, minConfidence) {
     const sources = new Map((declared.knowledgeSources ?? []).map((source) => [source.id, source]));
     const candidates = [];
@@ -35,18 +162,35 @@ export function buildIntentClaimCandidates(declared, existingIds, minConfidence)
             diagnostics.push(`Intent claim cites an undeclared knowledge source "${claim.sourceId}" (${claim.reference}); declare it in knowledgeSources or drop the claim.`);
             continue;
         }
+        const kind = claim.kind ?? "intent";
         if (source.authority === "stale") {
             suppressed.push({
                 candidateId: "",
                 reason: "stale_knowledge_source",
                 sourcePath: claim.reference,
-                entityType: "req",
+                entityType: kind === "intent" ? "req" : "fact",
                 statement: claim.statement,
                 sourceId: source.id,
             });
             continue;
         }
         const confidence = AUTHORITY_CONFIDENCE[source.authority];
+        if (kind !== "intent") {
+            const review = reviewClaimCandidate(source, claim, kind, confidence);
+            const id = String(review.applyPlan[0]?.id ?? "");
+            if (confidence < minConfidence || existingIds.has(id))
+                suppressed.push({
+                    candidateId: review.candidateId,
+                    reason: confidence < minConfidence
+                        ? "below_min_confidence"
+                        : "entity_exists",
+                    sourcePath: claim.reference,
+                    entityType: "fact",
+                });
+            else
+                candidates.push(review);
+            continue;
+        }
         const evidence = citation(source, claim);
         const provenance = `${source.id}:${claim.reference}`;
         let writeSet = null;
@@ -82,6 +226,13 @@ export function buildIntentClaimCandidates(declared, existingIds, minConfidence)
             });
             continue;
         }
+        if (writeSet?.isStrict && confidence < minConfidence)
+            suppressed.push({
+                candidateId: `claim:${source.id}:${writeSet.req.id.toLowerCase()}`,
+                reason: "below_min_confidence",
+                sourcePath: claim.reference,
+                entityType: "req",
+            });
         if (writeSet?.isStrict && existingIds.has(writeSet.req.id)) {
             suppressed.push({
                 candidateId: `claim:${source.id}:${writeSet.req.id.toLowerCase()}`,
@@ -99,5 +250,11 @@ export function buildIntentClaimCandidates(declared, existingIds, minConfidence)
             evidence,
         });
     }
-    return { candidates, sourceOnlySignals, suppressed, diagnostics };
+    const declaredConflicts = conflictCandidates(declared, sources, existingIds, minConfidence);
+    return {
+        candidates: [...candidates, ...declaredConflicts.candidates],
+        sourceOnlySignals,
+        suppressed: [...suppressed, ...declaredConflicts.suppressed],
+        diagnostics: [...diagnostics, ...declaredConflicts.diagnostics],
+    };
 }

package/dist/operations/bootstrap/presentation.d.ts

@@ -1,5 +1,13 @@
 import type { ActivationPolicy, BootstrapContext, BootstrapDeclaredContext, BootstrapPlanV1, Candidate, DiscoverySummary, PlanBootstrapResult, SourceOnlySignal } from "./types.js";
 export declare function normalizeBootstrapContext(input?: BootstrapContext): BootstrapDeclaredContext;
+/**
+ * Suppressions per reason, most frequent first, so a plan with hundreds of
+ * suppressed rows still reads as a handful of lines.
+ */
+export declare function suppressionCounts(rows: readonly Readonly<Record<string, unknown>>[]): readonly {
+    readonly reason: string;
+    readonly count: number;
+}[];
 export declare function presentBootstrap(input: {
     readonly root: string;
     readonly activation: ActivationPolicy;

package/dist/operations/bootstrap/presentation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"presentation.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/presentation.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,gBAAgB,EAEhB,gBAAgB,EAChB,wBAAwB,EAGxB,eAAe,EACf,SAAS,EACT,gBAAgB,EAChB,mBAAmB,EACnB,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAwEpB,wBAAgB,yBAAyB,CACvC,KAAK,CAAC,EAAE,gBAAgB,GACvB,wBAAwB,CAa1B;AAiBD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE;IACtC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,gBAAgB,CAAC;IACtC,QAAQ,CAAC,gBAAgB,EAAE,gBAAgB,CAAC;IAC5C,QAAQ,CAAC,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAC;IACzC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;IAC7C,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,iBAAiB,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACxD,QAAQ,CAAC,oBAAoB,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAC5E,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC;IAC/C,QAAQ,CAAC,kBAAkB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAChD,wEAAwE;IACxE,QAAQ,CAAC,kBAAkB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACjD,GAAG,mBAAmB,CAsLtB"}
+{"version":3,"file":"presentation.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/presentation.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,gBAAgB,EAGhB,gBAAgB,EAChB,wBAAwB,EAGxB,eAAe,EACf,SAAS,EACT,gBAAgB,EAChB,mBAAmB,EACnB,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAuGpB,wBAAgB,yBAAyB,CACvC,KAAK,CAAC,EAAE,gBAAgB,GACvB,wBAAwB,CAe1B;AAgBD;;;GAGG;AAEH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,GACjD,SAAS;IAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,EAAE,CAYhE;AA0CD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE;IACtC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,gBAAgB,CAAC;IACtC,QAAQ,CAAC,gBAAgB,EAAE,gBAAgB,CAAC;IAC5C,QAAQ,CAAC,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAC;IACzC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;IAC7C,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,iBAAiB,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACxD,QAAQ,CAAC,oBAAoB,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAC5E,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC;IAC/C,QAAQ,CAAC,kBAAkB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAChD,wEAAwE;IACxE,QAAQ,CAAC,kBAAkB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACjD,GAAG,mBAAmB,CAmNtB"}