kibi-cli 2.1.0 → 2.3.0

package/dist/operations/modeling/vocabulary-alignment.d.ts

@@ -0,0 +1,60 @@
+import { type SubjectVocabularyEntry } from "kibi-plugin-builtin";
+import { type SubjectCandidate } from "kibi-plugin-sdk";
+import { publicCapabilityStamp } from "../../plugins/compose-semantic-classifier.js";
+import { type VocabularyAlignmentDiagnostic } from "../../plugins/compose-vocabulary-alignment.js";
+import type { OperationContext, PrologPort } from "../../public/operations/runtime-types.js";
+export type SubjectResolution = Readonly<{
+    /** reuse_existing: the plan links the existing subject fact. */
+    decision: "reuse_existing" | "declare_new";
+    subjectKey: string;
+    /** Existing subject fact linked via constrains when reusing. */
+    existingFactId: string | null;
+    confidence: number;
+    candidates: readonly SubjectCandidate[];
+}>;
+export type RedundancyCandidate = Readonly<{
+    factId: string;
+    subjectKey: string;
+    requirementIds: readonly string[];
+    claimText: string;
+    signature: string;
+    confidence: number;
+}>;
+export type VocabularyAlignmentOutcome = Readonly<{
+    subject: SubjectResolution;
+    redundancyCandidates: readonly RedundancyCandidate[];
+    stamps: readonly ReturnType<typeof publicCapabilityStamp>[];
+    fallbackUsed: boolean;
+    diagnostics: readonly VocabularyAlignmentDiagnostic[];
+}>;
+type SubjectClaim = Readonly<{
+    factId: string;
+    subjectKey: string;
+    signature: string;
+    claimText?: string;
+    title?: string;
+    requirements?: readonly string[];
+}>;
+type VocabularyEntryWithFact = SubjectVocabularyEntry & {
+    factId: string;
+    /** Rejected by subject-key-identity; never proposed for reuse. */
+    reqDerived?: boolean;
+};
+export declare function readSubjectVocabulary(prolog: PrologPort): Promise<VocabularyEntryWithFact[]>;
+export declare function readSubjectClaims(prolog: PrologPort, subjectKeys: readonly string[]): Promise<SubjectClaim[]>;
+/**
+ * Rank existing subjects for one modeled clause and look for possible
+ * paraphrase duplicates among claims already on the chosen subject.
+ *
+ * The builtin ranker always runs; a configured kibi.vocabulary-alignment.v1
+ * provider may refine the choice (replace / augment / shadow). The outcome is
+ * modeling advice: exact duplicate detection stays with the deterministic
+ * Prolog `domain-redundancy` check.
+ */
+export declare function alignRequirementVocabulary(context: OperationContext, clause: Readonly<{
+    claimKey: string;
+    statement: string;
+    proposedSubjectKey: string;
+}>): Promise<VocabularyAlignmentOutcome | null>;
+export {};
+//# sourceMappingURL=vocabulary-alignment.d.ts.map

package/dist/operations/modeling/vocabulary-alignment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vocabulary-alignment.d.ts","sourceRoot":"","sources":["../../../src/operations/modeling/vocabulary-alignment.ts"],"names":[],"mappings":"AAmBA,OAAO,EACL,KAAK,sBAAsB,EAE5B,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAGL,KAAK,gBAAgB,EACtB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,qBAAqB,EAAE,MAAM,8CAA8C,CAAC;AACrF,OAAO,EACL,KAAK,6BAA6B,EAGnC,MAAM,+CAA+C,CAAC;AAOvD,OAAO,KAAK,EACV,gBAAgB,EAChB,UAAU,EACX,MAAM,0CAA0C,CAAC;AAMlD,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACvC,gEAAgE;IAChE,QAAQ,EAAE,gBAAgB,GAAG,aAAa,CAAC;IAC3C,UAAU,EAAE,MAAM,CAAC;IACnB,gEAAgE;IAChE,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;CACzC,CAAC,CAAC;AAGH,MAAM,MAAM,mBAAmB,GAAG,QAAQ,CAAC;IACzC,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC,CAAC;AAGH,MAAM,MAAM,0BAA0B,GAAG,QAAQ,CAAC;IAChD,OAAO,EAAE,iBAAiB,CAAC;IAC3B,oBAAoB,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACrD,MAAM,EAAE,SAAS,UAAU,CAAC,OAAO,qBAAqB,CAAC,EAAE,CAAC;IAC5D,YAAY,EAAE,OAAO,CAAC;IACtB,WAAW,EAAE,SAAS,6BAA6B,EAAE,CAAC;CACvD,CAAC,CAAC;AAEH,KAAK,YAAY,GAAG,QAAQ,CAAC;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAClC,CAAC,CAAC;AAEH,KAAK,uBAAuB,GAAG,sBAAsB,GAAG;IACtD,MAAM,EAAE,MAAM,CAAC;IACf,kEAAkE;IAClE,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB,CAAC;AA6BF,wBAAsB,qBAAqB,CACzC,MAAM,EAAE,UAAU,GACjB,OAAO,CAAC,uBAAuB,EAAE,CAAC,CAMpC;AAGD,wBAAsB,iBAAiB,CACrC,MAAM,EAAE,UAAU,EAClB,WAAW,EAAE,SAAS,MAAM,EAAE,GAC7B,OAAO,CAAC,YAAY,EAAE,CAAC,CAQzB;AAwCD;;;;;;;;GAQG;AAEH,wBAAsB,0BAA0B,CAC9C,OAAO,EAAE,gBAAgB,EACzB,MAAM,EAAE,QAAQ,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,kBAAkB,EAAE,MAAM,CAAC;CAC5B,CAAC,GACD,OAAO,CAAC,0BAA0B,GAAG,IAAI,CAAC,CAgG5C"}

