create-principles-disciple 1.144.11 → 1.144.13

package/core/dist/runtime-v2/principle-reuse/reuse-evaluation-output.js

@@ -0,0 +1,97 @@
+/**
+ * Reuse Evaluation Output — the Semantic Reuse Evaluation Capability's
+ * proposal contract (PRI-917 SPEC v0.3.2 §4.2).
+ *
+ * This is a PROPOSAL-ONLY contract: it is what the LLM-backed evaluation
+ * returns to the Owner's review surface, never what it can do. The word
+ * "decision" deliberately does NOT appear here — in the reuse chain,
+ * "decision" belongs exclusively to the Owner; this layer can only
+ * recommend (SPEC v0.3.2 §3 naming boundary).
+ *
+ * Pure contract + runtime validator, zero I/O. The runtime validator is the
+ * trust boundary for an UNTRUSTED LLM output (rc-1/rc-2/rc-3):
+ *   - closed field set: ANY key outside the schema is rejected, so a model
+ *     output can never smuggle persistence-ish fields (`reuseEvidence`,
+ *     `write`, `persist`, ...) — T7a of SPEC v0.3.2 §11;
+ *   - cross-field rules: `recommendation=reuse` REQUIRES
+ *     `selectedPrincipleId`; `recommendation=uncertain` FORBIDS it.
+ *
+ * Deliberate deviation from SPEC v0.3.2 §4.2 ("合法 UUID 形状"): the
+ * validator does NOT assert a UUID shape on `selectedPrincipleId`, because
+ * bootstrap core principles carry `T-xx` ids in the live ledger — a UUID
+ * assertion would wrongly reject them as reuse targets. Existence of the id
+ * is enforced one layer up, against the actual shortlist (INV-R08).
+ */
+import { Type } from '@sinclair/typebox';
+import { Value } from '@sinclair/typebox/value';
+/** Registry key for OUTPUT_SCHEMA_REGISTRY (adapter-side validation). */
+export const REUSE_EVALUATION_OUTPUT_SCHEMA_REF = 'reuse-evaluation-output-v1';
+export const ReuseEvaluationRecommendationSchema = Type.Union([
+    Type.Literal('reuse'),
+    Type.Literal('create'),
+    Type.Literal('uncertain'),
+]);
+export const ReuseEvaluationOutputV1Schema = Type.Object({
+    recommendation: ReuseEvaluationRecommendationSchema,
+    selectedPrincipleId: Type.Optional(Type.String({ minLength: 1 })),
+    rationale: Type.String({ minLength: 1 }),
+    confidence: Type.Number({ minimum: 0, maximum: 1 }),
+});
+function isRecord(value) {
+    return typeof value === 'object' && value !== null && !Array.isArray(value);
+}
+const ALLOWED_KEYS = new Set([
+    'recommendation',
+    'selectedPrincipleId',
+    'rationale',
+    'confidence',
+]);
+/**
+ * Runtime validation for the evaluation output (rc-1/rc-2/rc-3).
+ *
+ * Pure function, never throws. Returns the FIRST failure reason:
+ *   - non-object input → `evaluation_is_not_an_object`
+ *   - any key outside the closed field set → `unknown_field:<key>` (T7a)
+ *   - schema violation (bad recommendation value, empty rationale,
+ *     confidence out of [0,1], empty/non-string selectedPrincipleId) →
+ *     `schema_validation_failed:<details>`
+ *   - `recommendation=reuse` without `selectedPrincipleId` →
+ *     `reuse_without_principle_id`
+ *   - `recommendation=uncertain` WITH `selectedPrincipleId` →
+ *     `uncertain_with_principle_id`
+ */
+export function validateReuseEvaluationOutput(raw) {
+    if (!isRecord(raw)) {
+        return { ok: false, reason: 'evaluation_is_not_an_object' };
+    }
+    for (const key of Object.keys(raw)) {
+        if (!ALLOWED_KEYS.has(key)) {
+            return { ok: false, reason: `unknown_field:${key}` };
+        }
+    }
+    if (!Value.Check(ReuseEvaluationOutputV1Schema, raw)) {
+        const details = [...Value.Errors(ReuseEvaluationOutputV1Schema, raw)]
+            .slice(0, 5)
+            .map((e) => `${e.path || '/'}: ${e.message}`)
+            .join('; ');
+        return { ok: false, reason: `schema_validation_failed:${details}` };
+    }
+    const { recommendation, rationale, confidence } = raw;
+    const selected = raw.selectedPrincipleId;
+    if (recommendation === 'reuse' && (typeof selected !== 'string' || selected.trim() === '')) {
+        return { ok: false, reason: 'reuse_without_principle_id' };
+    }
+    if (recommendation === 'uncertain' && typeof selected === 'string' && selected.trim() !== '') {
+        return { ok: false, reason: 'uncertain_with_principle_id' };
+    }
+    return {
+        ok: true,
+        output: {
+            recommendation,
+            rationale,
+            confidence,
+            ...(typeof selected === 'string' && selected.trim() !== '' ? { selectedPrincipleId: selected } : {}),
+        },
+    };
+}
+//# sourceMappingURL=reuse-evaluation-output.js.map

