@graphrefly/graphrefly 0.28.0 → 0.30.0

package/dist/{index-DL-rYJrx.d.cts → index-D7XxY1Ff.d.cts}

@@ -1,4 +1,4 @@
-import { a as Node } from './node-Cc1TniY8.cjs';
+import { a as Node } from './node-BVV7G1bq.cjs';
 
 /**
  * Subscribe to a read-only `Node<T>` as a React value. Re-renders on node value settlement.

package/dist/{index-DAlweici.d.ts → index-D9HrBx2J.d.ts}

@@ -1,5 +1,5 @@
-import { a as Node } from './node-Cc1TniY8.js';
-import { a as GraphOptions, G as Graph } from './graph-BZGRXwOm.js';
+import { a as Node } from './node-BVV7G1bq.js';
+import { a as GraphOptions, G as Graph } from './graph-CWeI0aHd.js';
 
 /**
  * Domain templates (roadmap §8.2).

package/dist/{index-fM6y00vT.d.cts → index-D9Y_u6BG.d.cts}

@@ -1,6 +1,6 @@
-import { M as MeasurementAdapter, P as PreparedSegment, L as LineBreaksResult, C as CharPosition, a as LayoutCursor, I as Interval, b as LayoutLine, c as LayoutNextLineContext, d as LayoutNextLineResult, R as ReactiveLayoutBundle, e as ReactiveLayoutOptions, S as SegmentBreakKind, f as SegmentMeasureStats, g as analyzeAndMeasure, h as carveTextLineSlots, i as computeCharPositions, j as computeLineBreaks, l as layoutNextLine, r as reactiveLayout } from './reactive-layout-CpYb5qLP.cjs';
-import { a as Node } from './node-Cc1TniY8.cjs';
-import { G as Graph } from './graph-D48Qw9Cg.cjs';
+import { M as MeasurementAdapter, P as PreparedSegment, L as LineBreaksResult, C as CharPosition, a as LayoutCursor, I as Interval, b as LayoutLine, c as LayoutNextLineContext, d as LayoutNextLineResult, R as ReactiveLayoutBundle, e as ReactiveLayoutOptions, S as SegmentBreakKind, f as SegmentMeasureStats, g as analyzeAndMeasure, h as carveTextLineSlots, i as computeCharPositions, j as computeLineBreaks, l as layoutNextLine, r as reactiveLayout } from './reactive-layout-5oEn8lHM.cjs';
+import { a as Node } from './node-BVV7G1bq.cjs';
+import { G as Graph } from './graph-C4Uxwv0T.cjs';
 
 /**
  * MeasurementAdapter implementations (roadmap §7.1 — pluggable backends).

package/dist/{index-DcXZBF5a.d.cts → index-DBQUKh59.d.cts}

@@ -1,7 +1,7 @@
-import { P as PolicyRuleData, a as Node, A as Actor } from './node-Cc1TniY8.cjs';
-import { G as Graph, a as GraphOptions, b as GraphDescribeOptions, c as GraphDescribeOutput, D as DescribeFilter } from './graph-D48Qw9Cg.cjs';
-import { P as PolicyEnforcerGraph, a as PolicyViolation } from './index-C73n7lo-.cjs';
-import { T as TopicGraph } from './index-DyxjtScX.cjs';
+import { P as PolicyRuleData, a as Node, A as Actor } from './node-BVV7G1bq.cjs';
+import { G as Graph, a as GraphOptions, b as GraphDescribeOptions, c as GraphDescribeOutput, D as DescribeFilter } from './graph-C4Uxwv0T.cjs';
+import { P as PolicyEnforcerGraph, a as PolicyViolation } from './index-iBp74eGU.cjs';
+import { T as TopicGraph } from './index-B-z8WaSd.cjs';
 
 /**
  * Composable safety layer (roadmap §9.0b).

package/dist/{index-D_NwnRYS.d.cts → index-DDo-eqQ4.d.cts}

@@ -1,5 +1,5 @@
 import { Ref, WatchSource } from 'vue';
-import { a as Node } from './node-Cc1TniY8.cjs';
+import { a as Node } from './node-BVV7G1bq.cjs';
 
 /**
  * Subscribe to a read-only `Node<T>` as a Vue `Ref<T>`. Auto-unsubscribes on scope disposal.

package/dist/{index-m-yHof5p.d.ts → index-DGb1awva.d.ts}

@@ -1,9 +1,9 @@
-import { T as ToObservableOptions, t as toObservable } from './observable-Ct-gJ9jI.js';
+import { T as ToObservableOptions, t as toObservable } from './observable-ITikPXz3.js';
 import { OnModuleInit, OnModuleDestroy, ExecutionContext, CanActivate, DynamicModule } from '@nestjs/common';
 import { ModuleRef } from '@nestjs/core';
-import { G as Graph, d as GraphPersistSnapshot } from './graph-BZGRXwOm.js';
-import { A as Actor } from './node-Cc1TniY8.js';
-import { C as CqrsOptions, a as CqrsGraph, E as EventStoreAdapter } from './index-sm373fsH.js';
+import { G as Graph, d as GraphPersistSnapshot } from './graph-CWeI0aHd.js';
+import { A as Actor } from './node-BVV7G1bq.js';
+import { C as CqrsOptions, a as CqrsGraph, E as EventStoreAdapter } from './index-IZ3l_vQ9.js';
 
 /** Class constructor key for decorator registries and Nest `ModuleRef.get()`. */
 type DecoratorHostConstructor = abstract new (...args: unknown[]) => unknown;

package/dist/{index-DxsnAMWD.d.cts → index-DR3gf_DG.d.cts}