package/dist/operations/modeling/vocabulary-alignment.js

@@ -0,0 +1,178 @@
+/*
+ Kibi — repo-local, per-branch, queryable long-term memory for software projects
+ Copyright (C) 2026 Piotr Franczyk
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Affero General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU Affero General Public License for more details.
+
+ You should have received a copy of the GNU Affero General Public License
+ along with this program.  If not, see <https://www.gnu.org/licenses/>.
+*/
+import path from "node:path";
+import { rankSubjectCandidates, } from "kibi-plugin-builtin";
+import { NEW_SUBJECT_CHOICE, } from "kibi-plugin-sdk";
+import { publicCapabilityStamp } from "../../plugins/compose-semantic-classifier.js";
+import { composeClaimComparison, composeSubjectRanking, } from "../../plugins/compose-vocabulary-alignment.js";
+import { createCapabilityRegistry, } from "../../plugins/registry.js";
+import { resolveKbPlPath } from "../../prolog.js";
+import { escapeAtom, toPrologAtom } from "../../prolog/codec.js";
+/** Operation name used for the external-provider allowlist. */
+const OPERATION_NAME = "kb_model_requirement";
+function semanticQualityModulePath() {
+    return path.join(path.dirname(resolveKbPlPath()), "semantic_quality.pl");
+}
+function parseJsonBinding(raw) {
+    if (raw === undefined || raw === "")
+        return [];
+    let parsed = JSON.parse(raw);
+    if (typeof parsed === "string")
+        parsed = JSON.parse(parsed);
+    return parsed;
+}
+async function queryJson(prolog, goal) {
+    const modulePath = escapeAtom(semanticQualityModulePath());
+    // call/1 defers module resolution until use_module has loaded the module;
+    // a literal qualified goal is checked when the query is read.
+    const result = await prolog.query(`(use_module('${modulePath}'), call(${goal}))`);
+    if (!result.success) {
+        throw new Error(`Vocabulary query failed: ${result.error ?? "unknown error"}`);
+    }
+    return parseJsonBinding(result.bindings.Json);
+}
+// implements REQ-kibi-subject-vocabulary
+export async function readSubjectVocabulary(prolog) {
+    const parsed = await queryJson(prolog, "semantic_quality:subject_vocabulary_json(Json)");
+    return Array.isArray(parsed) ? parsed : [];
+}
+// implements REQ-kibi-subject-vocabulary
+export async function readSubjectClaims(prolog, subjectKeys) {
+    if (subjectKeys.length === 0)
+        return [];
+    const list = subjectKeys.map((key) => toPrologAtom(key)).join(",");
+    const parsed = await queryJson(prolog, `semantic_quality:subject_claims_json([${list}], Json)`);
+    return Array.isArray(parsed) ? parsed : [];
+}
+/**
+ * Keep an existing subject whose key equals the proposed key among the
+ * candidates even when it ranks outside the top k, so the plan reuses it
+ * instead of declaring a second subject fact with the same key.
+ */
+function withExactSubject(candidates, vocabulary, proposedSubjectKey) {
+    if (candidates.some((c) => c.subjectKey === proposedSubjectKey)) {
+        return [...candidates];
+    }
+    const exact = vocabulary.find((entry) => entry.subjectKey === proposedSubjectKey);
+    if (exact === undefined)
+        return [...candidates];
+    return [
+        ...candidates,
+        {
+            subjectKey: exact.subjectKey,
+            score: 0,
+            ...(exact.title !== undefined ? { title: exact.title } : {}),
+        },
+    ];
+}
+async function resolveRegistry(context) {
+    if (context.ensurePlugins)
+        return context.ensurePlugins();
+    // Hosts without a plugin runtime get the builtin provider only.
+    return createCapabilityRegistry({
+        workspaceRoot: context.workspaceRoot,
+        projectConfig: {},
+    });
+}
+/**
+ * Rank existing subjects for one modeled clause and look for possible
+ * paraphrase duplicates among claims already on the chosen subject.
+ *
+ * The builtin ranker always runs; a configured kibi.vocabulary-alignment.v1
+ * provider may refine the choice (replace / augment / shadow). The outcome is
+ * modeling advice: exact duplicate detection stays with the deterministic
+ * Prolog `domain-redundancy` check.
+ */
+// implements REQ-kibi-subject-vocabulary, REQ-kibi-vocabulary-alignment-capability
+export async function alignRequirementVocabulary(context, clause) {
+    const prolog = context.prolog;
+    if (!prolog)
+        return null;
+    const vocabulary = (await readSubjectVocabulary(prolog)).filter((entry) => entry.reqDerived !== true);
+    const candidates = withExactSubject(rankSubjectCandidates(clause.statement, vocabulary), vocabulary, clause.proposedSubjectKey);
+    const registry = await resolveRegistry(context);
+    const resolution = await registry.resolveVocabularyAlignment();
+    const ranking = await composeSubjectRanking(resolution, {
+        clauses: [
+            {
+                claimKey: clause.claimKey,
+                text: clause.statement,
+                proposedSubjectKey: clause.proposedSubjectKey,
+                candidates,
+            },
+        ],
+    }, { operationName: OPERATION_NAME });
+    const decision = ranking.results[0];
+    const chosen = decision !== undefined && decision.choice !== NEW_SUBJECT_CHOICE
+        ? vocabulary.find((entry) => entry.subjectKey === decision.choice)
+        : undefined;
+    const subject = chosen
+        ? {
+            decision: "reuse_existing",
+            subjectKey: chosen.subjectKey,
+            existingFactId: chosen.factId,
+            confidence: decision?.confidence ?? 0,
+            candidates,
+        }
+        : {
+            decision: "declare_new",
+            subjectKey: clause.proposedSubjectKey,
+            existingFactId: null,
+            confidence: decision?.confidence ?? 1,
+            candidates,
+        };
+    let redundancyCandidates = [];
+    let comparison = null;
+    if (subject.decision === "reuse_existing") {
+        const claims = await readSubjectClaims(prolog, [subject.subjectKey]);
+        const pairs = claims.map((claim) => ({
+            pairKey: claim.factId,
+            sharedKey: subject.subjectKey,
+            left: { claimText: clause.statement },
+            right: {
+                claimText: claim.claimText || claim.title || claim.factId,
+                signature: claim.signature,
+                factId: claim.factId,
+            },
+        }));
+        comparison = await composeClaimComparison(resolution, { pairs }, { operationName: OPERATION_NAME });
+        const claimsById = new Map(claims.map((claim) => [claim.factId, claim]));
+        redundancyCandidates = comparison.results.flatMap((judgment) => {
+            const claim = claimsById.get(judgment.pairKey);
+            if (!judgment.sameObligation || claim === undefined)
+                return [];
+            return [
+                {
+                    factId: claim.factId,
+                    subjectKey: claim.subjectKey,
+                    requirementIds: claim.requirements ?? [],
+                    claimText: claim.claimText || claim.title || "",
+                    signature: claim.signature,
+                    confidence: judgment.confidence,
+                },
+            ];
+        });
+    }
+    return {
+        subject,
+        redundancyCandidates,
+        stamps: [...ranking.stamps, ...(comparison?.stamps ?? [])].map(publicCapabilityStamp),
+        fallbackUsed: ranking.fallbackUsed || comparison?.fallbackUsed === true,
+        diagnostics: [...ranking.diagnostics, ...(comparison?.diagnostics ?? [])],
+    };
+}