package/core/dist/runtime-v2/principle-reuse/reuse-evaluation-output.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reuse-evaluation-output.js","sourceRoot":"","sources":["../../../src/runtime-v2/principle-reuse/reuse-evaluation-output.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,OAAO,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzC,OAAO,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAC;AAEhD,yEAAyE;AACzE,MAAM,CAAC,MAAM,kCAAkC,GAAG,4BAA4B,CAAC;AAE/E,MAAM,CAAC,MAAM,mCAAmC,GAAG,IAAI,CAAC,KAAK,CAAC;IAC5D,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;IACrB,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IACtB,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC;CAC1B,CAAC,CAAC;AAWH,MAAM,CAAC,MAAM,6BAA6B,GAAG,IAAI,CAAC,MAAM,CAAC;IACvD,cAAc,EAAE,mCAAmC;IACnD,mBAAmB,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;IACjE,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IACxC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;CACpD,CAAC,CAAC;AAMH,SAAS,QAAQ,CAAC,KAAc;IAC9B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED,MAAM,YAAY,GAAwB,IAAI,GAAG,CAAC;IAChD,gBAAgB;IAChB,qBAAqB;IACrB,WAAW;IACX,YAAY;CACb,CAAC,CAAC;AAEH;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,6BAA6B,CAAC,GAAY;IACxD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACnB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,6BAA6B,EAAE,CAAC;IAC9D,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,iBAAiB,GAAG,EAAE,EAAE,CAAC;QACvD,CAAC;IACH,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,6BAA6B,EAAE,GAAG,CAAC,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,6BAA6B,EAAE,GAAG,CAAC,CAAC;aAClE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;aAC5C,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,4BAA4B,OAAO,EAAE,EAAE,CAAC;IACtE,CAAC;IACD,MAAM,EAAE,cAAc,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,GAIjD,CAAC;IACF,MAAM,QAAQ,GAAG,GAAG,CAAC,mBAAmB,CAAC;IACzC,IAAI,cAAc,KAAK,OAAO,IAAI,CAAC,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAC3F,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,4BAA4B,EAAE,CAAC;IAC7D,CAAC;IACD,IAAI,cAAc,KAAK,WAAW,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC7F,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,6BAA6B,EAAE,CAAC;IAC9D,CAAC;IACD,OAAO;QACL,EAAE,EAAE,IAAI;QACR,MAAM,EAAE;YACN,cAAc;YACd,SAAS;YACT,UAAU;YACV,GAAG,CAAC,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,mBAAmB,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACrG;KACF,CAAC;AACJ,CAAC"}

package/core/dist/runtime-v2/principle-reuse/reuse-evaluation-runner.d.ts

