@principles/core 1.287.7 → 1.287.8

package/dist/runtime-v2/principle-reuse/reuse-proposal.d.ts

@@ -0,0 +1,87 @@
+/**
+ * PRI-917 Slice 2 — reuse proposal + decision contract (internal).
+ *
+ * This slice delivers the FLOW only: given a candidate, produce a bounded
+ * proposal of existing Principles that may already cover it, and let an
+ * injected decision function answer `reuse` or `create`.
+ *
+ * Deliberately NOT in this slice (SPEC v0.2 / task scope):
+ * - persistence of the decision or the relation (`reuseEvidence[]` is Slice 3)
+ * - any Console page, new approval subsystem, or automated decision model
+ * - any change to `derivedFromPainIds`, the ledger schema, or candidate status
+ *
+ * @see docs/specs/PRI-917-reuse-before-create-v0.1.md (SPEC v0.2)
+ */
+import type { ReuseShortlist } from './reuse-domain.js';
+import type { ReuseEvidenceActor } from '../types/principle-schema.js';
+/**
+ * `pending` — credible existing Principles were found and an Owner decision is
+ * required before anything is written.
+ * `no_candidates` — nothing credible was found; the caller proceeds to create.
+ */
+export type ReuseProposalStatus = 'pending' | 'no_candidates';
+export interface ReuseProposalEntry {
+    /** Canonical Principle Ledger UUID. */
+    principleId: string;
+    score: number;
+    /** Human-readable reasons, one per evidence field. */
+    reasons: string[];
+}
+export interface ReuseProposal {
+    candidateId: string;
+    status: ReuseProposalStatus;
+    candidates: ReuseProposalEntry[];
+    /** Principles that passed status eligibility. */
+    eligibleCount: number;
+}
+/**
+ * The Owner's answer. There is no automatic option.
+ *
+ * A `reuse` verdict carries the SPEC §11 decision-exchange fields (`actor`,
+ * `reason`, `decidedAt`) because PRI-917 PR3B materialises the verdict into
+ * `Principle.reuseEvidence[]` verbatim (SPEC §12): the durable evidence must
+ * record WHO decided, WHY, and WHEN — an answer without them cannot be
+ * persisted as a reuse resolution, so the validator rejects it fail-closed.
+ */
+export type ReuseDecision = {
+    decision: 'create';
+} | {
+    decision: 'reuse';
+    selectedPrincipleId: string;
+    actor: ReuseEvidenceActor;
+    reason: string;
+    decidedAt: string;
+};
+/**
+ * Converts a deterministic shortlist into the proposal contract.
+ *
+ * The shortlist already guarantees determinism and a bounded Top-K, so this is
+ * a pure projection: it adds no ranking of its own and never widens the set.
+ */
+export declare function buildReuseProposal(candidateId: string, shortlist: ReuseShortlist): ReuseProposal;
+/** True when the proposal needs an Owner answer before writing. */
+export declare function proposalNeedsDecision(proposal: ReuseProposal): boolean;
+export type ReuseDecisionValidation = {
+    ok: true;
+    decision: ReuseDecision;
+} | {
+    ok: false;
+    reason: string;
+};
+/**
+ * Runtime validator for the reuse decision (rc-1/rc-2/rc-3).
+ *
+ * The decision function is an untrusted boundary — an AI Owner parses model
+ * output into it — so its TypeScript type cannot be the guard. A bare
+ * `"create"` string, `{}`, `{decision:'REUSE'}`, a non-string principle id, or
+ * a missing id for reuse are ALL rejected here, because the alternative is
+ * silently reading a malformed answer as "go ahead and create" — the exact
+ * duplicate manufacturing this gate exists to prevent.
+ *
+ * PRI-917 PR3B Phase 2: a `reuse` verdict must additionally carry the
+ * SPEC §11 accountability fields (`actor` / `reason` / `decidedAt`) — they are
+ * materialised verbatim into `Principle.reuseEvidence[]`, and an answer
+ * without them cannot produce a self-contained, auditable evidence entry.
+ */
+export declare function validateReuseDecision(raw: unknown): ReuseDecisionValidation;
+//# sourceMappingURL=reuse-proposal.d.ts.map

package/dist/runtime-v2/principle-reuse/reuse-proposal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reuse-proposal.d.ts","sourceRoot":"","sources":["../../../src/runtime-v2/principle-reuse/reuse-proposal.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAkB,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACxE,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAEvE;;;;GAIG;AACH,MAAM,MAAM,mBAAmB,GAAG,SAAS,GAAG,eAAe,CAAC;AAE9D,MAAM,WAAW,kBAAkB;IACjC,uCAAuC;IACvC,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,sDAAsD;IACtD,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,MAAM,WAAW,aAAa;IAC5B,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,mBAAmB,CAAC;IAC5B,UAAU,EAAE,kBAAkB,EAAE,CAAC;IACjC,iDAAiD;IACjD,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;;GAQG;AACH,MAAM,MAAM,aAAa,GACrB;IAAE,QAAQ,EAAE,QAAQ,CAAA;CAAE,GACtB;IACE,QAAQ,EAAE,OAAO,CAAC;IAClB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,KAAK,EAAE,kBAAkB,CAAC;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAEN;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,cAAc,GACxB,aAAa,CAef;AAED,mEAAmE;AACnE,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,aAAa,GAAG,OAAO,CAEtE;AAED,MAAM,MAAM,uBAAuB,GAC/B;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,QAAQ,EAAE,aAAa,CAAA;CAAE,GACrC;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAElC;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,OAAO,GAAG,uBAAuB,CAwC3E"}

package/dist/runtime-v2/principle-reuse/reuse-proposal.js