package/dist/operations/mutation/contradictions.d.ts

@@ -6,6 +6,9 @@ type TransactionInput = {
     readonly skipContradictionCheck: boolean;
 };
 export declare function buildUpsertCommitGoal(input: TransactionInput): string;
+/** One transaction and one journal flush for a receipt campaign. */
+export declare function buildUpsertBatchCommitGoal(inputs: readonly TransactionInput[]): string;
+export declare function parseUpsertChangeKinds(bindings: Readonly<Record<string, string>>, count: number): Array<"created" | "updated">;
 export declare function formatUpsertError(entityId: string, raw?: string, record?: PrologErrorRecord): string;
 export {};
 //# sourceMappingURL=contradictions.d.ts.map

package/dist/operations/mutation/contradictions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"contradictions.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/contradictions.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AASrE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAEpD,KAAK,gBAAgB,GAAG;IACtB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IACnD,QAAQ,CAAC,aAAa,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACrD,QAAQ,CAAC,sBAAsB,EAAE,OAAO,CAAC;CAC1C,CAAC;AAGF,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,gBAAgB,GAAG,MAAM,CAOrE;AAGD,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,MAAM,EAChB,GAAG,CAAC,EAAE,MAAM,EACZ,MAAM,CAAC,EAAE,iBAAiB,GACzB,MAAM,CAOR"}
+{"version":3,"file":"contradictions.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/contradictions.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AASrE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAEpD,KAAK,gBAAgB,GAAG;IACtB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IACnD,QAAQ,CAAC,aAAa,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACrD,QAAQ,CAAC,sBAAsB,EAAE,OAAO,CAAC;CAC1C,CAAC;AAGF,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,gBAAgB,GAAG,MAAM,CAOrE;AAWD,oEAAoE;AAEpE,wBAAgB,0BAA0B,CACxC,MAAM,EAAE,SAAS,gBAAgB,EAAE,GAClC,MAAM,CAKR;AAGD,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC1C,KAAK,EAAE,MAAM,GACZ,KAAK,CAAC,SAAS,GAAG,SAAS,CAAC,CAe9B;AAGD,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,MAAM,EAChB,GAAG,CAAC,EAAE,MAAM,EACZ,MAAM,CAAC,EAAE,iBAAiB,GACzB,MAAM,CAOR"}

package/dist/operations/mutation/contradictions.js

@@ -7,6 +7,35 @@ export function buildUpsertCommitGoal(input) {
     const relationships = input.relationships.map((relationship) => `rel(${String(relationship.type)}, '${escapeAtom(String(relationship.from))}', '${escapeAtom(String(relationship.to))}', ${buildRelationshipMetadata(relationship)})`);
     return `kb_commit_upsert(${type}, ${buildPropertyList(input.entity)}, [${relationships.join(", ")}], ${input.skipContradictionCheck ? "true" : "false"}, ChangeKind)`;
 }