@@ -0,0 +1,111 @@
+/**
+ * ReuseEvaluationRunner — the Semantic Reuse Evaluation Capability's execution
+ * path (PRI-917 SPEC v0.3.2 §7, Phase 3C-3).
+ *
+ * A PROPOSAL-ONLY runner. It compares a candidate against a bounded shortlist
+ * of existing Principles and returns a RECOMMENDATION. It has no path to any
+ * ledger writer: this module imports no ledger mutation API, and nothing here
+ * can create, modify, or record a Principle. The Owner decides (SPEC §5).
+ *
+ * Design constraints honoured here (SPEC §7):
+ *   - ALL LLM execution goes through the injected PDRuntimeAdapter. This
+ *     module creates no client, no inference abstraction, and no provider
+ *     seam of its own; the repair loop drives the SAME adapter.
+ *   - Structured output repair reuses `structured-output-repair` (the
+ *     runtime-agnostic loop) with an adapter-backed `llmCaller`.
+ *   - The output contract is the Phase 3C-1 schema, and the Phase 3C-1
+ *     validator is the trust boundary (closed field set + cross-field rules).
+ *
+ * Failure is always fail-closed and observable: a timed-out run, unparsable
+ * output, or a payload that still violates the contract after repair throws a
+ * {@link ReuseEvaluationError}. It NEVER degrades into "no candidates, so
+ * create" — that is the caller's (review surface's) decision, not this
+ * runner's silent default (SPEC §9).
+ */
+import type { PDRuntimeAdapter } from '../runtime-protocol.js';
+import { type ReuseEvaluationOutputV1 } from './reuse-evaluation-output.js';
+/** The candidate's semantic claim — the same claim intake resolves (4b/4c). */
+export interface ReuseEvaluationCandidateInput {
+    text: string;
+    triggerPattern: string;
+    action: string;
+}
+/** One existing Principle from the deterministic shortlist. */
+export interface ReuseEvaluationShortlistEntry {
+    principleId: string;
+    text: string;
+    triggerPattern: string;
+    action: string;
+}
+export interface ReuseEvaluationInput {
+    candidate: ReuseEvaluationCandidateInput;
+    /** Bounded Top-K from reuse-shortlist (caller guarantees ≤ 3). */
+    candidates: ReuseEvaluationShortlistEntry[];
+}
+export type ReuseEvaluationFailureReason = 'timeout' | 'run_failed' | 'output_unavailable' | 'output_invalid' | 'repair_failed';
+/**
+ * Fail-closed error from the evaluation runner. Carries a structured reason
+ * and next action so the review surface can degrade OBSERVABLY (SPEC §9)
+ * instead of pretending the shortlist was semantically judged.
+ */
+export declare class ReuseEvaluationError extends Error {
+    readonly reason: ReuseEvaluationFailureReason;
+    readonly nextAction: string;
+    readonly detail?: string;
+    readonly repairAttempts: number;
+    constructor(args: {
+        reason: ReuseEvaluationFailureReason;
+        message: string;
+        nextAction: string;
+        detail?: string;
+        repairAttempts?: number;
+    });
+}
+export interface ReuseEvaluationRunnerDeps {
+    /** The one and only LLM execution path (never constructed here). */
+    readonly runtimeAdapter: PDRuntimeAdapter;
+}
+export interface ReuseEvaluationRunnerOptions {
+    /** Per-run budget. Bounded polling never exceeds it. Default 30s. */
+    readonly timeoutMs?: number;
+    /** Bounded repair attempts after a contract violation. Default 1. */
+    readonly maxRepairAttempts?: number;
+    /** agentSpec label for telemetry/lineage. Not an agent registration. */
+    readonly agentId?: string;
+    /** Poll interval while waiting for the run. Default 200ms. */
+    readonly pollIntervalMs?: number;
+}
+export declare class ReuseEvaluationRunner {
+    private readonly runtimeAdapter;
+    private readonly timeoutMs;
+    private readonly maxRepairAttempts;
+    private readonly agentId;
+    private readonly pollIntervalMs;
+    constructor(deps: ReuseEvaluationRunnerDeps, options?: ReuseEvaluationRunnerOptions);
+    /**
+     * Role declaration delivered on the system channel (base-layer prompt,
+     * following CorrectionObserver's PRI-633 pattern). The "you recommend, the
+     * Owner decides" boundary is stated here so the model never narrates itself
+     * as a decision authority (SPEC §5).
+     */
+    static readonly SYSTEM_PROMPT: string;
+    /** Build the evaluation prompt (deterministic, bounded). */
+    static buildPrompt(input: ReuseEvaluationInput): string;
+    /**
+     * Run one semantic evaluation and return the validated RECOMMENDATION.
+     *
+     * @throws ReuseEvaluationError — timeout / run failure / unparsable output /
+     *         contract violation surviving repair. Never a silent fallback.
+     */
+    recommend(input: ReuseEvaluationInput): Promise<ReuseEvaluationOutputV1>;
+    /** Bounded repair using the SAME adapter (no second LLM path). */
+    private repairAndValidate;
+    /**
+     * One adapter round-trip: start → bounded poll → fetch. This is the ONLY
+     * place the runner touches the runtime, for both the initial call and each
+     * repair attempt.
+     */
+    private invoke;
+}
+export declare function isValidReuseEvaluationOutput(value: unknown): boolean;
+//# sourceMappingURL=reuse-evaluation-runner.d.ts.map