@@ -0,0 +1,99 @@
+/**
+ * PRI-917 Slice 2 — reuse proposal + decision contract (internal).
+ *
+ * This slice delivers the FLOW only: given a candidate, produce a bounded
+ * proposal of existing Principles that may already cover it, and let an
+ * injected decision function answer `reuse` or `create`.
+ *
+ * Deliberately NOT in this slice (SPEC v0.2 / task scope):
+ * - persistence of the decision or the relation (`reuseEvidence[]` is Slice 3)
+ * - any Console page, new approval subsystem, or automated decision model
+ * - any change to `derivedFromPainIds`, the ledger schema, or candidate status
+ *
+ * @see docs/specs/PRI-917-reuse-before-create-v0.1.md (SPEC v0.2)
+ */
+/**
+ * Converts a deterministic shortlist into the proposal contract.
+ *
+ * The shortlist already guarantees determinism and a bounded Top-K, so this is
+ * a pure projection: it adds no ranking of its own and never widens the set.
+ */
+export function buildReuseProposal(candidateId, shortlist) {
+    const candidates = shortlist.candidates.map((entry) => ({
+        principleId: entry.principleId,
+        score: entry.score,
+        reasons: [
+            entry.similarityReason,
+            ...entry.evidence.map((e) => `${e.field}: ${e.sharedTerms.slice(0, 5).join('、')}`),
+        ],
+    }));
+    return {
+        candidateId,
+        status: candidates.length > 0 ? 'pending' : 'no_candidates',
+        candidates,
+        eligibleCount: shortlist.eligibleCount,
+    };
+}
+/** True when the proposal needs an Owner answer before writing. */
+export function proposalNeedsDecision(proposal) {
+    return proposal.status === 'pending';
+}
+/**
+ * Runtime validator for the reuse decision (rc-1/rc-2/rc-3).
+ *
+ * The decision function is an untrusted boundary — an AI Owner parses model
+ * output into it — so its TypeScript type cannot be the guard. A bare
+ * `"create"` string, `{}`, `{decision:'REUSE'}`, a non-string principle id, or
+ * a missing id for reuse are ALL rejected here, because the alternative is
+ * silently reading a malformed answer as "go ahead and create" — the exact
+ * duplicate manufacturing this gate exists to prevent.
+ *
+ * PRI-917 PR3B Phase 2: a `reuse` verdict must additionally carry the
+ * SPEC §11 accountability fields (`actor` / `reason` / `decidedAt`) — they are
+ * materialised verbatim into `Principle.reuseEvidence[]`, and an answer
+ * without them cannot produce a self-contained, auditable evidence entry.
+ */
+export function validateReuseDecision(raw) {
+    if (raw === null || raw === undefined)
+        return { ok: false, reason: 'decision_is_nullish' };
+    if (typeof raw !== 'object' || Array.isArray(raw))
+        return { ok: false, reason: 'decision_is_not_an_object' };
+    const record = raw;
+    const { decision } = record;
+    if (decision === 'create')
+        return { ok: true, decision: { decision: 'create' } };
+    if (decision !== 'reuse')
+        return { ok: false, reason: `unknown_decision_value:${String(decision)}` };
+    const selected = record.selectedPrincipleId;
+    if (typeof selected !== 'string' || selected.length === 0) {
+        return { ok: false, reason: 'reuse_without_principle_id' };
+    }
+    const actorRaw = record.actor;
+    if (typeof actorRaw !== 'object' || actorRaw === null || Array.isArray(actorRaw)) {
+        return { ok: false, reason: 'reuse_actor_invalid' };
+    }
+    const actorRecord = actorRaw;
+    if (!(actorRecord.kind === 'owner' || actorRecord.kind === 'ai_owner')
+        || typeof actorRecord.id !== 'string'
+        || actorRecord.id.length === 0) {
+        return { ok: false, reason: 'reuse_actor_invalid' };
+    }
+    const { reason, decidedAt } = record;
+    if (typeof reason !== 'string' || reason.length === 0) {
+        return { ok: false, reason: 'reuse_reason_missing' };
+    }
+    if (typeof decidedAt !== 'string' || decidedAt.length === 0 || Number.isNaN(Date.parse(decidedAt))) {
+        return { ok: false, reason: 'reuse_decidedAt_invalid' };
+    }
+    return {
+        ok: true,
+        decision: {
+            decision: 'reuse',
+            selectedPrincipleId: selected,
+            actor: { kind: actorRecord.kind, id: actorRecord.id },
+            reason,
+            decidedAt,
+        },
+    };
+}
+//# sourceMappingURL=reuse-proposal.js.map

package/dist/runtime-v2/principle-reuse/reuse-proposal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reuse-proposal.js","sourceRoot":"","sources":["../../../src/runtime-v2/principle-reuse/reuse-proposal.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AA+CH;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAChC,WAAmB,EACnB,SAAyB;IAEzB,MAAM,UAAU,GAAyB,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,KAAqB,EAAE,EAAE,CAAC,CAAC;QAC5F,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,OAAO,EAAE;YACP,KAAK,CAAC,gBAAgB;YACtB,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;SACnF;KACF,CAAC,CAAC,CAAC;IACJ,OAAO;QACL,WAAW;QACX,MAAM,EAAE,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe;QAC3D,UAAU;QACV,aAAa,EAAE,SAAS,CAAC,aAAa;KACvC,CAAC;AACJ,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,qBAAqB,CAAC,QAAuB;IAC3D,OAAO,QAAQ,CAAC,MAAM,KAAK,SAAS,CAAC;AACvC,CAAC;AAMD;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,qBAAqB,CAAC,GAAY;IAChD,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,qBAAqB,EAAE,CAAC;IAC3F,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,2BAA2B,EAAE,CAAC;IAC7G,MAAM,MAAM,GAAG,GAA8B,CAAC;IAC9C,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;IAC5B,IAAI,QAAQ,KAAK,QAAQ;QAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,CAAC;IACjF,IAAI,QAAQ,KAAK,OAAO;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,0BAA0B,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;IACrG,MAAM,QAAQ,GAAG,MAAM,CAAC,mBAAmB,CAAC;IAC5C,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1D,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,4BAA4B,EAAE,CAAC;IAC7D,CAAC;IACD,MAAM,QAAQ,GAAY,MAAM,CAAC,KAAK,CAAC;IACvC,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjF,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,qBAAqB,EAAE,CAAC;IACtD,CAAC;IACD,MAAM,WAAW,GAAG,QAAmC,CAAC;IACxD,IACE,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,OAAO,IAAI,WAAW,CAAC,IAAI,KAAK,UAAU,CAAC;WAC/D,OAAO,WAAW,CAAC,EAAE,KAAK,QAAQ;WAClC,WAAW,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC,EAC9B,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,qBAAqB,EAAE,CAAC;IACtD,CAAC;IACD,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC;IACrC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,sBAAsB,EAAE,CAAC;IACvD,CAAC;IACD,IAAI,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;QACnG,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,yBAAyB,EAAE,CAAC;IAC1D,CAAC;IACD,OAAO;QACL,EAAE,EAAE,IAAI;QACR,QAAQ,EAAE;YACR,QAAQ,EAAE,OAAO;YACjB,mBAAmB,EAAE,QAAQ;YAC7B,KAAK,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,EAAE;YACrD,MAAM;YACN,SAAS;SACV;KACF,CAAC;AACJ,CAAC"}