+function upsertBatchEntry(input) {
+    const type = String(input.entity.type);
+    const relationships = input.relationships.map((relationship) => `rel(${String(relationship.type)}, '${escapeAtom(String(relationship.from))}', '${escapeAtom(String(relationship.to))}', ${buildRelationshipMetadata(relationship)})`);
+    return `upsert(${type}, ${buildPropertyList(input.entity)}, [${relationships.join(", ")}], ${input.skipContradictionCheck ? "true" : "false"})`;
+}
+/** One transaction and one journal flush for a receipt campaign. */
+// implements REQ-core-atomic-upsert-persistence
+export function buildUpsertBatchCommitGoal(inputs) {
+    const first = inputs[0];
+    if (!first)
+        throw new Error("Upsert batch requires at least one entity");
+    if (inputs.length === 1)
+        return buildUpsertCommitGoal(first);
+    return `kb_commit_upsert_batch([${inputs.map(upsertBatchEntry).join(", ")}], ChangeKinds)`;
+}
+// implements REQ-core-atomic-upsert-persistence
+export function parseUpsertChangeKinds(bindings, count) {
+    const listed = bindings.ChangeKinds;
+    if (typeof listed === "string") {
+        const kinds = [...listed.matchAll(/\b(created|updated)\b/g)].map((match) => match[1]);
+        if (kinds.length === count)
+            return kinds;
+    }
+    const one = bindings.ChangeKind;
+    if ((one === "created" || one === "updated") && count >= 1) {
+        return Array.from({ length: count }, () => one);
+    }
+    throw new Error(`Upsert batch completed without ${count} created/updated result(s)`);
+}
 // implements REQ-kibi-operation-interface-parity
 export function formatUpsertError(entityId, raw, record) {
     const stage = raw?.match(/\(stage=([^)]+)\)/)?.[1];

package/dist/operations/mutation/delete.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"delete.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/delete.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AACjF,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AACxE,OAAO,EACL,KAAK,oBAAoB,EAI1B,MAAM,+BAA+B,CAAC;AAgBvC,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAc7D,wBAAgB,8BAA8B,CAC5C,EAAE,EAAE,gBAAgB,CAAC,IAAI,CAAC,GACzB,OAAO,CAAC,EAAE,IAAI,WAAW,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAMnD;AAuWD,wBAAsB,yBAAyB,CAC7C,SAAS,EAAE,SAAS,oBAAoB,EAAE,EAC1C,OAAO,EAAE,gBAAgB,EACzB,WAAW,GAAE,MAAM,IAAsB,GACxC,OAAO,CAAC,aAAa,CAAC,CA4BxB;AAED,wBAAsB,aAAa,CACjC,KAAK,EAAE,WAAW,EAClB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CA6OzC"}
+{"version":3,"file":"delete.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/delete.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AACjF,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AACxE,OAAO,EACL,KAAK,oBAAoB,EAM1B,MAAM,+BAA+B,CAAC;AAgBvC,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAc7D,wBAAgB,8BAA8B,CAC5C,EAAE,EAAE,gBAAgB,CAAC,IAAI,CAAC,GACzB,OAAO,CAAC,EAAE,IAAI,WAAW,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAMnD;AAuWD,wBAAsB,yBAAyB,CAC7C,SAAS,EAAE,SAAS,oBAAoB,EAAE,EAC1C,OAAO,EAAE,gBAAgB,EACzB,WAAW,GAAE,MAAM,IAAsB,GACxC,OAAO,CAAC,aAAa,CAAC,CA4BxB;AAED,wBAAsB,aAAa,CACjC,KAAK,EAAE,WAAW,EAClB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CA8QzC"}

package/dist/operations/mutation/delete.js

@@ -3,7 +3,7 @@ import { existsSync, readFileSync, writeFileSync } from "node:fs";
 import path from "node:path";
 import { InputError, OperationError } from "../../cli-errors.js";
 import { parseEntityFromList, parseListOfLists, toPrologAtom, } from "../../prolog/codec.js";
-import { listShards, readAllShards, removeRelationshipsFromShards, } from "../../relationships/shards.js";
+import { listShards, readAllShards, readShard, removeRelationshipsFromShards, renderShardWithout, } from "../../relationships/shards.js";
 import { resolveBranchAttachment } from "../../utils/branch-resolver.js";
 import { buildEntityDeleteAuditGoal } from "./audit.js";
 import { RELATIONSHIP_TYPES, dependentRelationshipsGoal, } from "./relationships.js";