package/core/dist/runtime-v2/principle-reuse/reuse-evaluation-runner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reuse-evaluation-runner.d.ts","sourceRoot":"","sources":["../../../src/runtime-v2/principle-reuse/reuse-evaluation-runner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,EAGL,KAAK,uBAAuB,EAC7B,MAAM,8BAA8B,CAAC;AAQtC,+EAA+E;AAC/E,MAAM,WAAW,6BAA6B;IAC5C,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,+DAA+D;AAC/D,MAAM,WAAW,6BAA6B;IAC5C,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,oBAAoB;IACnC,SAAS,EAAE,6BAA6B,CAAC;IACzC,kEAAkE;IAClE,UAAU,EAAE,6BAA6B,EAAE,CAAC;CAC7C;AAID,MAAM,MAAM,4BAA4B,GACpC,SAAS,GACT,YAAY,GACZ,oBAAoB,GACpB,gBAAgB,GAChB,eAAe,CAAC;AAEpB;;;;GAIG;AACH,qBAAa,oBAAqB,SAAQ,KAAK;IAC7C,SAAgB,MAAM,EAAE,4BAA4B,CAAC;IACrD,SAAgB,UAAU,EAAE,MAAM,CAAC;IACnC,SAAgB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChC,SAAgB,cAAc,EAAE,MAAM,CAAC;IAEvC,YAAY,IAAI,EAAE;QAChB,MAAM,EAAE,4BAA4B,CAAC;QACrC,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,cAAc,CAAC,EAAE,MAAM,CAAC;KACzB,EAOA;CACF;AAID,MAAM,WAAW,yBAAyB;IACxC,oEAAoE;IACpE,QAAQ,CAAC,cAAc,EAAE,gBAAgB,CAAC;CAC3C;AAED,MAAM,WAAW,4BAA4B;IAC3C,qEAAqE;IACrE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,qEAAqE;IACrE,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;IACpC,wEAAwE;IACxE,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,8DAA8D;IAC9D,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;CAClC;AAaD,qBAAa,qBAAqB;IAChC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAmB;IAClD,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAS;IAC3C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;IAExC,YAAY,IAAI,EAAE,yBAAyB,EAAE,OAAO,GAAE,4BAAiC,EAMtF;IAED;;;;;OAKG;IACH,MAAM,CAAC,QAAQ,CAAC,aAAa,SAIjB;IAEZ,4DAA4D;IAC5D,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,oBAAoB,GAAG,MAAM,CAuCtD;IAED;;;;;OAKG;IACG,SAAS,CAAC,KAAK,EAAE,oBAAoB,GAAG,OAAO,CAAC,uBAAuB,CAAC,CAW7E;IAED,kEAAkE;YACpD,iBAAiB;IAmD/B;;;;OAIG;YACW,MAAM;CA+DrB;AAID,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAKpE"}

package/core/dist/runtime-v2/principle-reuse/reuse-evaluation-runner.js