package/dist/runtime-v2/principle-reuse/reuse-retrieval.d.ts

@@ -0,0 +1,36 @@
+/**
+ * PRI-917 Slice 1 — read-only reuse retrieval over the existing Principle
+ * Ledger.
+ *
+ * Reuses `loadLedger` (the single ledger authority) and the existing
+ * principle-kind guard. Creates no repository, no database, no index, no
+ * vector store, and no embedding service. It never writes: `derivedFromPainIds`,
+ * the ledger schema, and `activation_decisions` are all untouched.
+ *
+ * @see docs/specs/PRI-917-reuse-before-create-v0.1.md (SPEC v0.2)
+ */
+import type { ReuseCandidateInput, ReusablePrinciple, ReuseShortlist, ReuseShortlistOptions } from './reuse-domain.js';
+/**
+ * Statuses a Principle may be reused into (SPEC §15).
+ *
+ * `active` and `candidate`/`probation` are included because that is where real
+ * reusable knowledge lives — excluding `candidate` would leave almost nothing,
+ * as the live ledger is overwhelmingly `candidate`. `archived` and `deprecated`
+ * are excluded: reusing into a retired Principle would revive withdrawn
+ * knowledge. Any unrecognised status is excluded fail-closed.
+ */
+export declare const REUSABLE_PRINCIPLE_STATUSES: ReadonlySet<string>;
+export declare function isReusablePrincipleStatus(status: unknown): boolean;
+export declare function readReusablePrinciples(stateDir: string): ReusablePrinciple[];
+/**
+ * Build the reuse shortlist for a candidate, from the canonical ledger.
+ *
+ * `recommendationKind` is checked with the SAME guard the intake write boundary
+ * uses, so a non-principle candidate can never reach the reuse path (SPEC T6 —
+ * the #1851 refusal semantics stay exactly as they are; this only makes the
+ * reuse path refuse them too).
+ */
+export declare function buildReuseShortlist(input: ReuseCandidateInput, stateDir: string, options?: ReuseShortlistOptions & {
+    recommendationKind?: unknown;
+}): ReuseShortlist;
+//# sourceMappingURL=reuse-retrieval.d.ts.map

package/dist/runtime-v2/principle-reuse/reuse-retrieval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reuse-retrieval.d.ts","sourceRoot":"","sources":["../../../src/runtime-v2/principle-reuse/reuse-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAQH,OAAO,KAAK,EACV,mBAAmB,EACnB,iBAAiB,EACjB,cAAc,EACd,qBAAqB,EACtB,MAAM,mBAAmB,CAAC;AAE3B;;;;;;;;GAQG;AACH,eAAO,MAAM,2BAA2B,EAAE,WAAW,CAAC,MAAM,CAI1D,CAAC;AAEH,wBAAgB,yBAAyB,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO,CAMlE;AA0CD,wBAAgB,sBAAsB,CAAC,QAAQ,EAAE,MAAM,GAAG,iBAAiB,EAAE,CAa5E;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,mBAAmB,EAC1B,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE,qBAAqB,GAAG;IAAE,kBAAkB,CAAC,EAAE,OAAO,CAAA;CAAO,GACrE,cAAc,CAWhB"}

package/dist/runtime-v2/principle-reuse/reuse-retrieval.js