@@ -1,12 +1,12 @@
-import { i as index$2 } from './index-CRO83MmV.cjs';
-import { i as index$3 } from './index-Cyojz0AE.cjs';
-import { i as index$4 } from './index-cByzxQIC.cjs';
-import { i as index$5 } from './index-DL-rYJrx.cjs';
-import { a as Node } from './node-Cc1TniY8.cjs';
-import { i as index$6 } from './index-B_agccPe.cjs';
-import { i as index$7 } from './index-B2pwesl9.cjs';
-import { i as index$8 } from './index-D_NwnRYS.cjs';
-import { i as index$9 } from './index-Oi8d8w4R.cjs';
+import { i as index$2 } from './index-BydMDMf7.cjs';
+import { i as index$3 } from './index-CIXaiYDE.cjs';
+import { i as index$4 } from './index-yIdWFo2b.cjs';
+import { i as index$5 } from './index-D7XxY1Ff.cjs';
+import { a as Node } from './node-BVV7G1bq.cjs';
+import { i as index$6 } from './index-FBqTfL_S.cjs';
+import { i as index$7 } from './index-CDK5RsV5.cjs';
+import { i as index$8 } from './index-DDo-eqQ4.cjs';
+import { i as index$9 } from './index-CRAkoq-y.cjs';
 
 /**
  * Options for creating signals.

package/dist/{index-dtN7YA2x.d.cts → index-DVNLe3pS.d.cts}

@@ -1,6 +1,6 @@
-import { a as Node, N as NodeOptions, c as NodeActions } from './node-Cc1TniY8.cjs';
-import { D as DerivedFn } from './sugar-BV0htudb.cjs';
-import { G as Graph, a as GraphOptions } from './graph-D48Qw9Cg.cjs';
+import { a as Node, N as NodeOptions, c as NodeActions } from './node-BVV7G1bq.cjs';
+import { D as DerivedFn } from './sugar-CqR6DJ7v.cjs';
+import { G as Graph, a as GraphOptions } from './graph-C4Uxwv0T.cjs';
 
 /**
  * Orchestration patterns (roadmap §4.1).

package/dist/{index-Btib9rsU.d.ts → index-Dljd76bC.d.ts}

@@ -1,7 +1,9 @@
-import { a as Node } from './node-Cc1TniY8.js';
-import { T as TopicGraph } from './index-B0c4cmIO.js';
-import { G as Graph, s as GraphProfileResult, r as GraphProfileOptions } from './graph-BZGRXwOm.js';
-import { G as GateController } from './index-Czq6ynh8.js';
+import { a as Node } from './node-BVV7G1bq.js';
+import { T as TopicGraph } from './index-CvS9IuTG.js';
+import { E as Evaluator, D as DatasetItem, a as EvalResult$1, R as RefineStrategy, b as RefineStatus, c as RefineLoopOptions } from './index-CfFYyLR8.js';
+import { G as Graph, s as GraphProfileResult, r as GraphProfileOptions } from './graph-CWeI0aHd.js';
+import { L as LLMAdapter } from './types-u64Ose53.js';
+import { G as GateController } from './index-CFW32Dy1.js';
 
 /**
  * Harness wiring types (roadmap §9.0).
@@ -12,6 +14,7 @@ import { G as GateController } from './index-Czq6ynh8.js';
  *
  * @module
  */
+
 /** Sources that can produce intake items. */
 type IntakeSource = "eval" | "test" | "human" | "code-change" | "hypothesis" | "parity";
 /** Severity levels for intake items. */
@@ -66,12 +69,26 @@ declare function strategyKey(rootCause: RootCause, intervention: Intervention):
 type ExecuteOutput = {
     outcome: "success" | "failure" | "partial";
     detail: string;
+    /**
+     * Optional opaque artifact that a custom executor (e.g. `refineExecutor`)
+     * may attach so downstream verifiers can re-run evaluation against the
+     * thing that was produced. LLM-backed default executors never populate
+     * this — it's an escape hatch for reactive executors carrying structured
+     * output (a refined prompt, a patched spec, a generated template, ...).
+     */
+    artifact?: unknown;
 };
 /** Full execution result assembled downstream (LLM output + context). */
 interface ExecutionResult {
     item: TriagedItem;
     outcome: "success" | "failure" | "partial";
     detail: string;
+    /**
+     * Passthrough of {@link ExecuteOutput.artifact} when the executor emitted
+     * one. Reactive executors like `refineExecutor` populate this; LLM-backed
+     * default executors leave it undefined.
+     */
+    artifact?: unknown;
 }
 /** Whether an error is self-correctable (fast-retry) or structural (full loop). */
 type ErrorClass = "self-correctable" | "structural";
@@ -87,6 +104,16 @@ interface VerifyResult {
     findings: string[];
     errorClass?: ErrorClass;
 }