@@ -447,6 +447,36 @@ export async function executeDelete(input, context) {
             goals.push(buildEntityDeleteAuditGoal(entity));
         }
         if (authoredIds.length > 0 && context.sourcePlanApplication !== true) {
+            if (context.fs) {
+                // A deleted entity's outgoing relationships live in canonical shards,
+                // not in its own document. Incoming edges already block deletion, so
+                // the plan removes the outgoing rows too; otherwise the compiled
+                // store drops them while the shards keep them.
+                const deleted = new Set(authoredIds);
+                for (const shardPath of listShards(path.join(context.workspaceRoot, ".kb"))) {
+                    const selectors = readShard(shardPath)
+                        .filter((record) => deleted.has(record.from))
+                        .map(({ type, from, to }) => ({ type, from, to }));
+                    if (selectors.length === 0)
+                        continue;
+                    const relativeShard = path
+                        .relative(context.workspaceRoot, shardPath)
+                        .replaceAll("\\", "/");
+                    const original = readFileSync(shardPath, "utf8");
+                    const body = renderShardWithout(original, selectors, shardPath);
+                    const beforeHash = createHash("sha256")
+                        .update(original)
+                        .digest("hex");
+                    sourceHashes[relativeShard] = beforeHash;
+                    sourcePlansByPath.set(relativeShard, {
+                        path: relativeShard,
+                        mode: "write",
+                        beforeHash,
+                        afterHash: createHash("sha256").update(body).digest("hex"),
+                        body,
+                    });
+                }
+            }
             const supersessionRequired = authoredRequirementIds.length > 0;
             const sourcePlans = [...sourcePlansByPath.values()];
             const planBody = {
@@ -468,6 +498,8 @@ export async function executeDelete(input, context) {
                         : "Authored entity deletion returns a hash-bound plan for kb_apply_plan.",
                 ],
                 deletionPlan: { ...planBody, planHash },
+                // Only kb_apply_plan writes; this call returns the plan.
+                skippedEffects: ["kb-write", "workspace-write"],
             };
             return {
                 content: [

package/dist/operations/mutation/predicate-vocabulary-guard.d.ts

@@ -0,0 +1,8 @@
+import type { PrologPort } from "../../public/operations/runtime-types.js";
+/**
+ * Reject a predicate fact whose arguments fall outside the constants its
+ * project-local schema declares. An alias is rejected too, with the declared
+ * constant to use instead, so new facts never need migrating.
+ */
+export declare function assertPredicateArgumentVocabulary(prolog: Pick<PrologPort, "query">, entity: Readonly<Record<string, unknown>>): Promise<void>;
+//# sourceMappingURL=predicate-vocabulary-guard.d.ts.map

package/dist/operations/mutation/predicate-vocabulary-guard.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"predicate-vocabulary-guard.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/predicate-vocabulary-guard.ts"],"names":[],"mappings":"AAuBA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AAY3E;;;;GAIG;AAEH,wBAAsB,iCAAiC,CACrD,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,EACjC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GACxC,OAAO,CAAC,IAAI,CAAC,CA+Cf"}

package/dist/operations/mutation/predicate-vocabulary-guard.js

@@ -0,0 +1,64 @@
+/*
+ Kibi — repo-local, per-branch, queryable long-term memory for software projects
+ Copyright (C) 2026 Piotr Franczyk
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Affero General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU Affero General Public License for more details.
+
+ You should have received a copy of the GNU Affero General Public License
+ along with this program.  If not, see <https://www.gnu.org/licenses/>.
+*/
+import { parseEntityFromList, parseListOfLists, toPrologAtom, } from "../../prolog/codec.js";
+import { predicateArgumentConformance, predicateVocabularyFromEntity, } from "../modeling/predicate-vocabulary.js";
+function text(value) {
+    return typeof value === "string" && value.trim() !== ""
+        ? value.trim()
+        : undefined;
+}
+/**
+ * Reject a predicate fact whose arguments fall outside the constants its
+ * project-local schema declares. An alias is rejected too, with the declared
+ * constant to use instead, so new facts never need migrating.
+ */
+// implements REQ-kibi-predicate-argument-constants
+export async function assertPredicateArgumentVocabulary(prolog, entity) {
+    if (entity.type !== "fact" || entity.fact_kind !== "predicate")
+        return;
+    const name = text(entity.predicate_name);
+    const args = Array.isArray(entity.predicate_args)
+        ? entity.predicate_args.filter((value) => typeof value === "string")
+        : [];
+    if (name === undefined || args.length === 0)
+        return;
+    const namespace = text(entity.predicate_namespace) ?? "default";
+    const result = await prolog.query(`findall([Id,'fact',Props], (kb:predicate_schema(Id, Namespace, Name, Arity, _Names, _Types), Name == ${toPrologAtom(name)}, Namespace == ${toPrologAtom(namespace)}, Arity =:= ${args.length}, kb_entity(Id, 'fact', Props)), Results)`);
+    if (!result.success) {
+        throw new Error(`Predicate schema lookup failed: ${result.error ?? "unknown error"}`);
+    }
+    const schemas = result.bindings.Results
+        ? parseListOfLists(result.bindings.Results).map(parseEntityFromList)
+        : [];
+    const problems = [];
+    for (const schema of schemas) {
+        const argumentNames = Array.isArray(schema.argument_names)
+            ? schema.argument_names.map(String)
+            : [];
+        const conformance = predicateArgumentConformance(argumentNames, args, predicateVocabularyFromEntity(schema));
+        for (const rewrite of conformance.rewrites) {
+            problems.push(`argument ${rewrite.argumentName} uses alias ${rewrite.from}; use the declared constant ${rewrite.to} (${String(schema.id)})`);
+        }
+        for (const value of conformance.undeclared) {
+            problems.push(`argument ${value.argumentName} value ${value.value} is not declared by ${String(schema.id)}; allowed: ${value.allowed.join(", ")}`);
+        }
+    }
+    if (problems.length > 0) {
+        throw new Error(`Entity validation failed: ${problems.join("; ")}. Use a declared constant, or extend the schema's argument_constants when the value is genuinely new.`);
+    }
+}

package/dist/operations/mutation/relationships.d.ts

@@ -1,6 +1,6 @@
 import type { PrologPort } from "../../public/operations/runtime-types.js";
 import type { RelationshipInput } from "./types.js";
-export declare const RELATIONSHIP_TYPES: readonly ["depends_on", "specified_by", "verified_by", "validates", "implements", "covered_by", "executable_for", "constrained_by", "constrains", "requires_property", "requires_predicate", "requires_rule", "guards", "publishes", "consumes", "supersedes", "relates_to"];
+export declare const RELATIONSHIP_TYPES: readonly ["depends_on", "specified_by", "verified_by", "validates", "implements", "covered_by", "executable_for", "constrained_by", "constrains", "requires_property", "requires_predicate", "requires_rule", "guards", "publishes", "consumes", "supersedes", "restates", "relates_to"];
 export type RelationshipType = (typeof RELATIONSHIP_TYPES)[number];
 export declare function wrongKindRelationshipError(type: string, target: string, wrongKind: string): Error;
 export declare function dependentRelationshipsGoal(entityId: string): string;

package/dist/operations/mutation/relationships.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"relationships.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/relationships.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AAE3E,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAEpD,eAAO,MAAM,kBAAkB,8QAkBrB,CAAC;AACX,MAAM,MAAM,gBAAgB,GAAG,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEnE,wBAAgB,0BAA0B,CACxC,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,GAChB,KAAK,CAKP;AAED,wBAAgB,0BAA0B,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAEnE;AAED,KAAK,iBAAiB,GAAG;IACvB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB,CAAC;AAgCF,wBAAgB,8BAA8B,CAC5C,KAAK,EAAE,iBAAiB,GACvB,MAAM,CAER;AAED,wBAAgB,8BAA8B,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAczE;AAED,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,MAAM,EAChB,aAAa,EAAE,SAAS,iBAAiB,EAAE,GAC1C,IAAI,CAMN;AAED,KAAK,iBAAiB,GAAG,OAAO,GAAG,UAAU,GAAG,SAAS,CAAC;AAE1D,KAAK,qBAAqB,GAAG,QAAQ,CAAC;IACpC,mBAAmB,EAAE,CAAC,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC;IAC9E,UAAU,EAAE,CACV,aAAa,EAAE,MAAM,EACrB,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,MAAM,KACf,OAAO,GAAG,IAAI,CAAC;CACrB,CAAC,CAAC;AAMH,wBAAgB,sBAAsB,CACpC,aAAa,EAAE,MAAM,EACrB,MAAM,EAAE,MAAM,GACb,MAAM,GAAG,IAAI,CAef;AAsBD,wBAAgB,yBAAyB,CACvC,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GAAG,IAAI,EAC3B,YAAY,EAAE,MAAM,GAAG,IAAI,EAC3B,IAAI,GAAE,IAAI,CACR,qBAAqB,EACrB,YAAY,CACqB,GAClC,iBAAiB,CAenB;AAGD,wBAAsB,+BAA+B,CACnD,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EACzC,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,aAAa,EAAE,MAAM,EACrB,IAAI,GAAE,qBAAuD,GAC5D,OAAO,CAAC,IAAI,CAAC,CAyCf;AAED,wBAAgB,gCAAgC,CAC9C,QAAQ,EAAE,MAAM,EAChB,YAAY,EAAE,iBAAiB,GAC9B,MAAM,CAIR;AAuBD,wBAAsB,+BAA+B,CACnD,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EACzC,aAAa,EAAE,SAAS,iBAAiB,EAAE,GAC1C,OAAO,CAAC,IAAI,CAAC,CAuBf;AAED,wBAAsB,yBAAyB,CAC7C,MAAM,EAAE,UAAU,EAClB,aAAa,EAAE,SAAS,iBAAiB,EAAE,GAC1C,OAAO,CAAC,IAAI,CAAC,CA+Bf;AAED,wBAAsB,qBAAqB,CACzC,MAAM,EAAE,UAAU,EAClB,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,SAAS,iBAAiB,EAAE,CAAC,CAevC"}
+{"version":3,"file":"relationships.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/relationships.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AAE3E,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAEpD,eAAO,MAAM,kBAAkB,0RAmBrB,CAAC;AACX,MAAM,MAAM,gBAAgB,GAAG,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEnE,wBAAgB,0BAA0B,CACxC,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,GAChB,KAAK,CAKP;AAED,wBAAgB,0BAA0B,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAEnE;AAED,KAAK,iBAAiB,GAAG;IACvB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB,CAAC;AAgCF,wBAAgB,8BAA8B,CAC5C,KAAK,EAAE,iBAAiB,GACvB,MAAM,CAER;AAED,wBAAgB,8BAA8B,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAczE;AAED,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,MAAM,EAChB,aAAa,EAAE,SAAS,iBAAiB,EAAE,GAC1C,IAAI,CAMN;AAED,KAAK,iBAAiB,GAAG,OAAO,GAAG,UAAU,GAAG,SAAS,CAAC;AAE1D,KAAK,qBAAqB,GAAG,QAAQ,CAAC;IACpC,mBAAmB,EAAE,CAAC,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC;IAC9E,UAAU,EAAE,CACV,aAAa,EAAE,MAAM,EACrB,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,MAAM,KACf,OAAO,GAAG,IAAI,CAAC;CACrB,CAAC,CAAC;AAMH,wBAAgB,sBAAsB,CACpC,aAAa,EAAE,MAAM,EACrB,MAAM,EAAE,MAAM,GACb,MAAM,GAAG,IAAI,CAef;AAsBD,wBAAgB,yBAAyB,CACvC,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GAAG,IAAI,EAC3B,YAAY,EAAE,MAAM,GAAG,IAAI,EAC3B,IAAI,GAAE,IAAI,CACR,qBAAqB,EACrB,YAAY,CACqB,GAClC,iBAAiB,CAenB;AAGD,wBAAsB,+BAA+B,CACnD,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EACzC,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,aAAa,EAAE,MAAM,EACrB,IAAI,GAAE,qBAAuD,GAC5D,OAAO,CAAC,IAAI,CAAC,CAyCf;AAED,wBAAgB,gCAAgC,CAC9C,QAAQ,EAAE,MAAM,EAChB,YAAY,EAAE,iBAAiB,GAC9B,MAAM,CAIR;AAuBD,wBAAsB,+BAA+B,CACnD,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EACzC,aAAa,EAAE,SAAS,iBAAiB,EAAE,GAC1C,OAAO,CAAC,IAAI,CAAC,CAuBf;AAED,wBAAsB,yBAAyB,CAC7C,MAAM,EAAE,UAAU,EAClB,aAAa,EAAE,SAAS,iBAAiB,EAAE,GAC1C,OAAO,CAAC,IAAI,CAAC,CA+Bf;AAED,wBAAsB,qBAAqB,CACzC,MAAM,EAAE,UAAU,EAClB,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,SAAS,iBAAiB,EAAE,CAAC,CAevC"}