@@ -0,0 +1,118 @@
+/**
+ * PRI-917 Slice 1 — read-only reuse retrieval over the existing Principle
+ * Ledger.
+ *
+ * Reuses `loadLedger` (the single ledger authority) and the existing
+ * principle-kind guard. Creates no repository, no database, no index, no
+ * vector store, and no embedding service. It never writes: `derivedFromPainIds`,
+ * the ledger schema, and `activation_decisions` are all untouched.
+ *
+ * @see docs/specs/PRI-917-reuse-before-create-v0.1.md (SPEC v0.2)
+ */
+import { existsSync, readFileSync } from 'fs';
+import { getLedgerFilePathPublic, loadLedger } from '../../principle-tree-ledger.js';
+import { isPrincipleLedgerEligibleKind } from '../store/candidate/recommendation-kind-resolver.js';
+import { PRINCIPLE_STATUSES } from '../types/principle-enums.js';
+import { isRecord } from '../candidate-intake.js';
+import { selectReuseShortlist } from './reuse-shortlist.js';
+/**
+ * Statuses a Principle may be reused into (SPEC §15).
+ *
+ * `active` and `candidate`/`probation` are included because that is where real
+ * reusable knowledge lives — excluding `candidate` would leave almost nothing,
+ * as the live ledger is overwhelmingly `candidate`. `archived` and `deprecated`
+ * are excluded: reusing into a retired Principle would revive withdrawn
+ * knowledge. Any unrecognised status is excluded fail-closed.
+ */
+export const REUSABLE_PRINCIPLE_STATUSES = new Set([
+    'active',
+    'candidate',
+    'probation',
+]);
+export function isReusablePrincipleStatus(status) {
+    if (typeof status !== 'string')
+        return false;
+    // Fail closed on a status outside the known enum: an unrecognised value is
+    // treated as not reusable rather than optimistically reusable.
+    if (!PRINCIPLE_STATUSES.includes(status))
+        return false;
+    return REUSABLE_PRINCIPLE_STATUSES.has(status);
+}
+function assertLedgerReadable(stateDir) {
+    const filePath = getLedgerFilePathPublic(stateDir);
+    if (!existsSync(filePath))
+        return; // no corpus yet — nothing to reuse
+    const raw = readFileSync(filePath, 'utf-8');
+    if (raw.trim() === '')
+        return; // an empty document is an empty corpus
+    // Throws on malformed JSON so the caller fails the gate rather than silently
+    // treating unreadable knowledge as absent knowledge.
+    JSON.parse(raw);
+}
+/**
+ * Read every reusable Principle from the canonical ledger.
+ *
+ * Read-only: opens the ledger document and filters in memory. No caching is
+ * introduced here — the corpus is small (order 10^2) and a cache would be a
+ * second place where ledger truth could go stale.
+ *
+ * Fail-closed on an UNREADABLE corpus. The shared `loadLedger` deliberately
+ * swallows a parse error and returns an empty store, which is indistinguishable
+ * from "nothing has been learned yet" — and the write that follows would then
+ * overwrite the unreadable file. Reporting that as an empty candidate set is
+ * precisely the silent duplicate this whole path exists to prevent, so an
+ * existing-but-unparseable ledger throws here instead.
+ *
+ * A genuinely MISSING ledger is not a failure: there is simply nothing to
+ * reuse yet, and blocking the first write of a fresh workspace would be wrong.
+ */
+function normalizeLedgerEntry(entry) {
+    if (!isRecord(entry))
+        return null;
+    const { id, text, triggerPattern, action, status } = entry;
+    if (typeof id !== 'string' || id.length === 0)
+        return null;
+    return {
+        id,
+        text: typeof text === 'string' ? text : '',
+        triggerPattern: typeof triggerPattern === 'string' ? triggerPattern : '',
+        action: typeof action === 'string' ? action : '',
+        status: typeof status === 'string' ? status : '',
+    };
+}
+export function readReusablePrinciples(stateDir) {
+    assertLedgerReadable(stateDir);
+    const store = loadLedger(stateDir);
+    // The ledger is an untrusted document (rc-1/rc-2): validate each entry's
+    // fields instead of asserting the shape, so a malformed entry is skipped
+    // rather than flowing a non-string into the tokenizer as if it were text.
+    const entries = Object.values(store.tree.principles);
+    const reusable = [];
+    for (const entry of entries) {
+        const normalized = normalizeLedgerEntry(entry);
+        if (normalized && isReusablePrincipleStatus(normalized.status))
+            reusable.push(normalized);
+    }
+    return reusable;
+}
+/**
+ * Build the reuse shortlist for a candidate, from the canonical ledger.
+ *
+ * `recommendationKind` is checked with the SAME guard the intake write boundary
+ * uses, so a non-principle candidate can never reach the reuse path (SPEC T6 —
+ * the #1851 refusal semantics stay exactly as they are; this only makes the
+ * reuse path refuse them too).
+ */
+export function buildReuseShortlist(input, stateDir, options = {}) {
+    const { recommendationKind, ...shortlistOptions } = options;
+    if (recommendationKind !== undefined && !isPrincipleLedgerEligibleKind(recommendationKind)) {
+        return {
+            candidates: [],
+            eligibleCount: 0,
+            consideredCount: 0,
+            candidateKindEligible: false,
+        };
+    }
+    return selectReuseShortlist(input, readReusablePrinciples(stateDir), shortlistOptions);
+}
+//# sourceMappingURL=reuse-retrieval.js.map

package/dist/runtime-v2/principle-reuse/reuse-retrieval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reuse-retrieval.js","sourceRoot":"","sources":["../../../src/runtime-v2/principle-reuse/reuse-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAC9C,OAAO,EAAE,uBAAuB,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AACrF,OAAO,EAAE,6BAA6B,EAAE,MAAM,oDAAoD,CAAC;AACnG,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACjE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AAQ5D;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAwB,IAAI,GAAG,CAAC;IACtE,QAAQ;IACR,WAAW;IACX,WAAW;CACZ,CAAC,CAAC;AAEH,MAAM,UAAU,yBAAyB,CAAC,MAAe;IACvD,IAAI,OAAO,MAAM,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC7C,2EAA2E;IAC3E,+DAA+D;IAC/D,IAAI,CAAE,kBAAwC,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IAC9E,OAAO,2BAA2B,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACjD,CAAC;AAED,SAAS,oBAAoB,CAAC,QAAgB;IAC5C,MAAM,QAAQ,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACnD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;QAAE,OAAO,CAAC,mCAAmC;IACtE,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC5C,IAAI,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,CAAC,uCAAuC;IACtE,6EAA6E;IAC7E,qDAAqD;IACrD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AAClB,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,oBAAoB,CAAC,KAAc;IAC1C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAClC,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IAC3D,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3D,OAAO;QACL,EAAE;QACF,IAAI,EAAE,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;QAC1C,cAAc,EAAE,OAAO,cAAc,KAAK,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE;QACxE,MAAM,EAAE,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QAChD,MAAM,EAAE,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;KACjD,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,QAAgB;IACrD,oBAAoB,CAAC,QAAQ,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IACnC,yEAAyE;IACzE,yEAAyE;IACzE,0EAA0E;IAC1E,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAc,CAAC;IAClE,MAAM,QAAQ,GAAwB,EAAE,CAAC;IACzC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,UAAU,IAAI,yBAAyB,CAAC,UAAU,CAAC,MAAM,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC5F,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAA0B,EAC1B,QAAgB,EAChB,OAAO,GAA6D,EAAE;IAEtE,MAAM,EAAE,kBAAkB,EAAE,GAAG,gBAAgB,EAAE,GAAG,OAAO,CAAC;IAC5D,IAAI,kBAAkB,KAAK,SAAS,IAAI,CAAC,6BAA6B,CAAC,kBAAkB,CAAC,EAAE,CAAC;QAC3F,OAAO;YACL,UAAU,EAAE,EAAE;YACd,aAAa,EAAE,CAAC;YAChB,eAAe,EAAE,CAAC;YAClB,qBAAqB,EAAE,KAAK;SAC7B,CAAC;IACJ,CAAC;IACD,OAAO,oBAAoB,CAAC,KAAK,EAAE,sBAAsB,CAAC,QAAQ,CAAC,EAAE,gBAAgB,CAAC,CAAC;AACzF,CAAC"}