@@ -0,0 +1,232 @@
+import { ReuseEvaluationOutputV1Schema, validateReuseEvaluationOutput, } from './reuse-evaluation-output.js';
+import { attemptStructuredOutputRepair, } from '../adapter/structured-output-repair.js';
+/**
+ * Fail-closed error from the evaluation runner. Carries a structured reason
+ * and next action so the review surface can degrade OBSERVABLY (SPEC §9)
+ * instead of pretending the shortlist was semantically judged.
+ */
+export class ReuseEvaluationError extends Error {
+    reason;
+    nextAction;
+    detail;
+    repairAttempts;
+    constructor(args) {
+        super(args.message);
+        this.name = 'ReuseEvaluationError';
+        this.reason = args.reason;
+        this.nextAction = args.nextAction;
+        this.detail = args.detail;
+        this.repairAttempts = args.repairAttempts ?? 0;
+    }
+}
+const DEFAULT_TIMEOUT_MS = 30_000;
+const DEFAULT_POLL_INTERVAL_MS = 200;
+const MAX_POLLED_FIELD_CHARS = 2000;
+/** Bounded poll backoff (module-level: no runner state involved). */
+function sleep(ms) {
+    return new Promise((resolve) => {
+        setTimeout(resolve, ms);
+    });
+}
+export class ReuseEvaluationRunner {
+    runtimeAdapter;
+    timeoutMs;
+    maxRepairAttempts;
+    agentId;
+    pollIntervalMs;
+    constructor(deps, options = {}) {
+        this.runtimeAdapter = deps.runtimeAdapter;
+        this.timeoutMs = options.timeoutMs ?? DEFAULT_TIMEOUT_MS;
+        this.maxRepairAttempts = options.maxRepairAttempts ?? 1;
+        this.agentId = options.agentId ?? 'reuse-evaluation';
+        this.pollIntervalMs = options.pollIntervalMs ?? DEFAULT_POLL_INTERVAL_MS;
+    }
+    /**
+     * Role declaration delivered on the system channel (base-layer prompt,
+     * following CorrectionObserver's PRI-633 pattern). The "you recommend, the
+     * Owner decides" boundary is stated here so the model never narrates itself
+     * as a decision authority (SPEC §5).
+     */
+    static SYSTEM_PROMPT = [
+        'You are a semantic reuse evaluator for a principles-disciple knowledge base.',
+        'You compare a NEW candidate claim against EXISTING principles and RECOMMEND whether an existing principle already covers the same experience.',
+        'You are a recommender, NOT a decision maker: the Owner decides. Never claim a decision was made, never instruct that a principle be written, and never emit fields outside the requested JSON shape.',
+    ].join(' ');
+    /** Build the evaluation prompt (deterministic, bounded). */
+    static buildPrompt(input) {
+        const clip = (s) => (s.length > MAX_POLLED_FIELD_CHARS ? `${s.slice(0, MAX_POLLED_FIELD_CHARS)}…` : s);
+        const candidateBlock = [
+            `  text:    ${clip(input.candidate.text)}`,
+            `  trigger: ${clip(input.candidate.triggerPattern)}`,
+            `  action:  ${clip(input.candidate.action)}`,
+        ].join('\n');
+        const existingBlock = input.candidates.length === 0
+            ? '  (none)'
+            : input.candidates
+                .map((c, i) => [
+                `  [${i + 1}] principleId: ${c.principleId}`,
+                `      text:    ${clip(c.text)}`,
+                `      trigger: ${clip(c.triggerPattern)}`,
+                `      action:  ${clip(c.action)}`,
+            ].join('\n'))
+                .join('\n');
+        return [
+            '## TASK',
+            'Decide whether ONE existing principle already expresses the same experience as the candidate claim.',
+            '',
+            '## Candidate claim',
+            candidateBlock,
+            '',
+            `## Existing principles (${input.candidates.length})`,
+            existingBlock,
+            '',
+            '## Rules',
+            '- Judge SEMANTIC coverage, not word overlap: shared vocabulary alone is NOT the same experience.',
+            '- recommendation=reuse: an existing principle already covers this claim. Set selectedPrincipleId to that principle\'s id (required).',
+            '- recommendation=create: no existing principle covers this claim; a new one is warranted.',
+            '- recommendation=uncertain: the evidence is genuinely ambiguous. Do NOT set selectedPrincipleId.',
+            '- rationale: one or two sentences naming WHY the coverage holds or fails.',
+            '- confidence: 0..1 in your recommendation.',
+            '- Emit ONLY these fields: recommendation, selectedPrincipleId (only for reuse), rationale, confidence.',
+            '',
+            'Return strict JSON (no markdown):',
+            '{"recommendation": "reuse" | "create" | "uncertain", "selectedPrincipleId": string, "rationale": string, "confidence": number}',
+        ].join('\n');
+    }
+    /**
+     * Run one semantic evaluation and return the validated RECOMMENDATION.
+     *
+     * @throws ReuseEvaluationError — timeout / run failure / unparsable output /
+     *         contract violation surviving repair. Never a silent fallback.
+     */
+    async recommend(input) {
+        const payload = await this.invoke(ReuseEvaluationRunner.buildPrompt(input), 'evaluate');
+        const validated = validateReuseEvaluationOutput(payload);
+        if (validated.ok) {
+            return validated.output;
+        }
+        // Contract violation (unknown field, bad cross-field pairing, bad types):
+        // the schema itself is permissive about extra keys, so this is where the
+        // closed field set bites. One bounded repair round, then fail closed.
+        return this.repairAndValidate(payload, validated.reason);
+    }
+    /** Bounded repair using the SAME adapter (no second LLM path). */
+    async repairAndValidate(invalidOutput, reason) {
+        if (this.maxRepairAttempts <= 0) {
+            throw new ReuseEvaluationError({
+                reason: 'repair_failed',
+                message: `Reuse evaluation output violated its contract (${reason}) and repair is disabled`,
+                nextAction: 'Review the evaluation output contract; repair attempts are configured to 0',
+                detail: reason,
+            });
+        }
+        const schemaErrors = [{ path: '/', message: reason, value: invalidOutput }];
+        const repair = await attemptStructuredOutputRepair(invalidOutput, schemaErrors, {
+            // The repair LLM is the SAME adapter — this callback only marshals
+            // prompt in and raw JSON text out.
+            llmCaller: async (prompt) => {
+                const repaired = await this.invoke(prompt, 'repair');
+                return JSON.stringify(repaired);
+            },
+            schemaCheck: (value) => validateReuseEvaluationOutput(value).ok,
+        }, {
+            maxRepairAttempts: this.maxRepairAttempts,
+            schemaRef: 'reuse-evaluation-output-v1',
+            schemaJson: JSON.stringify(ReuseEvaluationOutputV1Schema),
+            requiredKeys: ['recommendation', 'rationale', 'confidence'],
+        });
+        if (repair.repaired && repair.output) {
+            // The repair loop's schemaCheck is our validator, but re-validate the
+            // returned value explicitly: a caller-visible contract must never rely
+            // on a callback's internal check alone.
+            const revalidated = validateReuseEvaluationOutput(repair.output);
+            if (revalidated.ok) {
+                return revalidated.output;
+            }
+        }
+        throw new ReuseEvaluationError({
+            reason: 'repair_failed',
+            message: `Reuse evaluation output violated its contract (${reason}) and could not be repaired`,
+            nextAction: 'Re-run the review; if it persists, inspect the evaluation prompt/runtime output format',
+            detail: `${reason}; ${repair.repairSummary}`,
+            repairAttempts: repair.attemptsUsed,
+        });
+    }
+    /**
+     * One adapter round-trip: start → bounded poll → fetch. This is the ONLY
+     * place the runner touches the runtime, for both the initial call and each
+     * repair attempt.
+     */
+    async invoke(prompt, phase) {
+        const runHandle = await this.runtimeAdapter.startRun({
+            agentSpec: { agentId: this.agentId, schemaVersion: 'v1' },
+            taskRef: { taskId: `reuse_eval_${phase}_${Date.now()}` },
+            inputPayload: prompt,
+            contextItems: [],
+            outputSchemaRef: 'reuse-evaluation-output-v1',
+            timeoutMs: this.timeoutMs,
+            systemPrompt: ReuseEvaluationRunner.SYSTEM_PROMPT,
+        });
+        const deadline = Date.now() + this.timeoutMs;
+        let terminal = false;
+        while (Date.now() < deadline) {
+            const status = await this.runtimeAdapter.pollRun(runHandle.runId);
+            if (status.status === 'succeeded') {
+                terminal = true;
+                break;
+            }
+            if (status.status === 'failed' || status.status === 'timed_out' || status.status === 'cancelled') {
+                throw new ReuseEvaluationError({
+                    reason: status.status === 'timed_out' ? 'timeout' : 'run_failed',
+                    message: `Reuse evaluation ${phase} run finished as '${status.status}'`,
+                    nextAction: 'Check the configured reuseEvaluation runtime profile and LLM channel health',
+                    detail: status.reason,
+                });
+            }
+            await sleep(this.pollIntervalMs);
+        }
+        if (!terminal) {
+            try {
+                await this.runtimeAdapter.cancelRun(runHandle.runId);
+            }
+            catch { /* best effort: the run is already past its budget */ }
+            throw new ReuseEvaluationError({
+                reason: 'timeout',
+                message: `Reuse evaluation ${phase} run exceeded ${this.timeoutMs}ms`,
+                nextAction: 'Raise reuseEvaluation.timeoutMs or check the configured runtime profile',
+            });
+        }
+        let output;
+        try {
+            output = await this.runtimeAdapter.fetchOutput(runHandle.runId);
+        }
+        catch (err) {
+            // The adapter validates against outputSchemaRef and can also perform its
+            // own internal repair (pi-ai does). If it still fails, the raw text is
+            // unavailable for a runner-level repair — surface it fail-closed.
+            throw new ReuseEvaluationError({
+                reason: 'output_invalid',
+                message: `Reuse evaluation ${phase} output could not be parsed or validated by the runtime`,
+                nextAction: 'Inspect the runtime output format; the adapter rejected it against reuse-evaluation-output-v1',
+                detail: err instanceof Error ? err.message : String(err),
+            });
+        }
+        if (!output || output.payload === undefined || output.payload === null) {
+            throw new ReuseEvaluationError({
+                reason: 'output_unavailable',
+                message: `Reuse evaluation ${phase} run produced no output payload`,
+                nextAction: 'Re-run the review; the runtime returned an empty payload',
+            });
+        }
+        return output.payload;
+    }
+}
+// Re-exported for callers that want a plain boolean pre-check without
+// constructing a runner (e.g. a surface deciding whether to show a warning).
+export function isValidReuseEvaluationOutput(value) {
+    // PRI-917 review (P2): delegate to the FULL trust boundary (closed field
+    // set + cross-field rules). The bare TypeBox schema is an open field set,
+    // so a raw Value.Check would pass outputs the contract must reject (T7a).
+    return validateReuseEvaluationOutput(value).ok;
+}
+//# sourceMappingURL=reuse-evaluation-runner.js.map