package/dist/operations/mutation/relationships.js

@@ -18,6 +18,7 @@ export const RELATIONSHIP_TYPES = [
     "publishes",
     "consumes",
     "supersedes",
+    "restates",
     "relates_to",
 ];
 export function wrongKindRelationshipError(type, target, wrongKind) {

package/dist/operations/mutation/saga.d.ts

@@ -28,6 +28,11 @@ export type SagaRollbackFailure = Readonly<{
     step: string;
     error: unknown;
 }>;
+/** A mutation failed before commit and at least one compensation also failed. */
+export declare class MutationRollbackFailureError extends AggregateError {
+    readonly rollbackFailures: readonly SagaRollbackFailure[];
+    constructor(errors: readonly unknown[], message: string, rollbackFailures: readonly SagaRollbackFailure[]);
+}
 export declare class MutationSaga {
     private readonly steps;
     private rollbackCompleted;

package/dist/operations/mutation/saga.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"saga.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/saga.ts"],"names":[],"mappings":"AAkBA;;;;;;;;;GASG;AAGH,MAAM,MAAM,QAAQ,GAAG,QAAQ,CAAC;IAC9B,sDAAsD;IACtD,IAAI,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,QAAQ,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACrC;;;;OAIG;IACH,OAAO,CAAC,EAAE,SAAS,GAAG,SAAS,CAAC;CACjC,CAAC,CAAC;AAGH,MAAM,MAAM,mBAAmB,GAAG,QAAQ,CAAC;IACzC,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,OAAO,CAAC;CAChB,CAAC,CAAC;AAGH,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAkB;IACxC,OAAO,CAAC,iBAAiB,CAAS;IAClC,OAAO,CAAC,WAAW,CAAuB;IAE1C,2EAA2E;IAE3E,GAAG,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI;IAIzB;;;;OAIG;IAEH,aAAa,IAAI,IAAI;IAKrB,IAAI,SAAS,IAAI,OAAO,CAEvB;IAED;;;;OAIG;IAEG,QAAQ,IAAI,OAAO,CAAC,SAAS,mBAAmB,EAAE,CAAC;CAkB1D"}
+{"version":3,"file":"saga.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/saga.ts"],"names":[],"mappings":"AAkBA;;;;;;;;;GASG;AAGH,MAAM,MAAM,QAAQ,GAAG,QAAQ,CAAC;IAC9B,sDAAsD;IACtD,IAAI,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,QAAQ,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACrC;;;;OAIG;IACH,OAAO,CAAC,EAAE,SAAS,GAAG,SAAS,CAAC;CACjC,CAAC,CAAC;AAGH,MAAM,MAAM,mBAAmB,GAAG,QAAQ,CAAC;IACzC,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,OAAO,CAAC;CAChB,CAAC,CAAC;AAEH,iFAAiF;AAEjF,qBAAa,4BAA6B,SAAQ,cAAc;IAI5D,QAAQ,CAAC,gBAAgB,EAAE,SAAS,mBAAmB,EAAE;gBAFzD,MAAM,EAAE,SAAS,OAAO,EAAE,EAC1B,OAAO,EAAE,MAAM,EACN,gBAAgB,EAAE,SAAS,mBAAmB,EAAE;CAK5D;AAGD,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAkB;IACxC,OAAO,CAAC,iBAAiB,CAAS;IAClC,OAAO,CAAC,WAAW,CAAuB;IAE1C,2EAA2E;IAE3E,GAAG,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI;IAIzB;;;;OAIG;IAEH,aAAa,IAAI,IAAI;IAKrB,IAAI,SAAS,IAAI,OAAO,CAEvB;IAED;;;;OAIG;IAEG,QAAQ,IAAI,OAAO,CAAC,SAAS,mBAAmB,EAAE,CAAC;CAkB1D"}