package/dist/runtime-v2/principle-reuse/reuse-shortlist.d.ts

@@ -0,0 +1,40 @@
+/**
+ * PRI-917 Slice 1 — deterministic shortlist scoring (pure, no LLM, no I/O).
+ *
+ * Why a hand-rolled tokenizer: the Principle corpus is Chinese prose, so
+ * whitespace tokenization collapses a sentence into one useless token.
+ * This module therefore emits CJK character bigrams plus lower-cased latin /
+ * numeric word runs. The result is deterministic, dependency-free, and
+ * explainable — every score decomposes into named shared terms.
+ *
+ * Explicit non-goals (SPEC §6): no embedding, no vector store, no semantic
+ * search service, no background process, no clock, no randomness.
+ */
+import type { ReuseCandidate, ReuseCandidateInput, ReusablePrinciple, ReuseShortlist, ReuseShortlistOptions } from './reuse-domain.js';
+/**
+ * Deterministic, dependency-free tokenizer.
+ *
+ * - latin / numeric runs → lower-cased word tokens (length >= 2)
+ * - CJK runs → character bigrams (single char when the run is length 1)
+ * - everything else is a separator
+ *
+ * The output is sorted, so two equal texts always tokenize identically.
+ */
+export declare function tokenizeForReuse(input: string): string[];
+/**
+ * Score one existing Principle against the candidate.
+ *
+ * Returns `null` when no field pair shares anything — an entry with no
+ * evidence is not a proposal.
+ */
+export declare function scoreReuseCandidate(input: ReuseCandidateInput, principle: ReusablePrinciple, maxEvidenceTerms?: number): ReuseCandidate | null;
+/**
+ * Build a deterministic, bounded shortlist of existing Principles that may
+ * already cover the candidate.
+ *
+ * Pure: no I/O, no clock, no randomness. Total order is `score` desc then
+ * `principleId` asc, so identical input always yields identical output
+ * regardless of ledger insertion order.
+ */
+export declare function selectReuseShortlist(input: ReuseCandidateInput, principles: readonly ReusablePrinciple[], options?: ReuseShortlistOptions): ReuseShortlist;
+//# sourceMappingURL=reuse-shortlist.d.ts.map

package/dist/runtime-v2/principle-reuse/reuse-shortlist.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reuse-shortlist.d.ts","sourceRoot":"","sources":["../../../src/runtime-v2/principle-reuse/reuse-shortlist.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EACV,cAAc,EACd,mBAAmB,EAGnB,iBAAiB,EAEjB,cAAc,EACd,qBAAqB,EACtB,MAAM,mBAAmB,CAAC;AA0C3B;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAqCxD;AAQD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,mBAAmB,EAC1B,SAAS,EAAE,iBAAiB,EAC5B,gBAAgB,GAAE,MAAmC,GACpD,cAAc,GAAG,IAAI,CAoDvB;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,mBAAmB,EAC1B,UAAU,EAAE,SAAS,iBAAiB,EAAE,EACxC,OAAO,GAAE,qBAA0B,GAClC,cAAc,CAkBhB"}

package/dist/runtime-v2/principle-reuse/reuse-shortlist.js