+/**
+ * Verifier output shape — what a custom verifier emits. The harness
+ * assembles this into the full {@link VerifyResult} using the triaged
+ * item + execute output sampled from `executeContextNode`.
+ */
+interface VerifyOutput {
+    verified: boolean;
+    findings: string[];
+    errorClass?: ErrorClass;
+}
 /** Configurable signals for priority scoring. */
 interface PrioritySignals {
     /** Per-severity base weight (default: critical=100, high=70, medium=40, low=10). */
@@ -113,16 +140,63 @@ interface QueueConfig {
 }
 /** Default queue configurations. */
 declare const DEFAULT_QUEUE_CONFIGS: Record<QueueRoute, QueueConfig>;
+/**
+ * Pluggable EXECUTE slot. Given the reactive `executeInput` stream of
+ * triaged items, produce a stream of `ExecuteOutput` decisions.
+ *
+ * **Contract** (see design note in `docs/optimizations.md` / session log):
+ * 1. Emit DATA exactly once per completed execution — not on input arrival.
+ * 2. Cancel in-flight work when a new item supersedes the current one
+ *    (`switchMap` is the idiomatic pattern).
+ * 3. Do not bypass `input.cache` — the harness pairs output with item via
+ *    `withLatestFrom(output, input)`. A side-state mirror of the item can
+ *    desync under nested-drain ordering.
+ * 4. The returned node IS the primary of a subsequent `withLatestFrom`;
+ *    firing on input arrival (rather than result completion) causes verify
+ *    to pair with a stale/null ExecuteOutput.
+ *
+ * `refineExecutor` makes all four rules structurally unreachable.
+ */
+type HarnessExecutor = (input: Node<TriagedItem | null>) => Node<ExecuteOutput | null>;
+/**
+ * Pluggable VERIFY slot. Receives `[executeOutput, triagedItem]` pairs
+ * sampled via `withLatestFrom(executeNode, executeInput)` and produces
+ * `VerifyOutput` decisions.
+ *
+ * Same contract rules 1–3 as {@link HarnessExecutor}. Rule 4 does not
+ * apply (verify output isn't a primary to a further withLatestFrom).
+ *
+ * `evalVerifier` handles the re-evaluation case against affected eval tasks.
+ */
+type HarnessVerifier = (context: Node<[ExecuteOutput | null, TriagedItem | null]>) => Node<VerifyOutput | null>;
 /** Options for {@link harnessLoop}. */
 interface HarnessLoopOptions {
-    /** LLM adapter for promptNode-based stages (triage, execute, verify, reflect). */
+    /** LLM adapter for promptNode-based stages (triage + any default executor/verifier). */
     adapter: unknown;
     /** Custom triage prompt (receives IntakeItem + strategy model as context). */
     triagePrompt?: string | ((...args: unknown[]) => string);
-    /** Custom execute prompt. */
+    /**
+     * Execute prompt — sugar over the default LLM executor. Ignored when
+     * `executor` is set.
+     */
     executePrompt?: string | ((...args: unknown[]) => string);
-    /** Custom verify prompt. */
+    /**
+     * Verify prompt — sugar over the default LLM verifier. Ignored when
+     * `verifier` is set.
+     */
     verifyPrompt?: string | ((...args: unknown[]) => string);
+    /**
+     * Pluggable EXECUTE slot. When omitted, the harness uses a `promptNode`
+     * driven by `adapter` + `executePrompt`. Replace to plug in a
+     * `refineExecutor`, tool-using agent, or any reactive execution pipeline.
+     */
+    executor?: HarnessExecutor;
+    /**
+     * Pluggable VERIFY slot. When omitted, the harness uses a `promptNode`
+     * driven by `adapter` + `verifyPrompt`. Replace to plug in an
+     * `evalVerifier` that re-runs affected eval tasks.
+     */
+    verifier?: HarnessVerifier;
     /** Per-queue configuration overrides. */
     queues?: Partial<Record<QueueRoute, QueueConfig>>;
     /** Priority scoring signals. */
@@ -344,6 +418,87 @@ interface NotifyEffectOptions {
  */
 declare function notifyEffect<T>(topic: TopicGraph<T>, transport: NotifyTransport<T>, opts?: NotifyEffectOptions): Node<unknown>;
 
+/**
+ * evalVerifier — re-run the affected eval tasks against the execute-stage
+ * artifact instead of asking an LLM to opine on the fix.
+ *
+ * Pairs naturally with {@link refineExecutor}: refineExecutor emits an
+ * `ExecuteOutput.artifact` holding the converged candidate; evalVerifier
+ * pulls it out via `extractArtifact` and feeds a single-candidate batch
+ * into the same `Evaluator<T>` shape that `refineLoop` used. Consistent
+ * scoring between EXECUTE and VERIFY — no "LLM said it looks fine" gap.
+ *
+ * Per-item lifecycle mirrors `refineExecutor`: each new execute-context
+ * pair mounts a fresh eval subgraph inside `switchMap`, so a superseding
+ * item cancels the prior run.
+ *
+ * @module
+ */
+
+/** Summary of the re-eval wave passed to a custom `toOutput` mapper. */
+interface EvalVerifierSummary {
+    readonly scores: readonly EvalResult$1[];
+    readonly meanScore: number;
+    readonly passCount: number;
+    readonly total: number;
+    readonly threshold: number;
+    /**
+     * True when the EXECUTE stage did not produce an artifact (i.e.
+     * `extractArtifact` returned `null` / `undefined`). Downstream mappers
+     * can distinguish this from "evaluator ran but everything scored zero".
+     * When `true`, `scores` / `total` / `passCount` are all zero and
+     * `meanScore` is `-Infinity`.
+     */
+    readonly missingArtifact?: boolean;
+}
+/** Configuration for {@link evalVerifier}. */
+interface EvalVerifierConfig<T> {
+    /**
+     * Pull the artifact that should be re-evaluated out of the execute-stage
+     * output. Default: `(exec) => exec.artifact as T` — works out-of-the-box
+     * with `refineExecutor` (which populates `artifact` by default).
+     *
+     * **Type trust:** the default cast assumes the caller's executor wrote
+     * a `T`-shaped value to `ExecuteOutput.artifact`. A wrong-typed artifact
+     * surfaces as a runtime error inside `evaluator`, not here — supply a
+     * narrowing `extractArtifact` if you need stricter validation.
+     */
+    extractArtifact?: (exec: ExecuteOutput, item: TriagedItem) => T | null | undefined;
+    /**
+     * Reactive evaluator — same contract as `refineLoop`'s `Evaluator<T>`.
+     * Typically this is the SAME evaluator configured inside `refineExecutor`
+     * so EXECUTE and VERIFY scoring stay consistent.
+     */
+    evaluator: Evaluator<T>;
+    /**
+     * Resolve which dataset rows to score this verification against. Use
+     * `affectedTaskFilter` or hand-roll per-item subset logic. Default:
+     * empty array (verifier emits a findings entry explaining this).
+     */
+    datasetFor: (item: TriagedItem) => readonly DatasetItem[];
+    /** Mean score required to pass verification. Default `0.5`. */
+    threshold?: number;
+    /** Optional output mapper — override the default findings / errorClass shape. */
+    toOutput?: (summary: EvalVerifierSummary) => VerifyOutput;
+    /** Node name prefix for introspection. Default `"eval-verifier"`. */
+    name?: string;
+}
+/**
+ * Build a {@link HarnessVerifier} that re-runs the eval suite against the
+ * artifact produced by EXECUTE.
+ *
+ * @example Pair with refineExecutor for end-to-end eval consistency.
+ * ```ts
+ * const evaluator: Evaluator<CatalogEntry> = (cands, ds) => runEval(cands, ds);
+ * const harness = harnessLoop("repair", {
+ *   adapter,
+ *   executor: refineExecutor({ ..., evaluator, ...strategyConfig }),
+ *   verifier: evalVerifier({ evaluator, datasetFor, threshold: 0.8 }),
+ * });
+ * ```
+ */
+declare function evalVerifier<T>(config: EvalVerifierConfig<T>): HarnessVerifier;
+
 /**
  * Strategy model and priority scoring (roadmap §9.0).
  *
@@ -396,6 +551,30 @@ declare function priorityScore(item: Node<TriagedItem>, strategy: Node<StrategyS
  * @module
  */
 
+/**
+ * Build the default EXECUTE slot — a `promptNode` driven by the given
+ * adapter and prompt template. This is the factory behind the harness's
+ * zero-config execute stage.
+ *
+ * Obeys all four rules of the {@link HarnessExecutor} contract: `promptNode`
+ * internally uses `switchMap` + `fromAny` for cancellation (rule 2), emits
+ * once per resolved LLM invocation (rules 1 + 4), and reads the triaged
+ * item exclusively through its `deps` argument (rule 3).
+ *
+ * @param adapter - LLMAdapter for the execute call.
+ * @param prompt  - Prompt template (string or `(item) => string`). Defaults
+ *                   to the harness's built-in execute prompt.
+ */
+declare function defaultLlmExecutor(adapter: LLMAdapter, prompt?: HarnessLoopOptions["executePrompt"]): HarnessExecutor;
+/**
+ * Build the default VERIFY slot — a `promptNode` that reviews the
+ * `[executeOutput, item]` pair from the execute-context.
+ *
+ * @param adapter - LLMAdapter for the verify call.
+ * @param prompt  - Prompt template. Defaults to the harness's built-in
+ *                   verify prompt (receives the full pair, extracts both).
+ */
+declare function defaultLlmVerifier(adapter: LLMAdapter, prompt?: HarnessLoopOptions["verifyPrompt"]): HarnessVerifier;
 /** The graph returned by {@link harnessLoop}. */
 declare class HarnessGraph extends Graph {
     /** Intake topic — publish items here to enter the loop. */
@@ -461,6 +640,82 @@ interface HarnessProfileResult extends GraphProfileResult {
  */
 declare function harnessProfile(harness: HarnessGraph, opts?: GraphProfileOptions): HarnessProfileResult;
 
+/**
+ * refineExecutor — bridge a `refineLoop` into the harness EXECUTE slot.
+ *
+ * Per-item lifecycle (Option A from the design note): on each new triaged
+ * item, a fresh `refineLoop` is mounted via `switchMap`; when the loop
+ * reaches a terminal status (`converged` / `budget` / `errored`), the
+ * executor emits a single `ExecuteOutput`. The switchMap cancels any
+ * in-flight loop when a newer item supersedes it.
+ *
+ * This shape makes all four {@link HarnessExecutor} contract rules
+ * structurally unreachable:
+ *  1. Terminal-status filter guarantees exactly one `ExecuteOutput` per
+ *     completed refinement run.
+ *  2. `switchMap` cancels the prior inner loop when the next item arrives.
+ *  3. The item is captured in the switchMap closure, not mirrored to a
+ *     side-state.
+ *  4. The wrapped `derived([status, best, score], ...)` only returns
+ *     non-null on terminal transitions — it never emits on input arrival.
+ *
+ * **Cross-item learning:** Option A creates a fresh refineLoop per item,
+ * so `errorCritique`-style failure sampling does NOT accumulate across
+ * items sharing a `rootCause`. A persistent-loop + re-seed surface is
+ * tracked in `docs/optimizations.md` as the long-term follow-up.
+ *
+ * @module
+ */
+
+/** Terminal-run snapshot passed to a custom `toOutput` mapper. */
+interface RefineExecutorResult<T> {
+    /** Best candidate the inner loop converged on. `null` if no candidates were scored. */
+    readonly best: T | null;
+    /** Aggregate score at termination. `-Infinity` if the batch was empty. */
+    readonly score: number;
+    /** Reason the loop terminated. */
+    readonly status: RefineStatus;
+}
+/** Configuration for {@link refineExecutor}. */
+interface RefineExecutorConfig<T> {
+    /** Map a triaged item to the seed candidate (e.g. a catalog entry, prompt, patch). */
+    seedFrom: (item: TriagedItem) => T;
+    /** Reactive evaluator — same shape as passed to `refineLoop`. */
+    evaluator: Evaluator<T>;
+    /** Strategy (e.g. `errorCritique(teacher)`). Applied to every item's inner loop. */
+    strategy: RefineStrategy<T>;
+    /** Map a triaged item to the dataset rows the evaluator should score against. */
+    datasetFor: (item: TriagedItem) => readonly DatasetItem[];
+    /**
+     * Optional mapper from the inner loop's terminal snapshot to an
+     * `ExecuteOutput`. Default: converged→success, budget→partial,
+     * errored→failure.
+     */
+    toOutput?: (result: RefineExecutorResult<T>) => ExecuteOutput;
+    /** Convergence / budget options forwarded to each inner `refineLoop`. */
+    refine?: Omit<RefineLoopOptions, "dataset" | "name">;
+    /** Node name prefix for introspection. Default `"refine-executor"`. */
+    name?: string;
+}
+/**
+ * Build a {@link HarnessExecutor} backed by a `refineLoop` per triaged item.
+ *
+ * @example Eval-driven repair loop in the harness EXECUTE slot.
+ * ```ts
+ * const harness = harnessLoop("repair", {
+ *   adapter,
+ *   executor: refineExecutor({
+ *     seedFrom: (item) => initialCatalogEntry(item),
+ *     datasetFor: (item) => pickAffectedTasks(item, allTasks),
+ *     evaluator: (cands, tasks) => runEvalBatch(cands, tasks),
+ *     strategy: errorCritique({ teacher, width: 3 }),
+ *     refine: { maxIterations: 5, minScore: 0.9 },
+ *   }),
+ * });
+ * ```
+ */
+declare function refineExecutor<T>(config: RefineExecutorConfig<T>): HarnessExecutor;
+
 /**
  * Harness pipeline trace — thin sugar over `graph.observe({ format: "stage-log" })`.
  *
@@ -555,14 +810,18 @@ type index_EvalJudgeScore = EvalJudgeScore;
 type index_EvalResult = EvalResult;
 type index_EvalTaskDelta = EvalTaskDelta;
 type index_EvalTaskResult = EvalTaskResult;
+type index_EvalVerifierConfig<T> = EvalVerifierConfig<T>;
+type index_EvalVerifierSummary = EvalVerifierSummary;
 type index_ExecuteOutput = ExecuteOutput;
 type index_ExecutionResult = ExecutionResult;
+type index_HarnessExecutor = HarnessExecutor;
 type index_HarnessGraph = HarnessGraph;
 declare const index_HarnessGraph: typeof HarnessGraph;
 type index_HarnessLoopOptions = HarnessLoopOptions;
 type index_HarnessProfileResult = HarnessProfileResult;
 type index_HarnessTraceHandle = HarnessTraceHandle;
 type index_HarnessTraceOptions = HarnessTraceOptions;
+type index_HarnessVerifier = HarnessVerifier;
 type index_IntakeBridgeOptions = IntakeBridgeOptions;
 type index_IntakeItem = IntakeItem;
 type index_IntakeSource = IntakeSource;
@@ -574,6 +833,8 @@ type index_PrioritySignals = PrioritySignals;
 declare const index_QUEUE_NAMES: typeof QUEUE_NAMES;
 type index_QueueConfig = QueueConfig;
 type index_QueueRoute = QueueRoute;
+type index_RefineExecutorConfig<T> = RefineExecutorConfig<T>;
+type index_RefineExecutorResult<T> = RefineExecutorResult<T>;
 type index_RootCause = RootCause;
 type index_Severity = Severity;
 type index_StrategyEntry = StrategyEntry;
@@ -585,23 +846,28 @@ type index_TraceDetail = TraceDetail;
 type index_TraceEvent = TraceEvent;
 type index_TraceEventType = TraceEventType;
 type index_TriagedItem = TriagedItem;
+type index_VerifyOutput = VerifyOutput;
 type index_VerifyResult = VerifyResult;
 declare const index_affectedTaskFilter: typeof affectedTaskFilter;
 declare const index_beforeAfterCompare: typeof beforeAfterCompare;
 declare const index_codeChangeBridge: typeof codeChangeBridge;
 declare const index_createIntakeBridge: typeof createIntakeBridge;
 declare const index_defaultErrorClassifier: typeof defaultErrorClassifier;
+declare const index_defaultLlmExecutor: typeof defaultLlmExecutor;
+declare const index_defaultLlmVerifier: typeof defaultLlmVerifier;
 declare const index_evalIntakeBridge: typeof evalIntakeBridge;
 declare const index_evalSource: typeof evalSource;
+declare const index_evalVerifier: typeof evalVerifier;
 declare const index_harnessLoop: typeof harnessLoop;
 declare const index_harnessProfile: typeof harnessProfile;
 declare const index_harnessTrace: typeof harnessTrace;
 declare const index_notifyEffect: typeof notifyEffect;
 declare const index_priorityScore: typeof priorityScore;
+declare const index_refineExecutor: typeof refineExecutor;
 declare const index_strategyKey: typeof strategyKey;
 declare const index_strategyModel: typeof strategyModel;
 declare namespace index {
-  export { type index_CodeChange as CodeChange, type index_CodeChangeBridgeOptions as CodeChangeBridgeOptions, index_DEFAULT_DECAY_RATE as DEFAULT_DECAY_RATE, index_DEFAULT_QUEUE_CONFIGS as DEFAULT_QUEUE_CONFIGS, index_DEFAULT_SEVERITY_WEIGHTS as DEFAULT_SEVERITY_WEIGHTS, type index_ErrorClass as ErrorClass, type index_ErrorClassifier as ErrorClassifier, type index_EvalDelta as EvalDelta, type index_EvalIntakeBridgeOptions as EvalIntakeBridgeOptions, type index_EvalJudgeScore as EvalJudgeScore, type index_EvalResult as EvalResult, type index_EvalTaskDelta as EvalTaskDelta, type index_EvalTaskResult as EvalTaskResult, type index_ExecuteOutput as ExecuteOutput, type index_ExecutionResult as ExecutionResult, index_HarnessGraph as HarnessGraph, type index_HarnessLoopOptions as HarnessLoopOptions, type index_HarnessProfileResult as HarnessProfileResult, type index_HarnessTraceHandle as HarnessTraceHandle, type index_HarnessTraceOptions as HarnessTraceOptions, type index_IntakeBridgeOptions as IntakeBridgeOptions, type index_IntakeItem as IntakeItem, type index_IntakeSource as IntakeSource, type index_Intervention as Intervention, type index_LintError as LintError, type index_NotifyEffectOptions as NotifyEffectOptions, type index_NotifyTransport as NotifyTransport, type index_PrioritySignals as PrioritySignals, index_QUEUE_NAMES as QUEUE_NAMES, type index_QueueConfig as QueueConfig, type index_QueueRoute as QueueRoute, type index_RootCause as RootCause, type index_Severity as Severity, type index_StrategyEntry as StrategyEntry, type index_StrategyKey as StrategyKey, type index_StrategyModelBundle as StrategyModelBundle, type index_StrategySnapshot as StrategySnapshot, type index_TestFailure as TestFailure, type index_TraceDetail as TraceDetail, type index_TraceEvent as TraceEvent, type index_TraceEventType as TraceEventType, type index_TriagedItem as TriagedItem, type index_VerifyResult as VerifyResult, index_affectedTaskFilter as affectedTaskFilter, index_beforeAfterCompare as beforeAfterCompare, index_codeChangeBridge as codeChangeBridge, index_createIntakeBridge as createIntakeBridge, index_defaultErrorClassifier as defaultErrorClassifier, index_evalIntakeBridge as evalIntakeBridge, index_evalSource as evalSource, index_harnessLoop as harnessLoop, index_harnessProfile as harnessProfile, index_harnessTrace as harnessTrace, index_notifyEffect as notifyEffect, index_priorityScore as priorityScore, index_strategyKey as strategyKey, index_strategyModel as strategyModel };
+  export { type index_CodeChange as CodeChange, type index_CodeChangeBridgeOptions as CodeChangeBridgeOptions, index_DEFAULT_DECAY_RATE as DEFAULT_DECAY_RATE, index_DEFAULT_QUEUE_CONFIGS as DEFAULT_QUEUE_CONFIGS, index_DEFAULT_SEVERITY_WEIGHTS as DEFAULT_SEVERITY_WEIGHTS, type index_ErrorClass as ErrorClass, type index_ErrorClassifier as ErrorClassifier, type index_EvalDelta as EvalDelta, type index_EvalIntakeBridgeOptions as EvalIntakeBridgeOptions, type index_EvalJudgeScore as EvalJudgeScore, type index_EvalResult as EvalResult, type index_EvalTaskDelta as EvalTaskDelta, type index_EvalTaskResult as EvalTaskResult, type index_EvalVerifierConfig as EvalVerifierConfig, type index_EvalVerifierSummary as EvalVerifierSummary, type index_ExecuteOutput as ExecuteOutput, type index_ExecutionResult as ExecutionResult, type index_HarnessExecutor as HarnessExecutor, index_HarnessGraph as HarnessGraph, type index_HarnessLoopOptions as HarnessLoopOptions, type index_HarnessProfileResult as HarnessProfileResult, type index_HarnessTraceHandle as HarnessTraceHandle, type index_HarnessTraceOptions as HarnessTraceOptions, type index_HarnessVerifier as HarnessVerifier, type index_IntakeBridgeOptions as IntakeBridgeOptions, type index_IntakeItem as IntakeItem, type index_IntakeSource as IntakeSource, type index_Intervention as Intervention, type index_LintError as LintError, type index_NotifyEffectOptions as NotifyEffectOptions, type index_NotifyTransport as NotifyTransport, type index_PrioritySignals as PrioritySignals, index_QUEUE_NAMES as QUEUE_NAMES, type index_QueueConfig as QueueConfig, type index_QueueRoute as QueueRoute, type index_RefineExecutorConfig as RefineExecutorConfig, type index_RefineExecutorResult as RefineExecutorResult, type index_RootCause as RootCause, type index_Severity as Severity, type index_StrategyEntry as StrategyEntry, type index_StrategyKey as StrategyKey, type index_StrategyModelBundle as StrategyModelBundle, type index_StrategySnapshot as StrategySnapshot, type index_TestFailure as TestFailure, type index_TraceDetail as TraceDetail, type index_TraceEvent as TraceEvent, type index_TraceEventType as TraceEventType, type index_TriagedItem as TriagedItem, type index_VerifyOutput as VerifyOutput, type index_VerifyResult as VerifyResult, index_affectedTaskFilter as affectedTaskFilter, index_beforeAfterCompare as beforeAfterCompare, index_codeChangeBridge as codeChangeBridge, index_createIntakeBridge as createIntakeBridge, index_defaultErrorClassifier as defaultErrorClassifier, index_defaultLlmExecutor as defaultLlmExecutor, index_defaultLlmVerifier as defaultLlmVerifier, index_evalIntakeBridge as evalIntakeBridge, index_evalSource as evalSource, index_evalVerifier as evalVerifier, index_harnessLoop as harnessLoop, index_harnessProfile as harnessProfile, index_harnessTrace as harnessTrace, index_notifyEffect as notifyEffect, index_priorityScore as priorityScore, index_refineExecutor as refineExecutor, index_strategyKey as strategyKey, index_strategyModel as strategyModel };
 }
 
-export { harnessTrace as $, type StrategySnapshot as A, type TraceDetail as B, type CodeChange as C, DEFAULT_DECAY_RATE as D, type ErrorClass as E, type TraceEvent as F, type TraceEventType as G, HarnessGraph as H, type IntakeBridgeOptions as I, type TriagedItem as J, affectedTaskFilter as K, type LintError as L, beforeAfterCompare as M, type NotifyEffectOptions as N, codeChangeBridge as O, type PrioritySignals as P, QUEUE_NAMES as Q, type RootCause as R, type Severity as S, type TestFailure as T, createIntakeBridge as U, type VerifyResult as V, defaultErrorClassifier as W, evalIntakeBridge as X, evalSource as Y, harnessLoop as Z, harnessProfile as _, type CodeChangeBridgeOptions as a, notifyEffect as a0, priorityScore as a1, strategyKey as a2, strategyModel as a3, DEFAULT_QUEUE_CONFIGS as b, DEFAULT_SEVERITY_WEIGHTS as c, type ErrorClassifier as d, type EvalDelta as e, type EvalIntakeBridgeOptions as f, type EvalJudgeScore as g, type EvalResult as h, index as i, type EvalTaskDelta as j, type EvalTaskResult as k, type ExecuteOutput as l, type ExecutionResult as m, type HarnessLoopOptions as n, type HarnessProfileResult as o, type HarnessTraceHandle as p, type HarnessTraceOptions as q, type IntakeItem as r, type IntakeSource as s, type Intervention as t, type NotifyTransport as u, type QueueConfig as v, type QueueRoute as w, type StrategyEntry as x, type StrategyKey as y, type StrategyModelBundle as z };
+export { codeChangeBridge as $, type QueueRoute as A, type RefineExecutorResult as B, type CodeChange as C, DEFAULT_DECAY_RATE as D, type ErrorClass as E, type RootCause as F, type StrategyEntry as G, type HarnessExecutor as H, type IntakeBridgeOptions as I, type StrategyKey as J, type StrategyModelBundle as K, type LintError as L, type StrategySnapshot as M, type NotifyEffectOptions as N, type TraceDetail as O, type PrioritySignals as P, QUEUE_NAMES as Q, type RefineExecutorConfig as R, type Severity as S, type TestFailure as T, type TraceEvent as U, type TraceEventType as V, type TriagedItem as W, type VerifyOutput as X, type VerifyResult as Y, affectedTaskFilter as Z, beforeAfterCompare as _, type CodeChangeBridgeOptions as a, createIntakeBridge as a0, defaultErrorClassifier as a1, defaultLlmExecutor as a2, defaultLlmVerifier as a3, evalIntakeBridge as a4, evalSource as a5, evalVerifier as a6, harnessLoop as a7, harnessProfile as a8, harnessTrace as a9, notifyEffect as aa, priorityScore as ab, refineExecutor as ac, strategyKey as ad, strategyModel as ae, DEFAULT_QUEUE_CONFIGS as b, DEFAULT_SEVERITY_WEIGHTS as c, type ErrorClassifier as d, type EvalDelta as e, type EvalIntakeBridgeOptions as f, type EvalJudgeScore as g, type EvalResult as h, index as i, type EvalTaskDelta as j, type EvalTaskResult as k, type EvalVerifierConfig as l, type EvalVerifierSummary as m, type ExecuteOutput as n, type ExecutionResult as o, HarnessGraph as p, type HarnessLoopOptions as q, type HarnessProfileResult as r, type HarnessTraceHandle as s, type HarnessTraceOptions as t, type HarnessVerifier as u, type IntakeItem as v, type IntakeSource as w, type Intervention as x, type NotifyTransport as y, type QueueConfig as z };

package/dist/{index-DP4ZTkdw.d.ts → index-DnrZghBB.d.ts}

@@ -1,5 +1,5 @@
-import { a as Node } from './node-Cc1TniY8.js';
-import { G as Graph } from './graph-BZGRXwOm.js';
+import { a as Node } from './node-BVV7G1bq.js';
+import { G as Graph } from './graph-CWeI0aHd.js';
 
 /**
  * Memory patterns (roadmap §4.3).
@@ -136,4 +136,4 @@ declare namespace index {
   export { type index_CollectionEntry as CollectionEntry, type index_CollectionGraph as CollectionGraph, type index_CollectionOptions as CollectionOptions, type index_CollectionPolicy as CollectionPolicy, type index_HnswAdapter as HnswAdapter, type index_KnowledgeEdge as KnowledgeEdge, type index_KnowledgeGraphGraph as KnowledgeGraphGraph, type index_LightCollectionBundle as LightCollectionBundle, type index_LightCollectionEntry as LightCollectionEntry, type index_LightCollectionOptions as LightCollectionOptions, type index_RankedCollectionEntry as RankedCollectionEntry, type index_VectorBackend as VectorBackend, type index_VectorIndexBundle as VectorIndexBundle, type index_VectorIndexOptions as VectorIndexOptions, type index_VectorRecord as VectorRecord, type index_VectorSearchResult as VectorSearchResult, index_collection as collection, index_decay as decay, index_knowledgeGraph as knowledgeGraph, index_lightCollection as lightCollection, index_vectorIndex as vectorIndex };
 }
 
-export { type CollectionEntry as C, type HnswAdapter as H, type KnowledgeGraphGraph as K, type LightCollectionBundle as L, type RankedCollectionEntry as R, type VectorIndexBundle as V, type VectorSearchResult as a, type CollectionGraph as b, type CollectionOptions as c, type CollectionPolicy as d, type KnowledgeEdge as e, type LightCollectionEntry as f, type LightCollectionOptions as g, type VectorBackend as h, index as i, type VectorIndexOptions as j, type VectorRecord as k, collection as l, decay as m, knowledgeGraph as n, lightCollection as o, vectorIndex as v };
+export { type CollectionEntry as C, type HnswAdapter as H, type KnowledgeGraphGraph as K, type LightCollectionBundle as L, type RankedCollectionEntry as R, type VectorSearchResult as V, type VectorIndexBundle as a, type CollectionGraph as b, type CollectionOptions as c, type CollectionPolicy as d, type KnowledgeEdge as e, type LightCollectionEntry as f, type LightCollectionOptions as g, type VectorBackend as h, index as i, type VectorIndexOptions as j, type VectorRecord as k, collection as l, decay as m, knowledgeGraph as n, lightCollection as o, vectorIndex as v };

package/dist/{index-DaLJvH8Z.d.ts → index-Docdiu9a.d.ts}

@@ -1,6 +1,6 @@
-import { a as Node } from './node-Cc1TniY8.js';
-import { S as StatusValue, C as CircuitState, R as RateLimiterOptions, a as CircuitBreakerOptions, b as RetryOptions, F as FallbackInput, N as NS_PER_MS, c as NS_PER_SEC } from './resilience-CGRzhnD3.js';
-import { B as BudgetConstraint } from './index-DpHe5e0Q.js';
+import { a as Node } from './node-BVV7G1bq.js';
+import { S as StatusValue, C as CircuitState, R as RateLimiterOptions, a as CircuitBreakerOptions, b as RetryOptions, F as FallbackInput, N as NS_PER_MS, c as NS_PER_SEC } from './resilience-CludlzcP.js';
+import { B as BudgetConstraint } from './index-CotRMjtJ.js';
 
 /**
  * Resilience composition with correct nesting order (roadmap §9.0b).

package/dist/{index-BpIFjILY.d.cts → index-DylQCKEL.d.cts}

@@ -1,7 +1,7 @@
-import { a as Node } from './node-Cc1TniY8.cjs';
+import { a as Node } from './node-BVV7G1bq.cjs';
 import { NodeInput } from './extra/sources.cjs';
-import { G as Graph, a as GraphOptions } from './graph-D48Qw9Cg.cjs';
-import { T as TopicGraph } from './index-DyxjtScX.cjs';
+import { a as GraphOptions, G as Graph } from './graph-C4Uxwv0T.cjs';
+import { T as TopicGraph } from './index-B-z8WaSd.cjs';
 
 /**
  * refineLoop — universal prompt/artifact optimization loop as a reactive Graph.
@@ -354,4 +354,4 @@ declare namespace index {
   export { type index_AnalyzeEvent as AnalyzeEvent, type index_BlindVariationContext as BlindVariationContext, type index_BlindVariationOptions as BlindVariationOptions, type index_ConvergenceOptions as ConvergenceOptions, type index_DatasetItem as DatasetItem, type index_DecideEvent as DecideEvent, type index_ErrorCritiqueContext as ErrorCritiqueContext, type index_ErrorCritiqueOptions as ErrorCritiqueOptions, type index_EvalResult as EvalResult, type index_EvaluateEvent as EvaluateEvent, type index_Evaluator as Evaluator, type index_Feedback as Feedback, type index_GenerateEvent as GenerateEvent, type index_Iteration as Iteration, type index_RefineLoopGraph as RefineLoopGraph, type index_RefineLoopOptions as RefineLoopOptions, type index_RefineStatus as RefineStatus, type index_RefineStrategy as RefineStrategy, index_blindVariation as blindVariation, index_errorCritique as errorCritique, index_refineLoop as refineLoop };
 }
 
-export { type AnalyzeEvent as A, type BlindVariationContext as B, type ConvergenceOptions as C, type DatasetItem as D, type ErrorCritiqueContext as E, type Feedback as F, type GenerateEvent as G, type Iteration as I, type RefineLoopGraph as R, type BlindVariationOptions as a, type DecideEvent as b, type ErrorCritiqueOptions as c, type EvalResult as d, type EvaluateEvent as e, type Evaluator as f, type RefineLoopOptions as g, type RefineStatus as h, index as i, type RefineStrategy as j, blindVariation as k, errorCritique as l, refineLoop as r };
+export { type AnalyzeEvent as A, type BlindVariationContext as B, type ConvergenceOptions as C, type DatasetItem as D, type Evaluator as E, type Feedback as F, type GenerateEvent as G, type Iteration as I, type RefineStrategy as R, type EvalResult as a, type RefineStatus as b, type RefineLoopOptions as c, type BlindVariationOptions as d, type DecideEvent as e, type ErrorCritiqueContext as f, type ErrorCritiqueOptions as g, type EvaluateEvent as h, index as i, type RefineLoopGraph as j, blindVariation as k, errorCritique as l, refineLoop as r };

package/dist/{index-B_agccPe.d.cts → index-FBqTfL_S.d.cts}

@@ -1,4 +1,4 @@
-import { a as Node } from './node-Cc1TniY8.cjs';
+import { a as Node } from './node-BVV7G1bq.cjs';
 
 /** Solid accessor function — returns current value when called. */
 type Accessor<T> = () => T;

package/dist/{index-DraikLjn.d.ts → index-FrYrV-Vf.d.ts}

@@ -1,5 +1,5 @@
-import { a as Node } from './node-Cc1TniY8.js';
-import { G as Graph, a as GraphOptions } from './graph-BZGRXwOm.js';
+import { a as Node } from './node-BVV7G1bq.js';
+import { G as Graph, a as GraphOptions } from './graph-CWeI0aHd.js';
 
 /**
  * Job queue patterns (roadmap §4.2).

package/dist/{index-sm373fsH.d.ts → index-IZ3l_vQ9.d.ts}

@@ -1,5 +1,5 @@
-import { a as Node } from './node-Cc1TniY8.js';
-import { a as GraphOptions, G as Graph } from './graph-BZGRXwOm.js';
+import { a as Node } from './node-BVV7G1bq.js';
+import { a as GraphOptions, G as Graph } from './graph-CWeI0aHd.js';
 
 /**
  * CQRS patterns (roadmap §4.5).

package/dist/{index-BwM9BEkt.d.ts → index-Ip3q9T9x.d.ts}

@@ -1,5 +1,5 @@
 import { Ref, WatchSource } from 'vue';
-import { a as Node } from './node-Cc1TniY8.js';
+import { a as Node } from './node-BVV7G1bq.js';
 
 /**
  * Subscribe to a read-only `Node<T>` as a Vue `Ref<T>`. Auto-unsubscribes on scope disposal.

package/dist/{index-CloUk1kY.d.ts → index-RQg6lTrN.d.ts}

@@ -1,12 +1,12 @@
-import { i as index$2 } from './index-Bqachn9_.js';
-import { i as index$3 } from './index-CMn8S8Hw.js';
-import { i as index$4 } from './index-m-yHof5p.js';
-import { i as index$5 } from './index-BVHOrDwO.js';
-import { a as Node } from './node-Cc1TniY8.js';
-import { i as index$6 } from './index-B1AmmSlb.js';
-import { i as index$7 } from './index-BWJV63ti.js';
-import { i as index$8 } from './index-BwM9BEkt.js';
-import { i as index$9 } from './index-DiOXyAwt.js';
+import { i as index$2 } from './index-ByPnK85n.js';
+import { i as index$3 } from './index-wIx1Jisk.js';
+import { i as index$4 } from './index-DGb1awva.js';
+import { i as index$5 } from './index-D0C_USMR.js';
+import { a as Node } from './node-BVV7G1bq.js';
+import { i as index$6 } from './index-CrC7urhX.js';
+import { i as index$7 } from './index-BX22kvjh.js';
+import { i as index$8 } from './index-Ip3q9T9x.js';
+import { i as index$9 } from './index-Bvi5uJxX.js';
 
 /**
  * Options for creating signals.

package/dist/{index-CEXXwWVH.d.cts → index-SSGqF8mI.d.cts}

@@ -1,5 +1,5 @@
-import { a as Node } from './node-Cc1TniY8.cjs';
-import { a as GraphOptions, G as Graph } from './graph-D48Qw9Cg.cjs';
+import { a as Node } from './node-BVV7G1bq.cjs';
+import { a as GraphOptions, G as Graph } from './graph-C4Uxwv0T.cjs';
 
 /**
  * CQRS patterns (roadmap §4.5).