package/dist/operations/mutation/saga.js

@@ -15,6 +15,16 @@
  You should have received a copy of the GNU Affero General Public License
  along with this program.  If not, see <https://www.gnu.org/licenses/>.
  */
+/** A mutation failed before commit and at least one compensation also failed. */
+// implements REQ-014
+export class MutationRollbackFailureError extends AggregateError {
+    rollbackFailures;
+    constructor(errors, message, rollbackFailures) {
+        super(errors, message);
+        this.rollbackFailures = rollbackFailures;
+        this.name = "MutationRollbackFailureError";
+    }
+}
 // implements REQ-014
 export class MutationSaga {
     steps = [];

package/dist/operations/mutation/serialization.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"serialization.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/serialization.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAoDpD,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GACxC,MAAM,CAMR;AAGD,wBAAgB,yBAAyB,CAAC,GAAG,EAAE,iBAAiB,GAAG,MAAM,CAOxE;AAGD,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAkBtD"}
+{"version":3,"file":"serialization.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/serialization.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAsDpD,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GACxC,MAAM,CAMR;AAGD,wBAAgB,yBAAyB,CAAC,GAAG,EAAE,iBAAiB,GAAG,MAAM,CAOxE;AAGD,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAkBtD"}

package/dist/operations/mutation/serialization.js