@@ -0,0 +1,184 @@
+/**
+ * PRI-917 Slice 1 — deterministic shortlist scoring (pure, no LLM, no I/O).
+ *
+ * Why a hand-rolled tokenizer: the Principle corpus is Chinese prose, so
+ * whitespace tokenization collapses a sentence into one useless token.
+ * This module therefore emits CJK character bigrams plus lower-cased latin /
+ * numeric word runs. The result is deterministic, dependency-free, and
+ * explainable — every score decomposes into named shared terms.
+ *
+ * Explicit non-goals (SPEC §6): no embedding, no vector store, no semantic
+ * search service, no background process, no clock, no randomness.
+ */
+const DEFAULT_TOP_K = 3;
+const DEFAULT_MIN_SCORE = 0.15;
+const DEFAULT_MAX_EVIDENCE_TERMS = 8;
+/**
+ * Field-pair weights. Same-field agreement is the strong signal; a
+ * cross-field pair catches a candidate that states the claim in `action` where
+ * the existing Principle states it in `text`.
+ */
+const FIELD_PAIR_WEIGHTS = [
+    { from: 'text', to: 'text', weight: 3 },
+    { from: 'action', to: 'action', weight: 3 },
+    { from: 'triggerPattern', to: 'triggerPattern', weight: 2 },
+    { from: 'text', to: 'action', weight: 1 },
+    { from: 'action', to: 'text', weight: 1 },
+];
+/**
+ * Minimal Chinese function-word stop list. Kept deliberately small: over-pruning
+ * would erase real signal, and the scoring is advisory (a human/AI Owner
+ * decides), not authoritative.
+ */
+const CJK_STOP_TERMS = new Set([
+    '的', '了', '是', '在', '和', '与', '或', '及', '对', '为', '以', '等', '中',
+    '上', '下', '时', '后', '前', '将', '被', '把', '就', '都', '也', '而', '但',
+    '并', '不', '有', '无', '一', '个', '这', '那', '其', '之', '所', '使', '由',
+    '如', '若', '则', '于', '从', '到', '向', '再', '更', '最', '很', '会', '能',
+    '应', '须', '要', '可', '个', '种', '些', '之', '者', '此', '该', '某',
+]);
+const CJK_RANGE = /[㐀-䶿一-鿿]/;
+function isCjk(ch) {
+    return CJK_RANGE.test(ch);
+}
+/**
+ * Deterministic, dependency-free tokenizer.
+ *
+ * - latin / numeric runs → lower-cased word tokens (length >= 2)
+ * - CJK runs → character bigrams (single char when the run is length 1)
+ * - everything else is a separator
+ *
+ * The output is sorted, so two equal texts always tokenize identically.
+ */
+export function tokenizeForReuse(input) {
+    const normalized = input.normalize('NFKC').toLowerCase();
+    const tokens = [];
+    let latinRun = '';
+    let cjkRun = '';
+    const flushLatin = () => {
+        if (latinRun.length >= 2)
+            tokens.push(latinRun);
+        latinRun = '';
+    };
+    const flushCjk = () => {
+        if (cjkRun.length === 1) {
+            tokens.push(cjkRun);
+        }
+        else {
+            for (let i = 0; i + 1 < cjkRun.length; i++)
+                tokens.push(cjkRun.slice(i, i + 2));
+        }
+        cjkRun = '';
+    };
+    for (const ch of normalized) {
+        if (isCjk(ch)) {
+            flushLatin();
+            cjkRun += ch;
+        }
+        else if (/[a-z0-9]/.test(ch)) {
+            flushCjk();
+            latinRun += ch;
+        }
+        else {
+            flushLatin();
+            flushCjk();
+        }
+    }
+    flushLatin();
+    flushCjk();
+    const deduped = new Set(tokens);
+    for (const stop of CJK_STOP_TERMS)
+        deduped.delete(stop);
+    return [...deduped].sort();
+}
+function intersect(a, b) {
+    const shared = [];
+    for (const term of a)
+        if (b.has(term))
+            shared.push(term);
+    return shared.sort();
+}
+/**
+ * Score one existing Principle against the candidate.
+ *
+ * Returns `null` when no field pair shares anything — an entry with no
+ * evidence is not a proposal.
+ */
+export function scoreReuseCandidate(input, principle, maxEvidenceTerms = DEFAULT_MAX_EVIDENCE_TERMS) {
+    const inputTerms = {
+        text: new Set(tokenizeForReuse(input.text)),
+        triggerPattern: new Set(tokenizeForReuse(input.triggerPattern)),
+        action: new Set(tokenizeForReuse(input.action)),
+    };
+    const principleTerms = {
+        text: new Set(tokenizeForReuse(principle.text)),
+        triggerPattern: new Set(tokenizeForReuse(principle.triggerPattern)),
+        action: new Set(tokenizeForReuse(principle.action)),
+    };
+    const evidence = [];
+    let weighted = 0;
+    let totalWeight = 0;
+    for (const pair of FIELD_PAIR_WEIGHTS) {
+        const from = inputTerms[pair.from];
+        const to = principleTerms[pair.to];
+        const smaller = Math.min(from.size, to.size);
+        // An empty side can never produce evidence.
+        if (smaller === 0)
+            continue;
+        totalWeight += pair.weight;
+        const shared = intersect(from, to);
+        if (shared.length === 0)
+            continue;
+        const coverage = shared.length / smaller;
+        weighted += pair.weight * coverage;
+        const field = pair.from === pair.to ? pair.from : `${pair.from}~${pair.to}`;
+        evidence.push({
+            field,
+            sharedTerms: shared.slice(0, maxEvidenceTerms),
+            coverage,
+        });
+    }
+    if (evidence.length === 0 || totalWeight === 0)
+        return null;
+    const score = weighted / totalWeight;
+    const [top] = evidence
+        .slice()
+        .sort((a, b) => b.coverage - a.coverage || a.field.localeCompare(b.field));
+    const reason = top
+        ? `shares ${top.sharedTerms.slice(0, 5).join('、')} on ${top.field} (coverage ${(top.coverage * 100).toFixed(0)}%)`
+        : 'no field overlap';
+    return {
+        principleId: principle.id,
+        principleText: principle.text,
+        score,
+        evidence,
+        similarityReason: reason,
+    };
+}
+/**
+ * Build a deterministic, bounded shortlist of existing Principles that may
+ * already cover the candidate.
+ *
+ * Pure: no I/O, no clock, no randomness. Total order is `score` desc then
+ * `principleId` asc, so identical input always yields identical output
+ * regardless of ledger insertion order.
+ */
+export function selectReuseShortlist(input, principles, options = {}) {
+    const topK = options.topK ?? DEFAULT_TOP_K;
+    const minScore = options.minScore ?? DEFAULT_MIN_SCORE;
+    const maxEvidenceTerms = options.maxEvidenceTerms ?? DEFAULT_MAX_EVIDENCE_TERMS;
+    const scored = [];
+    for (const principle of principles) {
+        const candidate = scoreReuseCandidate(input, principle, maxEvidenceTerms);
+        if (candidate && candidate.score >= minScore)
+            scored.push(candidate);
+    }
+    scored.sort((a, b) => b.score - a.score || a.principleId.localeCompare(b.principleId));
+    return {
+        candidates: scored.slice(0, topK),
+        eligibleCount: principles.length,
+        consideredCount: scored.length,
+        candidateKindEligible: true,
+    };
+}
+//# sourceMappingURL=reuse-shortlist.js.map