package/core/dist/runtime-v2/principle-reuse/reuse-evaluation-runner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reuse-evaluation-runner.js","sourceRoot":"","sources":["../../../src/runtime-v2/principle-reuse/reuse-evaluation-runner.ts"],"names":[],"mappings":"AAyBA,OAAO,EACL,6BAA6B,EAC7B,6BAA6B,GAE9B,MAAM,8BAA8B,CAAC;AACtC,OAAO,EACL,6BAA6B,GAE9B,MAAM,wCAAwC,CAAC;AAkChD;;;;GAIG;AACH,MAAM,OAAO,oBAAqB,SAAQ,KAAK;IAC7B,MAAM,CAA+B;IACrC,UAAU,CAAS;IACnB,MAAM,CAAU;IAChB,cAAc,CAAS;IAEvC,YAAY,IAMX;QACC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,IAAI,CAAC,CAAC;IACjD,CAAC;CACF;AAoBD,MAAM,kBAAkB,GAAG,MAAM,CAAC;AAClC,MAAM,wBAAwB,GAAG,GAAG,CAAC;AACrC,MAAM,sBAAsB,GAAG,IAAI,CAAC;AAEpC,qEAAqE;AACrE,SAAS,KAAK,CAAC,EAAU;IACvB,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QAC7B,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,OAAO,qBAAqB;IACf,cAAc,CAAmB;IACjC,SAAS,CAAS;IAClB,iBAAiB,CAAS;IAC1B,OAAO,CAAS;IAChB,cAAc,CAAS;IAExC,YAAY,IAA+B,EAAE,OAAO,GAAiC,EAAE;QACrF,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;QAC1C,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,kBAAkB,CAAC;QACzD,IAAI,CAAC,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,IAAI,CAAC,CAAC;QACxD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,kBAAkB,CAAC;QACrD,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,wBAAwB,CAAC;IAC3E,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAU,aAAa,GAAG;QAC9B,8EAA8E;QAC9E,+IAA+I;QAC/I,sMAAsM;KACvM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAEZ,4DAA4D;IAC5D,MAAM,CAAC,WAAW,CAAC,KAA2B;QAC5C,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,sBAAsB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvH,MAAM,cAAc,GAAG;YACrB,cAAc,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;YAC1C,cAAc,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,cAAc,CAAC,EAAE;YACpD,cAAc,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;SAC7C,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACb,MAAM,aAAa,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YACjD,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,KAAK,CAAC,UAAU;iBACf,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACb,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,WAAW,EAAE;gBAC5C,kBAAkB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;gBAChC,kBAAkB,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,EAAE;gBAC1C,kBAAkB,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE;aACnC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBACZ,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,OAAO;YACL,SAAS;YACT,qGAAqG;YACrG,EAAE;YACF,oBAAoB;YACpB,cAAc;YACd,EAAE;YACF,2BAA2B,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG;YACrD,aAAa;YACb,EAAE;YACF,UAAU;YACV,kGAAkG;YAClG,sIAAsI;YACtI,2FAA2F;YAC3F,kGAAkG;YAClG,2EAA2E;YAC3E,4CAA4C;YAC5C,wGAAwG;YACxG,EAAE;YACF,mCAAmC;YACnC,gIAAgI;SACjI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,SAAS,CAAC,KAA2B;QACzC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,UAAU,CAAC,CAAC;QACxF,MAAM,SAAS,GAAG,6BAA6B,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC;YACjB,OAAO,SAAS,CAAC,MAAM,CAAC;QAC1B,CAAC;QAED,0EAA0E;QAC1E,yEAAyE;QACzE,sEAAsE;QACtE,OAAO,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC;IAED,kEAAkE;IAC1D,KAAK,CAAC,iBAAiB,CAC7B,aAAsB,EACtB,MAAc;QAEd,IAAI,IAAI,CAAC,iBAAiB,IAAI,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,oBAAoB,CAAC;gBAC7B,MAAM,EAAE,eAAe;gBACvB,OAAO,EAAE,kDAAkD,MAAM,0BAA0B;gBAC3F,UAAU,EAAE,4EAA4E;gBACxF,MAAM,EAAE,MAAM;aACf,CAAC,CAAC;QACL,CAAC;QACD,MAAM,YAAY,GAA4B,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC;QACrG,MAAM,MAAM,GAAG,MAAM,6BAA6B,CAChD,aAAa,EACb,YAAY,EACZ;YACE,mEAAmE;YACnE,mCAAmC;YACnC,SAAS,EAAE,KAAK,EAAE,MAAc,EAA0B,EAAE;gBAC1D,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBACrD,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;YAClC,CAAC;YACD,WAAW,EAAE,CAAC,KAAc,EAAE,EAAE,CAAC,6BAA6B,CAAC,KAAK,CAAC,CAAC,EAAE;SACzE,EACD;YACE,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;YACzC,SAAS,EAAE,4BAA4B;YACvC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,6BAA6B,CAAC;YACzD,YAAY,EAAE,CAAC,gBAAgB,EAAE,WAAW,EAAE,YAAY,CAAC;SAC5D,CACF,CAAC;QAEF,IAAI,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACrC,sEAAsE;YACtE,uEAAuE;YACvE,wCAAwC;YACxC,MAAM,WAAW,GAAG,6BAA6B,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACjE,IAAI,WAAW,CAAC,EAAE,EAAE,CAAC;gBACnB,OAAO,WAAW,CAAC,MAAM,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,MAAM,IAAI,oBAAoB,CAAC;YAC7B,MAAM,EAAE,eAAe;YACvB,OAAO,EAAE,kDAAkD,MAAM,6BAA6B;YAC9F,UAAU,EAAE,wFAAwF;YACpG,MAAM,EAAE,GAAG,MAAM,KAAK,MAAM,CAAC,aAAa,EAAE;YAC5C,cAAc,EAAE,MAAM,CAAC,YAAY;SACpC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,MAAM,CAAC,MAAc,EAAE,KAA4B;QAC/D,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC;YACnD,SAAS,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE;YACzD,OAAO,EAAE,EAAE,MAAM,EAAE,cAAc,KAAK,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE;YACxD,YAAY,EAAE,MAAM;YACpB,YAAY,EAAE,EAAE;YAChB,eAAe,EAAE,4BAA4B;YAC7C,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,YAAY,EAAE,qBAAqB,CAAC,aAAa;SAClD,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC;QAC7C,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAClE,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBAClC,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM;YACR,CAAC;YACD,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBACjG,MAAM,IAAI,oBAAoB,CAAC;oBAC7B,MAAM,EAAE,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY;oBAChE,OAAO,EAAE,oBAAoB,KAAK,qBAAqB,MAAM,CAAC,MAAM,GAAG;oBACvE,UAAU,EAAE,6EAA6E;oBACzF,MAAM,EAAE,MAAM,CAAC,MAAM;iBACtB,CAAC,CAAC;YACL,CAAC;YACD,MAAM,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,IAAI,CAAC;gBACH,MAAM,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACvD,CAAC;YAAC,MAAM,CAAC,CAAC,qDAAqD,CAAC,CAAC;YACjE,MAAM,IAAI,oBAAoB,CAAC;gBAC7B,MAAM,EAAE,SAAS;gBACjB,OAAO,EAAE,oBAAoB,KAAK,iBAAiB,IAAI,CAAC,SAAS,IAAI;gBACrE,UAAU,EAAE,yEAAyE;aACtF,CAAC,CAAC;QACL,CAAC;QAED,IAAI,MAAoC,CAAC;QACzC,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAClE,CAAC;QAAC,OAAO,GAAY,EAAE,CAAC;YACtB,yEAAyE;YACzE,uEAAuE;YACvE,kEAAkE;YAClE,MAAM,IAAI,oBAAoB,CAAC;gBAC7B,MAAM,EAAE,gBAAgB;gBACxB,OAAO,EAAE,oBAAoB,KAAK,yDAAyD;gBAC3F,UAAU,EAAE,+FAA+F;gBAC3G,MAAM,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;aACzD,CAAC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YACvE,MAAM,IAAI,oBAAoB,CAAC;gBAC7B,MAAM,EAAE,oBAAoB;gBAC5B,OAAO,EAAE,oBAAoB,KAAK,iCAAiC;gBACnE,UAAU,EAAE,0DAA0D;aACvE,CAAC,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;CACF;AAED,sEAAsE;AACtE,6EAA6E;AAC7E,MAAM,UAAU,4BAA4B,CAAC,KAAc;IACzD,yEAAyE;IACzE,0EAA0E;IAC1E,0EAA0E;IAC1E,OAAO,6BAA6B,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AACjD,CAAC"}

package/core/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/core/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/core/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