@@ -27,6 +27,8 @@ function serializeValue(key, value) {
         return `'${value.replaceAll("'", "''")}'`;
     }
     if (key === "rule_ir" ||
+        key === "argument_constants" ||
+        key === "argument_aliases" ||
         key === "semantic_inventory" ||
         key === "proof_contract" ||
         key === "proof_bindings" ||

package/dist/operations/mutation/source-authoring.d.ts

@@ -8,6 +8,12 @@ export type SourceWriteReceipt = Readonly<{
     created: boolean;
 }>;
 export declare function writePendingSourceReceipt(workspaceRoot: string, relativePath: string, afterHash: string): void;
+/**
+ * Retire the pending receipt of a source that a committed plan deleted. A
+ * receipt binds untracked input to exact bytes, so one left behind for a
+ * removed file makes every later sync fail on a missing pending source.
+ */
+export declare function retirePendingSourceReceipt(workspaceRoot: string, relativePath: string): void;
 export declare function resolveContainedSourcePath(workspaceRoot: string, relative: string): string;
 export declare function normalizeAuthoredSourcePath(workspaceRoot: string, source: string): string;
 /**

package/dist/operations/mutation/source-authoring.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"source-authoring.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/source-authoring.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAKjF,OAAO,KAAK,EAAqB,WAAW,EAAE,MAAM,YAAY,CAAC;AAEjE,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;IACxC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,GAAG,QAAQ,CAAC;IACzB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC,CAAC;AAmBH,wBAAgB,yBAAyB,CACvC,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,GAChB,IAAI,CAiBN;AAUD,wBAAgB,0BAA0B,CACxC,aAAa,EAAE,MAAM,EACrB,QAAQ,EAAE,MAAM,GACf,MAAM,CAwCR;AAED,wBAAgB,2BAA2B,CACzC,aAAa,EAAE,MAAM,EACrB,MAAM,EAAE,MAAM,GACb,MAAM,CAWR;AAsBD;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE,MAAM,GACX,MAAM,GAAG,SAAS,CAYpB;AAED,wBAAgB,yBAAyB,CACvC,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE,MAAM,GACX,OAAO,CAET;AAwFD,uFAAuF;AAEvF,eAAO,MAAM,uBAAuB,uGAM1B,CAAC;AA8BX,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,OAAO,GACZ,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAiCzC;AAiGD,wBAAgB,oBAAoB,CAClC,eAAe,EAAE,MAAM,EACvB,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,MAAM,EAClB,eAAe,EAAE,MAAM,GACtB;IAAE,IAAI,EAAE,OAAO,GAAG,QAAQ,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CA+C7C;AAED;;;;;;;GAOG;AACH,wBAAgB,kCAAkC,CAChD,eAAe,EAAE,MAAM,EACvB,eAAe,EAAE,MAAM,EACvB,QAAQ,EAAE,QAAQ,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,GAC7D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CA4DpC;AAED;;;;GAIG;AACH,wBAAgB,8BAA8B,CAC5C,eAAe,EAAE,MAAM,EACvB,eAAe,EAAE,MAAM,EACvB,QAAQ,EAAE,QAAQ,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,GAC7D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CAiEpC;AA+BD,wBAAsB,oBAAoB,CACxC,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EACzC,QAAQ,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAC5C,OAAO,CAAC,EAAE,gBAAgB,EAC1B,sBAAsB,CAAC,EAAE,MAAM,GAC9B,OAAO,CAAC;IACT,OAAO,EAAE,kBAAkB,CAAC;IAC5B,QAAQ,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;CAC/B,GAAG,IAAI,CAAC,CAoHR;AAED,uEAAuE;AACvE,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,gBAAgB,EACzB,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EACzC,QAAQ,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GAC3C,MAAM,CAOR"}
+{"version":3,"file":"source-authoring.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/source-authoring.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAMjF,OAAO,KAAK,EAAqB,WAAW,EAAE,MAAM,YAAY,CAAC;AAEjE,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;IACxC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,GAAG,QAAQ,CAAC;IACzB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC,CAAC;AAmBH,wBAAgB,yBAAyB,CACvC,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,GAChB,IAAI,CAiBN;AAED;;;;GAIG;AAEH,wBAAgB,0BAA0B,CACxC,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GACnB,IAAI,CAMN;AAgBD,wBAAgB,0BAA0B,CACxC,aAAa,EAAE,MAAM,EACrB,QAAQ,EAAE,MAAM,GACf,MAAM,CAqCR;AAED,wBAAgB,2BAA2B,CACzC,aAAa,EAAE,MAAM,EACrB,MAAM,EAAE,MAAM,GACb,MAAM,CAoBR;AAsBD;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE,MAAM,GACX,MAAM,GAAG,SAAS,CAYpB;AAED,wBAAgB,yBAAyB,CACvC,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE,MAAM,GACX,OAAO,CAET;AAwFD,uFAAuF;AAEvF,eAAO,MAAM,uBAAuB,uGAM1B,CAAC;AA8BX,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,OAAO,GACZ,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAiCzC;AAoRD,wBAAgB,oBAAoB,CAClC,eAAe,EAAE,MAAM,EACvB,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,MAAM,EAClB,eAAe,EAAE,MAAM,GACtB;IAAE,IAAI,EAAE,OAAO,GAAG,QAAQ,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CA6C7C;AAED;;;;;;;GAOG;AACH,wBAAgB,kCAAkC,CAChD,eAAe,EAAE,MAAM,EACvB,eAAe,EAAE,MAAM,EACvB,QAAQ,EAAE,QAAQ,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,GAC7D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CA4DpC;AAED;;;;GAIG;AACH,wBAAgB,8BAA8B,CAC5C,eAAe,EAAE,MAAM,EACvB,eAAe,EAAE,MAAM,EACvB,QAAQ,EAAE,QAAQ,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,GAC7D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CAiEpC;AA+BD,wBAAsB,oBAAoB,CACxC,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EACzC,QAAQ,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAC5C,OAAO,CAAC,EAAE,gBAAgB,EAC1B,sBAAsB,CAAC,EAAE,MAAM,GAC9B,OAAO,CAAC;IACT,OAAO,EAAE,kBAAkB,CAAC;IAC5B,QAAQ,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;CAC/B,GAAG,IAAI,CAAC,CAoHR;AAED,uEAAuE;AACvE,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,gBAAgB,EACzB,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EACzC,QAAQ,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GAC3C,MAAM,CAOR"}