package/dist/runtime-v2/principle-reuse/reuse-shortlist.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reuse-shortlist.js","sourceRoot":"","sources":["../../../src/runtime-v2/principle-reuse/reuse-shortlist.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAaH,MAAM,aAAa,GAAG,CAAC,CAAC;AACxB,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAC/B,MAAM,0BAA0B,GAAG,CAAC,CAAC;AAErC;;;;GAIG;AACH,MAAM,kBAAkB,GAIlB;IACJ,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE;IACvC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE;IAC3C,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,gBAAgB,EAAE,MAAM,EAAE,CAAC,EAAE;IAC3D,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE;IACzC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE;CAC1C,CAAC;AAEF;;;;GAIG;AACH,MAAM,cAAc,GAAwB,IAAI,GAAG,CAAC;IAClD,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;IAC/D,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;IAC/D,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;IAC/D,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;IAC/D,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;CAC3D,CAAC,CAAC;AAEH,MAAM,SAAS,GAAG,UAAU,CAAC;AAE7B,SAAS,KAAK,CAAC,EAAU;IACvB,OAAO,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa;IAC5C,MAAM,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;IACzD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,QAAQ,GAAG,EAAE,CAAC;IAClB,IAAI,MAAM,GAAG,EAAE,CAAC;IAEhB,MAAM,UAAU,GAAG,GAAS,EAAE;QAC5B,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChD,QAAQ,GAAG,EAAE,CAAC;IAChB,CAAC,CAAC;IACF,MAAM,QAAQ,GAAG,GAAS,EAAE;QAC1B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClF,CAAC;QACD,MAAM,GAAG,EAAE,CAAC;IACd,CAAC,CAAC;IAEF,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YACd,UAAU,EAAE,CAAC;YACb,MAAM,IAAI,EAAE,CAAC;QACf,CAAC;aAAM,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/B,QAAQ,EAAE,CAAC;YACX,QAAQ,IAAI,EAAE,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IACD,UAAU,EAAE,CAAC;IACb,QAAQ,EAAE,CAAC;IAEX,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,cAAc;QAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxD,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;AAC7B,CAAC;AAED,SAAS,SAAS,CAAC,CAAsB,EAAE,CAAsB;IAC/D,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC;AACvB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAA0B,EAC1B,SAA4B,EAC5B,gBAAgB,GAAW,0BAA0B;IAErD,MAAM,UAAU,GAA4C;QAC1D,IAAI,EAAE,IAAI,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3C,cAAc,EAAE,IAAI,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QAC/D,MAAM,EAAE,IAAI,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;KAChD,CAAC;IACF,MAAM,cAAc,GAA4C;QAC9D,IAAI,EAAE,IAAI,GAAG,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC/C,cAAc,EAAE,IAAI,GAAG,CAAC,gBAAgB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACnE,MAAM,EAAE,IAAI,GAAG,CAAC,gBAAgB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;KACpD,CAAC;IAEF,MAAM,QAAQ,GAAoB,EAAE,CAAC;IACrC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,IAAI,IAAI,kBAAkB,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAC7C,4CAA4C;QAC5C,IAAI,OAAO,KAAK,CAAC;YAAE,SAAS;QAC5B,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC;QAC3B,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC;QACzC,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;QACnC,MAAM,KAAK,GAAuB,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;QAChG,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK;YACL,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC;YAC9C,QAAQ;SACT,CAAC,CAAC;IACL,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5D,MAAM,KAAK,GAAG,QAAQ,GAAG,WAAW,CAAC;IACrC,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ;SACnB,KAAK,EAAE;SACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7E,MAAM,MAAM,GAAG,GAAG;QAChB,CAAC,CAAC,UAAU,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,KAAK,cAAc,CAAC,GAAG,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QAClH,CAAC,CAAC,kBAAkB,CAAC;IAEvB,OAAO;QACL,WAAW,EAAE,SAAS,CAAC,EAAE;QACzB,aAAa,EAAE,SAAS,CAAC,IAAI;QAC7B,KAAK;QACL,QAAQ;QACR,gBAAgB,EAAE,MAAM;KACzB,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAA0B,EAC1B,UAAwC,EACxC,OAAO,GAA0B,EAAE;IAEnC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,aAAa,CAAC;IAC3C,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IACvD,MAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,IAAI,0BAA0B,CAAC;IAEhF,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,mBAAmB,CAAC,KAAK,EAAE,SAAS,EAAE,gBAAgB,CAAC,CAAC;QAC1E,IAAI,SAAS,IAAI,SAAS,CAAC,KAAK,IAAI,QAAQ;YAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACvE,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;IAEvF,OAAO;QACL,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;QACjC,aAAa,EAAE,UAAU,CAAC,MAAM;QAChC,eAAe,EAAE,MAAM,CAAC,MAAM;QAC9B,qBAAqB,EAAE,IAAI;KAC5B,CAAC;AACJ,CAAC"}

package/dist/runtime-v2/store/pain-diagnosis/pain-diagnosis-store.d.ts

@@ -58,6 +58,13 @@ export interface PainDiagnosisStore {
     recordPainDiagnosis(input: PainDiagnosisWriteInput): Promise<PainDiagnosisRecord>;
     /** All diagnosis rows for a pain, oldest first. */
     getDiagnosesByPainId(painId: string): Promise<PainDiagnosisRecord[]>;
+    /**
+     * All diagnosis rows produced by one diagnostician task, oldest first
+     * (PRI-917 PR3B Phase 2: the candidate → pain bridge for reuse evidence —
+     * a candidate knows only its task; its Pain resolves through this query).
+     * Uses the existing idx_pain_diagnoses_task_id index; no schema change.
+     */
+    getDiagnosesByTaskId(taskId: string): Promise<PainDiagnosisRecord[]>;
 }
 export declare function isRootCauseCategory(value: unknown): value is RootCauseCategory;
 /**

package/dist/runtime-v2/store/pain-diagnosis/pain-diagnosis-store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"pain-diagnosis-store.d.ts","sourceRoot":"","sources":["../../../../src/runtime-v2/store/pain-diagnosis/pain-diagnosis-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,8CAA8C,CAAC;AAEtF,8FAA8F;AAC9F,MAAM,WAAW,qBAAqB;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;CACd;AAED,kDAAkD;AAClD,MAAM,WAAW,mBAAmB;IAClC,kEAAkE;IAClE,EAAE,EAAE,MAAM,CAAC;IACX,+FAA+F;IAC/F,MAAM,EAAE,MAAM,CAAC;IACf,2DAA2D;IAC3D,MAAM,EAAE,MAAM,CAAC;IACf,8CAA8C;IAC9C,WAAW,EAAE,MAAM,CAAC;IACpB,sEAAsE;IACtE,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,2DAA2D;IAC3D,SAAS,EAAE,MAAM,CAAC;IAClB,0DAA0D;IAC1D,QAAQ,EAAE,qBAAqB,EAAE,CAAC;IAClC,+EAA+E;IAC/E,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,mFAAmF;IACnF,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,gEAAgE;AAChE,MAAM,WAAW,uBAAuB;IACtC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,SAAS,qBAAqB,EAAE,CAAC;IAC3C,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC5B;AAED,MAAM,WAAW,kBAAkB;IACjC;;;OAGG;IACH,mBAAmB,CAAC,KAAK,EAAE,uBAAuB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAElF,mDAAmD;IACnD,oBAAoB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAAC;CACtE;AAID,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,iBAAiB,CAE9E;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CAAC,SAAS,EAAE,MAAM,GAAG,iBAAiB,GAAG,IAAI,CAKlF;AAED,oEAAoE;AACpE,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAEhF"}
+{"version":3,"file":"pain-diagnosis-store.d.ts","sourceRoot":"","sources":["../../../../src/runtime-v2/store/pain-diagnosis/pain-diagnosis-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,8CAA8C,CAAC;AAEtF,8FAA8F;AAC9F,MAAM,WAAW,qBAAqB;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;CACd;AAED,kDAAkD;AAClD,MAAM,WAAW,mBAAmB;IAClC,kEAAkE;IAClE,EAAE,EAAE,MAAM,CAAC;IACX,+FAA+F;IAC/F,MAAM,EAAE,MAAM,CAAC;IACf,2DAA2D;IAC3D,MAAM,EAAE,MAAM,CAAC;IACf,8CAA8C;IAC9C,WAAW,EAAE,MAAM,CAAC;IACpB,sEAAsE;IACtE,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,2DAA2D;IAC3D,SAAS,EAAE,MAAM,CAAC;IAClB,0DAA0D;IAC1D,QAAQ,EAAE,qBAAqB,EAAE,CAAC;IAClC,+EAA+E;IAC/E,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,mFAAmF;IACnF,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,gEAAgE;AAChE,MAAM,WAAW,uBAAuB;IACtC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,SAAS,qBAAqB,EAAE,CAAC;IAC3C,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC5B;AAED,MAAM,WAAW,kBAAkB;IACjC;;;OAGG;IACH,mBAAmB,CAAC,KAAK,EAAE,uBAAuB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAElF,mDAAmD;IACnD,oBAAoB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAAC;IAErE;;;;;OAKG;IACH,oBAAoB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAAC;CACtE;AAID,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,iBAAiB,CAE9E;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CAAC,SAAS,EAAE,MAAM,GAAG,iBAAiB,GAAG,IAAI,CAKlF;AAED,oEAAoE;AACpE,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAEhF"}

package/dist/runtime-v2/store/pain-diagnosis/pain-diagnosis-store.js.map

@@ -1 +1 @@
-{"version":3,"file":"pain-diagnosis-store.js","sourceRoot":"","sources":["../../../../src/runtime-v2/store/pain-diagnosis/pain-diagnosis-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAwDH,MAAM,gBAAgB,GAAwB,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC;AAErG,MAAM,UAAU,mBAAmB,CAAC,KAAc;IAChD,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAClE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,sBAAsB,CAAC,SAAiB;IACtD,KAAK,MAAM,QAAQ,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,SAAS,CAAU,EAAE,CAAC;QAC9E,IAAI,SAAS,CAAC,UAAU,CAAC,GAAG,QAAQ,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC;IAC7D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,oBAAoB,CAAC,MAAc,EAAE,WAAmB;IACtE,OAAO,GAAG,MAAM,KAAK,WAAW,EAAE,CAAC;AACrC,CAAC"}
+{"version":3,"file":"pain-diagnosis-store.js","sourceRoot":"","sources":["../../../../src/runtime-v2/store/pain-diagnosis/pain-diagnosis-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAgEH,MAAM,gBAAgB,GAAwB,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC;AAErG,MAAM,UAAU,mBAAmB,CAAC,KAAc;IAChD,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAClE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,sBAAsB,CAAC,SAAiB;IACtD,KAAK,MAAM,QAAQ,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,SAAS,CAAU,EAAE,CAAC;QAC9E,IAAI,SAAS,CAAC,UAAU,CAAC,GAAG,QAAQ,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC;IAC7D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,oBAAoB,CAAC,MAAc,EAAE,WAAmB;IACtE,OAAO,GAAG,MAAM,KAAK,WAAW,EAAE,CAAC;AACrC,CAAC"}

package/dist/runtime-v2/store/pain-diagnosis/sqlite-pain-diagnosis-store.d.ts

@@ -5,5 +5,6 @@ export declare class SqlitePainDiagnosisStore implements PainDiagnosisStore {
     constructor(connection: SqliteConnection);
     recordPainDiagnosis(input: PainDiagnosisWriteInput): Promise<PainDiagnosisRecord>;
     getDiagnosesByPainId(painId: string): Promise<PainDiagnosisRecord[]>;
+    getDiagnosesByTaskId(taskId: string): Promise<PainDiagnosisRecord[]>;
 }
 //# sourceMappingURL=sqlite-pain-diagnosis-store.d.ts.map