@oscharko-dev/keiko 0.2.0-beta.4 → 0.2.0-beta.6

package/node_modules/@oscharko-dev/keiko-workflows/dist/qualityIntelligence/modelRoutedTestDesign.js

@@ -6,7 +6,7 @@
 // is injected as an abstract `generate` port so this module stays free of provider SDKs and the
 // server tier owns the gateway wiring (ADR-0023 D5/D6).
 import { QualityIntelligence as QI } from "@oscharko-dev/keiko-contracts";
-import { buildAtomCoverageStatuses, buildCoverageMap, buildRequirementExcerpt, deduplicateCandidates, deriveIntent, designTestCaseCandidates, scoreFromDimensions, TEST_QUALITY_WEAK_THRESHOLD, validateCandidates, QualityIntelligenceGeneration, } from "@oscharko-dev/keiko-quality-intelligence";
+import { buildAtomCoverageStatuses, buildCoverageMap, buildRequirementExcerpt, computeCandidateEquivalenceSignature, deduplicateCandidates, deriveIntent, designTestCaseCandidates, scoreFromDimensions, TEST_QUALITY_WEAK_THRESHOLD, validateCandidates, QualityIntelligenceGeneration, } from "@oscharko-dev/keiko-quality-intelligence";
 import { sha256Hex } from "@oscharko-dev/keiko-security";
 import { QI_TEST_DESIGN_WORKFLOW_DESCRIPTOR } from "./descriptors.js";
 import { emit, emitCandidateProposed, emitFindingsRecorded, emitQueuedAndStarted, finaliseFailureOrCancellation, makeContext, persistRun, StageCancelledError, toCoverageMatrixRows, truncateCandidates, truncateFindings, withStage, } from "./runtimeCommon.js";
@@ -35,6 +35,12 @@ function atomFingerprintsFor(ingestedAtoms) {
         atomId: String(entry.atom.id),
         envelopeId: String(entry.atom.sourceEnvelopeId),
         canonicalHashSha256Hex: entry.atom.canonicalHashSha256Hex,
+        ...(entry.replacementGroupId !== undefined
+            ? { replacementGroupId: entry.replacementGroupId }
+            : {}),
+        ...(entry.replacementOrdinal !== undefined
+            ? { replacementOrdinal: entry.replacementOrdinal }
+            : {}),
     })));
 }
 /**
@@ -97,9 +103,46 @@ function parseModelCandidates(result, ctx, input, maxCandidates) {
     }
     return truncateCandidates(deduplicateCandidates(parsed.candidates), maxCandidates);
 }
+function appendModelDelta(baseline, delta, limit) {
+    const baselineLimit = delta.length > 0 && limit > 0 ? Math.max(0, limit - 1) : limit;
+    const out = [...baseline].slice(0, baselineLimit);
+    const seen = new Set(out.map((candidate) => computeCandidateEquivalenceSignature(candidate)));
+    let appendedDelta = 0;
+    for (const candidate of delta) {
+        const signature = computeCandidateEquivalenceSignature(candidate);
+        if (seen.has(signature))
+            continue;
+        seen.add(signature);
+        out.push(candidate);
+        appendedDelta += 1;
+        if (out.length >= limit)
+            break;
+    }
+    if (appendedDelta === 0) {
+        for (let index = baselineLimit; index < baseline.length && out.length < limit; index += 1) {
+            const candidate = baseline[index];
+            if (candidate === undefined)
+                continue;
+            out.push(candidate);
+        }
+    }
+    return Object.freeze(out);
+}
+function selectReviewCandidates(persisted, baseline, delta) {
+    if (delta.length === 0) {
+        return Object.freeze([]);
+    }
+    const persistedIds = new Set(persisted.map((candidate) => String(candidate.id)));
+    const persistedDelta = delta.filter((candidate) => persistedIds.has(String(candidate.id)));
+    return persistedDelta.length > 0 ? Object.freeze(persistedDelta) : baseline;
+}
 function modelGenerationOutput(result, ctx, input, maxCandidates) {
+    const baseline = deterministicBaselineCandidates(ctx, input);
+    const delta = parseModelCandidates(result, ctx, input, maxCandidates);
+    const candidates = appendModelDelta(baseline, delta, maxCandidates);
     return {
-        candidates: parseModelCandidates(result, ctx, input, maxCandidates),
+        candidates,
+        reviewCandidates: selectReviewCandidates(candidates, baseline, delta),
         ...(result.modelId !== undefined ? { modelId: result.modelId } : {}),
         ...(result.modelId !== undefined
             ? { seedUsed: result.seedUsed ?? null }
@@ -146,8 +189,10 @@ async function generateCandidates(ctx, input, deps) {
     }
     ctx.modelGatewayCallCount += result.modelCallCount;
     if (result.modelId === undefined && result.modelCallCount === 0) {
+        const candidates = deterministicBaselineCandidates(ctx, input);
         return {
-            candidates: deterministicBaselineCandidates(ctx, input),
+            candidates,
+            reviewCandidates: candidates,
             ...(result.seedUsed !== undefined ? { seedUsed: result.seedUsed } : {}),
             modelParameters: result.modelParameters,
         };
@@ -157,12 +202,16 @@ async function generateCandidates(ctx, input, deps) {
 function candidateSummaryText(candidate) {
     const parts = [
         `Title: ${candidate.title}`,
+        `Preconditions: ${candidate.preconditions.join("; ")}`,
         `Steps: ${candidate.steps.join("; ")}`,
         `Expected: ${candidate.expectedResults.join("; ")}`,
     ];
     return parts.join("\n");
 }
 const JUDGE_SUMMARY_DIMENSION_LIMIT = 2;
+const FINDING_KIND_TRUNCATION_PRIORITY = {
+    "test-quality": 0,
+};
 const JUDGE_DIMENSION_LABEL = {
     verifiability: "Verifiability",
     atomicity: "Atomicity",
@@ -213,9 +262,13 @@ function buildTestQualityFinding(runId, candidate, score, rationale, ordinal) {
         evidenceAtomIds: Object.freeze([...candidate.derivedFromAtomIds]),
     });
 }
+function findingTruncationPriority(finding) {
+    return FINDING_KIND_TRUNCATION_PRIORITY[finding.kind] ?? 1;
+}
 const EMPTY_JUDGE_RESULT = Object.freeze({
     findings: Object.freeze([]),
     qualityScore: null,
+    candidateQualityVerdicts: new Map(),
 });
 // Bounded concurrency for the per-candidate judge calls: cuts the wall-clock of judging a large run
 // (one gateway call per candidate) without flooding the gateway, which applies its own per-call
@@ -225,82 +278,179 @@ const JUDGE_CONCURRENCY = 4;
 function isCancellationError(ctx, error) {
     return error instanceof StageCancelledError || isCancelled(ctx.signal);
 }
-const JUDGE_SKIPPED = Object.freeze({ judged: false });
+const JUDGE_ERROR_RATIONALE = "Quality judge could not evaluate this candidate; treating it as weak for audit.";
+const JUDGE_BUDGET_RATIONALE = "Quality judge budget exhausted before this candidate could be evaluated; treating it as weak for audit.";
+function buildSyntheticWeakJudgeOutcome(ctx, candidate, ordinal, rationale) {
+    return {
+        strong: false,
+        finding: buildTestQualityFinding(ctx.plan.id, candidate, 0, rationale, ordinal),
+        qualityVerdict: syntheticWeakQualityVerdict(rationale),
+    };
+}
+function cloneDimensions(dimensions) {
+    return Object.freeze(dimensions.map((dimension) => Object.freeze({ ...dimension })));
+}
+function qualityVerdictFromJudge(verdict, score) {
+    return Object.freeze({
+        verdict: verdict.verdict,
+        score,
+        dimensions: cloneDimensions(verdict.dimensions),
+        overallRationale: verdict.overallRationale,
+    });
+}
+function syntheticWeakQualityVerdict(rationale) {
+    const dimensions = QI.TEST_QUALITY_RUBRIC_DIMENSIONS.map((name) => Object.freeze({
+        name,
+        score: 0,
+        rationale,
+    }));
+    return Object.freeze({
+        verdict: "weak",
+        score: 0,
+        dimensions: Object.freeze(dimensions),
+        overallRationale: rationale,
+    });
+}
 /**
- * Judge one candidate. Counts the gateway dispatch, then returns its outcome. A transient judge
- * error (rate-limit / 5xx / timeout / network) degrades to "unjudged" (fail-soft); cancellation is
- * re-raised as `StageCancelledError` so the whole stage aborts. The dispatch is counted BEFORE the
- * await so the audit trail reflects every gateway call attempt, even one that then throws.
+ * Judge one candidate. Counts actual gateway dispatches reported by the judge port, then returns
+ * its outcome. A transient judge error (rate-limit / 5xx / timeout / network) remains
+ * run-fail-soft but becomes an explicit weak judge outcome; cancellation is re-raised as
+ * `StageCancelledError` so the whole stage aborts. Legacy/test ports that throw without returning
+ * dispatch metadata are counted as one attempted gateway call, preserving the audit contract.
  */
 async function judgeOneCandidate(ctx, candidate, ordinal, ingestedAtoms, judge) {
-    ctx.modelGatewayCallCount += 1;
     let verdict;
     try {
         verdict = await judge.judge({
             candidateText: candidateSummaryText(candidate),
             sourceContext: sourceContextForCandidate(candidate, ingestedAtoms),
         }, ctx.signal);
+        ctx.modelGatewayCallCount += verdict.gatewayCallCount ?? 1;
     }
     catch (error) {
         if (isCancellationError(ctx, error))
             throw new StageCancelledError();
-        return JUDGE_SKIPPED;
+        ctx.modelGatewayCallCount += 1;
+        return buildSyntheticWeakJudgeOutcome(ctx, candidate, ordinal, JUDGE_ERROR_RATIONALE);
     }
+    const score = scoreFromDimensions(verdict.dimensions);
+    const qualityVerdict = qualityVerdictFromJudge(verdict, score);
     if (verdict.verdict === "strong")
-        return { judged: true, strong: true, finding: null };
+        return { strong: true, finding: null, qualityVerdict };
     return {
-        judged: true,
         strong: false,
-        finding: buildTestQualityFinding(ctx.plan.id, candidate, scoreFromDimensions(verdict.dimensions), judgeRationaleSummary(verdict), ordinal),
+        finding: buildTestQualityFinding(ctx.plan.id, candidate, score, judgeRationaleSummary(verdict), ordinal),
+        qualityVerdict,
     };
 }
-/**
- * Adversarially judge every candidate via the model-judge port (Epic #736, Issue #747).
- *
- * Resilience contract: the judge AUGMENTS generation and must never harm a successful run — a
- * transient per-candidate error is fail-soft (that candidate is excluded from the score, no
- * finding) and only cancellation aborts the stage. Audit contract: every dispatch is counted into
- * `ctx.modelGatewayCallCount`. Budget contract: at most `ctx.limits.maxJudgeCallsPerRun` candidates
- * are judged. Bounded-concurrency workers share a cursor; findings land in candidate-indexed slots
- * so the persisted order stays deterministic regardless of completion order.
- */
-async function runJudgeStage(ctx, candidates, ingestedAtoms, judge) {
-    if (candidates.length === 0)
-        return EMPTY_JUDGE_RESULT;
-    const budget = Math.max(0, ctx.limits.maxJudgeCallsPerRun);
-    const judgeable = budget >= candidates.length ? candidates : candidates.slice(0, budget);
-    if (judgeable.length === 0)
-        return EMPTY_JUDGE_RESULT;
-    const findingSlots = Array.from({ length: judgeable.length }, () => undefined);
+function makeJudgeSlots(candidateCount) {
+    return {
+        findingSlots: Array.from({ length: candidateCount }, () => undefined),
+        verdictSlots: Array.from({ length: candidateCount }, () => undefined),
+    };
+}
+function recordJudgeOutcome(slots, index, outcome) {
+    slots.verdictSlots[index] = outcome.qualityVerdict;
+    if (outcome.finding !== null)
+        slots.findingSlots[index] = outcome.finding;
+    return outcome.strong;
+}
+async function judgeCandidates(ctx, candidates, ingestedAtoms, judge, slots) {
     let strongCount = 0;
-    let scored = 0;
+    let verdictCount = 0;
     let cursor = 0;
     const worker = async () => {
         for (;;) {
             const i = cursor;
             cursor += 1;
-            if (i >= judgeable.length)
+            if (i >= candidates.length)
                 return;
-            const candidate = judgeable[i];
+            const candidate = candidates[i];
             if (candidate === undefined)
                 continue;
             const outcome = await judgeOneCandidate(ctx, candidate, i, ingestedAtoms, judge);
-            if (!outcome.judged)
-                continue;
-            scored += 1;
-            if (outcome.strong)
+            verdictCount += 1;
+            if (recordJudgeOutcome(slots, i, outcome))
                 strongCount += 1;
-            else if (outcome.finding !== null)
-                findingSlots[i] = outcome.finding;
         }
     };
-    await Promise.all(Array.from({ length: Math.min(JUDGE_CONCURRENCY, judgeable.length) }, () => worker()));
-    const findings = findingSlots.filter((f) => f !== undefined);
-    // Per-run quality score = share of SUCCESSFULLY JUDGED candidates the judge rated "strong", as a
-    // percentage (#747). Candidates the judge could not evaluate are excluded from the denominator
-    // rather than counted as weak, so the score honestly reflects what was actually judged.
-    const qualityScore = scored === 0 ? null : (strongCount / scored) * 100;
-    return { findings: Object.freeze(findings), qualityScore };
+    if (candidates.length > 0) {
+        await Promise.all(Array.from({ length: Math.min(JUDGE_CONCURRENCY, candidates.length) }, () => worker()));
+    }
+    return { strongCount, verdictCount };
+}
+function recordBudgetOverflow(ctx, candidates, startIndex, slots) {
+    let verdictCount = 0;
+    for (let i = startIndex; i < candidates.length; i += 1) {
+        const candidate = candidates[i];
+        if (candidate === undefined)
+            continue;
+        const outcome = buildSyntheticWeakJudgeOutcome(ctx, candidate, i, JUDGE_BUDGET_RATIONALE);
+        verdictCount += 1;
+        recordJudgeOutcome(slots, i, outcome);
+    }
+    return verdictCount;
+}
+function candidateQualityVerdictMap(candidates, slots) {
+    const candidateQualityVerdicts = new Map();
+    for (let i = 0; i < candidates.length; i += 1) {
+        const candidate = candidates[i];
+        const qualityVerdict = slots.verdictSlots[i];
+        if (candidate !== undefined && qualityVerdict !== undefined) {
+            candidateQualityVerdicts.set(String(candidate.id), qualityVerdict);
+        }
+    }
+    return candidateQualityVerdicts;
+}
+function buildJudgeStageResult(candidates, slots, counts) {
+    const findings = slots.findingSlots.filter((f) => f !== undefined);
+    const qualityScore = counts.verdictCount === 0 ? null : (counts.strongCount / counts.verdictCount) * 100;
+    return {
+        findings: Object.freeze(findings),
+        qualityScore,
+        candidateQualityVerdicts: candidateQualityVerdictMap(candidates, slots),
+    };
+}
+/**
+ * Adversarially judge every candidate via the model-judge port (Epic #736, Issue #747).
+ *
+ * Resilience contract: the judge AUGMENTS generation and must never fail an otherwise successful
+ * run — a transient per-candidate error becomes an explicit weak test-quality finding and only
+ * cancellation aborts the stage. Audit contract: every dispatch is counted into
+ * `ctx.modelGatewayCallCount`. Budget contract: at most `ctx.limits.maxJudgeCallsPerRun` candidates
+ * make gateway calls; any overflow candidates receive deterministic weak findings so the persisted
+ * run still accounts for every candidate. Bounded-concurrency workers share a cursor; findings land
+ * in candidate-indexed slots so the persisted order stays deterministic regardless of completion
+ * order.
+ */
+async function runJudgeStage(ctx, candidates, ingestedAtoms, judge) {
+    if (candidates.length === 0)
+        return EMPTY_JUDGE_RESULT;
+    const budget = Math.max(0, ctx.limits.maxJudgeCallsPerRun);
+    const judgeable = budget >= candidates.length ? candidates : candidates.slice(0, budget);
+    const slots = makeJudgeSlots(candidates.length);
+    const judged = await judgeCandidates(ctx, judgeable, ingestedAtoms, judge, slots);
+    const overflowVerdictCount = recordBudgetOverflow(ctx, candidates, judgeable.length, slots);
+    // Per-run quality score = share of candidates with a strong judge outcome, as a percentage (#747).
+    // Gateway errors and budget overflow produce explicit weak outcomes so unverified candidates cannot
+    // be indistinguishable from strong candidates or inflate the run score.
+    return buildJudgeStageResult(candidates, slots, {
+        strongCount: judged.strongCount,
+        verdictCount: judged.verdictCount + overflowVerdictCount,
+    });
+}
+function candidatesWithQualityVerdicts(candidates, verdicts) {
+    if (verdicts.size === 0)
+        return candidates;
+    return Object.freeze(candidates.map((candidate) => {
+        const qualityVerdict = verdicts.get(String(candidate.id));
+        if (qualityVerdict === undefined)
+            return candidate;
+        return Object.freeze({
+            ...candidate,
+            qualityVerdict,
+        });
+    }));
 }
 /**
  * Execute a model-routed QI test-design run end to end. Emits the standard QI run-event envelope,
@@ -318,19 +468,21 @@ export async function runQualityIntelligenceModelRoutedTestDesign(input, deps) {
         policyProfile: input.profile,
         signal: deps.signal,
     });
+    ctx.modelGatewayCallCount += deps.initialModelGatewayCallCount ?? 0;
     const evidenceRefs = evidenceRefsFor(input.ingestedAtoms);
     emitQueuedAndStarted(ctx);
     try {
         await withStage(ctx, "plan", async () => Promise.resolve());
         const generation = await withStage(ctx, "candidates", async () => generateCandidates(ctx, input, deps));
         const candidates = generation.candidates;
+        const reviewCandidates = generation.reviewCandidates;
         emitCandidateProposed(ctx, candidates);
         const judge = deps.judge;
         const judgeResult = await withStage(ctx, "judge", async () => {
             if (judge === undefined)
                 return EMPTY_JUDGE_RESULT;
             try {
-                return await runJudgeStage(ctx, candidates, input.ingestedAtoms, judge);
+                return await runJudgeStage(ctx, reviewCandidates, input.ingestedAtoms, judge);
             }
             catch (error) {
                 // Cancellation must still abort the run; anything else is fail-soft so an optional judge
@@ -341,7 +493,7 @@ export async function runQualityIntelligenceModelRoutedTestDesign(input, deps) {
             }
         });
         const atoms = input.ingestedAtoms.map((a) => a.atom);
-        const coverageMap = await withStage(ctx, "coverage", async () => Promise.resolve(buildCoverageMap({ runId: input.plan.id, atoms, candidates })));
+        const coverageMap = await withStage(ctx, "coverage", async () => Promise.resolve(buildCoverageMap({ runId: input.plan.id, atoms, candidates: reviewCandidates })));
         const atomStatuses = buildAtomCoverageStatuses(atoms, coverageMap);
         const excerptByAtomId = excerptsByAtomId(input.ingestedAtoms);
         const coverageMatrix = toCoverageMatrixRows(atomStatuses, excerptByAtomId);
@@ -352,11 +504,12 @@ export async function runQualityIntelligenceModelRoutedTestDesign(input, deps) {
                 gapFindings.push(buildCoverageGapFinding(input.plan.id, s, i, excerptByAtomId.get(String(s.atomId))));
             }
         }
-        const rawFindings = await withStage(ctx, "validate", async () => Promise.resolve(validateCandidates(input.plan.id, candidates)));
+        const rawFindings = await withStage(ctx, "validate", async () => Promise.resolve(validateCandidates(input.plan.id, reviewCandidates)));
         // Order by severity (critical -> low) BEFORE truncation so that, if the run hits the
         // per-run findings cap, the most severe findings — uncovered-requirement gaps included —
-        // always survive the cut rather than being dropped by array position (Array.sort is stable,
-        // so same-severity insertion order is preserved).
+        // always survive the cut rather than being dropped by array position. Within a severity tier,
+        // keep test-quality findings first because #748 weak-test flags are projected exclusively from
+        // those candidate-scoped findings; stable sort preserves original order for all remaining ties.
         const allFindings = [
             ...gapFindings,
             ...rawFindings,
@@ -364,7 +517,8 @@ export async function runQualityIntelligenceModelRoutedTestDesign(input, deps) {
         ]
             .slice()
             .sort((a, b) => QI.QUALITY_INTELLIGENCE_SEVERITY_RANK[a.severity] -
-            QI.QUALITY_INTELLIGENCE_SEVERITY_RANK[b.severity]);
+            QI.QUALITY_INTELLIGENCE_SEVERITY_RANK[b.severity] ||
+            findingTruncationPriority(a) - findingTruncationPriority(b));
         const findings = truncateFindings(allFindings, ctx.limits.maxFindingsPerRun);
         emitFindingsRecorded(ctx, findings);
         const evidence = await withStage(ctx, "finalize", async () => {
@@ -385,6 +539,7 @@ export async function runQualityIntelligenceModelRoutedTestDesign(input, deps) {
                 evidenceStore: deps.evidenceStore,
                 coverageMatrix,
                 qualityScore: judgeResult.qualityScore,
+                ...(deps.redaction !== undefined ? { redaction: deps.redaction } : {}),
                 ...(sourceFingerprints.length > 0 ? { sourceFingerprints } : {}),
                 ...(atomFingerprints.length > 0 ? { atomFingerprints } : {}),
                 ...(generation.modelId !== undefined ? { modelId: generation.modelId } : {}),
@@ -393,7 +548,7 @@ export async function runQualityIntelligenceModelRoutedTestDesign(input, deps) {
                     ? { modelParameters: generation.modelParameters }
                     : {}),
             });
-            deps.candidatesSink.record(candidates, completedAt);
+            deps.candidatesSink.record(candidatesWithQualityVerdicts(candidates, judgeResult.candidateQualityVerdicts), completedAt);
             return Promise.resolve(result);
         });
         emit(ctx, { kind: "run:succeeded" });

package/node_modules/@oscharko-dev/keiko-workflows/dist/qualityIntelligence/runtimeCommon.d.ts

@@ -1,5 +1,5 @@
 import { QualityIntelligence as QI } from "@oscharko-dev/keiko-contracts";
-import { type QualityIntelligenceCoverageMatrixRow, type QualityIntelligenceLocalStore, type QualityIntelligenceRecordInput, type QualityIntelligenceRecordResult } from "@oscharko-dev/keiko-evidence";
+import { type QualityIntelligenceCoverageMatrixRow, type QualityIntelligenceLocalStore, type QualityIntelligenceRecordInput, type QualityIntelligenceRecordOptions, type QualityIntelligenceRecordResult } from "@oscharko-dev/keiko-evidence";
 import { type AtomCoverageStatus, type PolicyProfile } from "@oscharko-dev/keiko-quality-intelligence";
 import type { QualityIntelligenceWorkflowDescriptor, QualityIntelligenceWorkflowLimits } from "./descriptors.js";
 /** Sink for QI run events. Mirrors the harness EventSink shape but typed for the QI envelope. */
@@ -22,9 +22,8 @@ export interface QualityIntelligenceRunSummary {
     readonly evidence?: QualityIntelligenceRecordResult | undefined;
     readonly reasonSummary?: string | undefined;
     /**
-     * Run quality score: the percentage of judged candidates the adversarial judge rated "strong"
-     * [0-100] (Epic #736). Null when the judge stage was skipped, unavailable, or no candidate was
-     * judged.
+     * Run quality score: the percentage of candidates with a strong judge outcome [0-100] (Epic #736).
+     * Null only when the judge stage was skipped/unavailable or there were no candidates to judge.
      */
     readonly qualityScore?: number | null;
 }
@@ -85,6 +84,7 @@ export interface PersistArgs {
     readonly evidenceStore: QualityIntelligenceLocalStore;
     readonly coverageMatrix?: QualityIntelligenceRecordInput["coverageMatrix"];
     readonly qualityScore?: number | null;
+    readonly redaction?: QualityIntelligenceRecordOptions["redaction"];
     readonly sourceFingerprints?: QualityIntelligenceRecordInput["sourceFingerprints"];
     readonly atomFingerprints?: QualityIntelligenceRecordInput["atomFingerprints"];
     /** Model id that generated the candidates (Epic #761). */

package/node_modules/@oscharko-dev/keiko-workflows/dist/qualityIntelligence/runtimeCommon.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"runtimeCommon.d.ts","sourceRoot":"","sources":["../../src/qualityIntelligence/runtimeCommon.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,mBAAmB,IAAI,EAAE,EAAE,MAAM,+BAA+B,CAAC;AAC1E,OAAO,EAEL,KAAK,oCAAoC,EACzC,KAAK,6BAA6B,EAClC,KAAK,8BAA8B,EACnC,KAAK,+BAA+B,EACrC,MAAM,8BAA8B,CAAC;AAEtC,OAAO,EAIL,KAAK,kBAAkB,EACvB,KAAK,aAAa,EACnB,MAAM,0CAA0C,CAAC;AAElD,OAAO,KAAK,EACV,qCAAqC,EACrC,iCAAiC,EAClC,MAAM,kBAAkB,CAAC;AAK1B,iGAAiG;AACjG,MAAM,WAAW,+BAA+B;IAC9C,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,2BAA2B,KAAK,IAAI,CAAC;CAChE;AAED,iFAAiF;AACjF,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,MAAM,EAAE,MAAM,MAAM,CAAC;CAC/B;AAED,eAAO,MAAM,aAAa,EAAE,wBAE1B,CAAC;AAEH,MAAM,MAAM,iCAAiC,GAAG,8BAA8B,CAAC,gBAAgB,CAAC,CAAC;AAEjG,MAAM,MAAM,4BAA4B,GAAG,WAAW,GAAG,QAAQ,GAAG,WAAW,CAAC;AAEhF,MAAM,WAAW,6BAA6B;IAC5C,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,wBAAwB,CAAC;IAC5C,QAAQ,CAAC,UAAU,EAAE,qCAAqC,CAAC,YAAY,CAAC,CAAC;IACzE,QAAQ,CAAC,MAAM,EAAE,4BAA4B,CAAC;IAC9C,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,qBAAqB,EAAE,MAAM,CAAC;IACvC,QAAQ,CAAC,QAAQ,CAAC,EAAE,+BAA+B,GAAG,SAAS,CAAC;IAChE,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5C;;;;OAIG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACvC;AAID,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,UAAU,EAAE,qCAAqC,CAAC;IAC3D,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,0BAA0B,CAAC;IAC7C,QAAQ,CAAC,IAAI,EAAE,+BAA+B,CAAC;IAC/C,QAAQ,CAAC,KAAK,EAAE,wBAAwB,CAAC;IACzC,QAAQ,CAAC,MAAM,EAAE,iCAAiC,CAAC;IACnD,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;IAChC,QAAQ,CAAC,MAAM,EAAE,WAAW,GAAG,SAAS,CAAC;IACzC,QAAQ,EAAE,MAAM,CAAC;IACjB,qBAAqB,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,UAAU,EAAE,qCAAqC,CAAC;IAC3D,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,0BAA0B,CAAC;IAC7C,QAAQ,CAAC,IAAI,EAAE,+BAA+B,CAAC;IAC/C,QAAQ,CAAC,KAAK,CAAC,EAAE,wBAAwB,GAAG,SAAS,CAAC;IACtD,QAAQ,CAAC,MAAM,CAAC,EAAE,iCAAiC,GAAG,SAAS,CAAC;IAChE,QAAQ,CAAC,aAAa,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IACnD,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;CAC3C;AAED,wBAAgB,WAAW,CAAC,IAAI,EAAE,cAAc,GAAG,UAAU,CAY5D;AAQD,wBAAgB,IAAI,CAAC,GAAG,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC,kCAAkC,GAAG,IAAI,CAS1F;AAED,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,UAAU,GAAG,IAAI,CAG1D;AAWD,qBAAa,mBAAoB,SAAQ,KAAK;;CAK7C;AAED,wBAAgB,cAAc,CAAC,GAAG,EAAE,UAAU,GAAG,IAAI,CAIpD;AAyBD,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAYxD;AAED,wBAAsB,SAAS,CAAC,CAAC,EAC/B,GAAG,EAAE,UAAU,EACf,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GACrB,OAAO,CAAC,CAAC,CAAC,CAyBZ;AAID,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,EAC9D,KAAK,EAAE,MAAM,GACZ,SAAS,EAAE,CAAC,oCAAoC,EAAE,CAEpD;AAED,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,EAC5D,KAAK,EAAE,MAAM,GACZ,SAAS,EAAE,CAAC,oCAAoC,EAAE,CAEpD;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,SAAS,kBAAkB,EAAE,EACvC,eAAe,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAC5C,SAAS,oCAAoC,EAAE,CAajD;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,EAAE,CAAC,wBAAwB,EAClC,KAAK,EAAE,SAAS,EAAE,CAAC,+BAA+B,EAAE,EACpD,UAAU,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,EAC9D,eAAe,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAC5C,SAAS,oCAAoC,EAAE,CAGjD;AAED,wBAAgB,qBAAqB,CACnC,GAAG,EAAE,UAAU,EACf,UAAU,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,GAC7D,IAAI,CAQN;AAED,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,UAAU,EACf,QAAQ,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,GAC3D,IAAI,CAIN;AAID,MAAM,MAAM,cAAc,GAAG,SAAS,GAAG,WAAW,GAAG,QAAQ,GAAG,WAAW,CAAC;AAE9E,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC;IAChC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,CAAC;IACtE,QAAQ,CAAC,YAAY,CAAC,EAAE,8BAA8B,CAAC,cAAc,CAAC,GAAG,SAAS,CAAC;IACnF,QAAQ,CAAC,cAAc,EAAE,iCAAiC,CAAC;IAC3D,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,QAAQ,CAAC,aAAa,EAAE,6BAA6B,CAAC;IACtD,QAAQ,CAAC,cAAc,CAAC,EAAE,8BAA8B,CAAC,gBAAgB,CAAC,CAAC;IAC3E,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACtC,QAAQ,CAAC,kBAAkB,CAAC,EAAE,8BAA8B,CAAC,oBAAoB,CAAC,CAAC;IACnF,QAAQ,CAAC,gBAAgB,CAAC,EAAE,8BAA8B,CAAC,kBAAkB,CAAC,CAAC;IAC/E,0DAA0D;IAC1D,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,4DAA4D;IAC5D,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACnD,wDAAwD;IACxD,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACnC;AAkBD,wBAAgB,UAAU,CAAC,IAAI,EAAE,WAAW,GAAG,+BAA+B,CA+B7E;AAID,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,CAAC;IACtE,QAAQ,CAAC,YAAY,CAAC,EAAE,8BAA8B,CAAC,cAAc,CAAC,GAAG,SAAS,CAAC;IACnF,QAAQ,CAAC,cAAc,EAAE,iCAAiC,CAAC;IAC3D,QAAQ,CAAC,aAAa,EAAE,6BAA6B,CAAC;CACvD;AAED,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,UAAU,EACf,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,YAAY,GACjB,6BAA6B,CAuC/B"}
+{"version":3,"file":"runtimeCommon.d.ts","sourceRoot":"","sources":["../../src/qualityIntelligence/runtimeCommon.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,mBAAmB,IAAI,EAAE,EAAE,MAAM,+BAA+B,CAAC;AAC1E,OAAO,EAEL,KAAK,oCAAoC,EACzC,KAAK,6BAA6B,EAClC,KAAK,8BAA8B,EACnC,KAAK,gCAAgC,EACrC,KAAK,+BAA+B,EACrC,MAAM,8BAA8B,CAAC;AAEtC,OAAO,EAIL,KAAK,kBAAkB,EACvB,KAAK,aAAa,EACnB,MAAM,0CAA0C,CAAC;AAElD,OAAO,KAAK,EACV,qCAAqC,EACrC,iCAAiC,EAClC,MAAM,kBAAkB,CAAC;AAK1B,iGAAiG;AACjG,MAAM,WAAW,+BAA+B;IAC9C,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,2BAA2B,KAAK,IAAI,CAAC;CAChE;AAED,iFAAiF;AACjF,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,MAAM,EAAE,MAAM,MAAM,CAAC;CAC/B;AAED,eAAO,MAAM,aAAa,EAAE,wBAE1B,CAAC;AAEH,MAAM,MAAM,iCAAiC,GAAG,8BAA8B,CAAC,gBAAgB,CAAC,CAAC;AAEjG,MAAM,MAAM,4BAA4B,GAAG,WAAW,GAAG,QAAQ,GAAG,WAAW,CAAC;AAEhF,MAAM,WAAW,6BAA6B;IAC5C,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,wBAAwB,CAAC;IAC5C,QAAQ,CAAC,UAAU,EAAE,qCAAqC,CAAC,YAAY,CAAC,CAAC;IACzE,QAAQ,CAAC,MAAM,EAAE,4BAA4B,CAAC;IAC9C,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,qBAAqB,EAAE,MAAM,CAAC;IACvC,QAAQ,CAAC,QAAQ,CAAC,EAAE,+BAA+B,GAAG,SAAS,CAAC;IAChE,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5C;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACvC;AAID,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,UAAU,EAAE,qCAAqC,CAAC;IAC3D,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,0BAA0B,CAAC;IAC7C,QAAQ,CAAC,IAAI,EAAE,+BAA+B,CAAC;IAC/C,QAAQ,CAAC,KAAK,EAAE,wBAAwB,CAAC;IACzC,QAAQ,CAAC,MAAM,EAAE,iCAAiC,CAAC;IACnD,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;IAChC,QAAQ,CAAC,MAAM,EAAE,WAAW,GAAG,SAAS,CAAC;IACzC,QAAQ,EAAE,MAAM,CAAC;IACjB,qBAAqB,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,UAAU,EAAE,qCAAqC,CAAC;IAC3D,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,0BAA0B,CAAC;IAC7C,QAAQ,CAAC,IAAI,EAAE,+BAA+B,CAAC;IAC/C,QAAQ,CAAC,KAAK,CAAC,EAAE,wBAAwB,GAAG,SAAS,CAAC;IACtD,QAAQ,CAAC,MAAM,CAAC,EAAE,iCAAiC,GAAG,SAAS,CAAC;IAChE,QAAQ,CAAC,aAAa,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IACnD,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;CAC3C;AAED,wBAAgB,WAAW,CAAC,IAAI,EAAE,cAAc,GAAG,UAAU,CAY5D;AAQD,wBAAgB,IAAI,CAAC,GAAG,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC,kCAAkC,GAAG,IAAI,CAS1F;AAED,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,UAAU,GAAG,IAAI,CAG1D;AAWD,qBAAa,mBAAoB,SAAQ,KAAK;;CAK7C;AAED,wBAAgB,cAAc,CAAC,GAAG,EAAE,UAAU,GAAG,IAAI,CAIpD;AAyBD,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAYxD;AAED,wBAAsB,SAAS,CAAC,CAAC,EAC/B,GAAG,EAAE,UAAU,EACf,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GACrB,OAAO,CAAC,CAAC,CAAC,CAyBZ;AAID,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,EAC9D,KAAK,EAAE,MAAM,GACZ,SAAS,EAAE,CAAC,oCAAoC,EAAE,CAEpD;AAED,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,EAC5D,KAAK,EAAE,MAAM,GACZ,SAAS,EAAE,CAAC,oCAAoC,EAAE,CAEpD;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,SAAS,kBAAkB,EAAE,EACvC,eAAe,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAC5C,SAAS,oCAAoC,EAAE,CAajD;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,EAAE,CAAC,wBAAwB,EAClC,KAAK,EAAE,SAAS,EAAE,CAAC,+BAA+B,EAAE,EACpD,UAAU,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,EAC9D,eAAe,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAC5C,SAAS,oCAAoC,EAAE,CAGjD;AAED,wBAAgB,qBAAqB,CACnC,GAAG,EAAE,UAAU,EACf,UAAU,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,GAC7D,IAAI,CAQN;AAED,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,UAAU,EACf,QAAQ,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,GAC3D,IAAI,CAIN;AAID,MAAM,MAAM,cAAc,GAAG,SAAS,GAAG,WAAW,GAAG,QAAQ,GAAG,WAAW,CAAC;AAE9E,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC;IAChC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,CAAC;IACtE,QAAQ,CAAC,YAAY,CAAC,EAAE,8BAA8B,CAAC,cAAc,CAAC,GAAG,SAAS,CAAC;IACnF,QAAQ,CAAC,cAAc,EAAE,iCAAiC,CAAC;IAC3D,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,QAAQ,CAAC,aAAa,EAAE,6BAA6B,CAAC;IACtD,QAAQ,CAAC,cAAc,CAAC,EAAE,8BAA8B,CAAC,gBAAgB,CAAC,CAAC;IAC3E,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACtC,QAAQ,CAAC,SAAS,CAAC,EAAE,gCAAgC,CAAC,WAAW,CAAC,CAAC;IACnE,QAAQ,CAAC,kBAAkB,CAAC,EAAE,8BAA8B,CAAC,oBAAoB,CAAC,CAAC;IACnF,QAAQ,CAAC,gBAAgB,CAAC,EAAE,8BAA8B,CAAC,kBAAkB,CAAC,CAAC;IAC/E,0DAA0D;IAC1D,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,4DAA4D;IAC5D,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACnD,wDAAwD;IACxD,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACnC;AAkBD,wBAAgB,UAAU,CAAC,IAAI,EAAE,WAAW,GAAG,+BAA+B,CAkC7E;AAID,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC,oCAAoC,EAAE,CAAC;IACtE,QAAQ,CAAC,YAAY,CAAC,EAAE,8BAA8B,CAAC,cAAc,CAAC,GAAG,SAAS,CAAC;IACnF,QAAQ,CAAC,cAAc,EAAE,iCAAiC,CAAC;IAC3D,QAAQ,CAAC,aAAa,EAAE,6BAA6B,CAAC;CACvD;AAED,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,UAAU,EACf,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,YAAY,GACjB,6BAA6B,CAuC/B"}

package/node_modules/@oscharko-dev/keiko-workflows/dist/qualityIntelligence/runtimeCommon.js

@@ -210,7 +210,10 @@ export function persistRun(args) {
         ...(args.modelParameters !== undefined ? { modelParameters: args.modelParameters } : {}),
         ...(args.seedUsed !== undefined ? { seedUsed: args.seedUsed } : {}),
     };
-    return recordQualityIntelligenceRun(input, { store: args.evidenceStore });
+    return recordQualityIntelligenceRun(input, {
+        store: args.evidenceStore,
+        ...(args.redaction !== undefined ? { redaction: args.redaction } : {}),
+    });
 }
 export function finaliseFailureOrCancellation(ctx, caught, args) {
     // A StageCancelledError, or any error raised while the run signal is aborted, is a cancellation

package/node_modules/@oscharko-dev/keiko-workflows/dist/unit-tests/target-guard.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"target-guard.d.ts","sourceRoot":"","sources":["../../src/unit-tests/target-guard.ts"],"names":[],"mappings":"AAOA,OAAO,EAKL,KAAK,WAAW,EAChB,KAAK,aAAa,EACnB,MAAM,+BAA+B,CAAC;AACvC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAMjD,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,cAAc,GAAG,SAAS,MAAM,EAAE,CAQ1E;AAED,wBAAgB,2BAA2B,CACzC,SAAS,EAAE,aAAa,EACxB,MAAM,EAAE,cAAc,EACtB,EAAE,EAAE,WAAW,GACd,IAAI,CAYN"}
+{"version":3,"file":"target-guard.d.ts","sourceRoot":"","sources":["../../src/unit-tests/target-guard.ts"],"names":[],"mappings":"AAOA,OAAO,EAKL,KAAK,WAAW,EAChB,KAAK,aAAa,EACnB,MAAM,+BAA+B,CAAC;AACvC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAMjD,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,cAAc,GAAG,SAAS,MAAM,EAAE,CAQ1E;AAED,wBAAgB,2BAA2B,CACzC,SAAS,EAAE,aAAa,EACxB,MAAM,EAAE,cAAc,EACtB,EAAE,EAAE,WAAW,GACd,IAAI,CASN"}

package/node_modules/@oscharko-dev/keiko-workflows/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@oscharko-dev/keiko-workflows",
-  "version": "0.2.0-beta.4",
+  "version": "0.2.0-beta.6",
   "private": true,
   "type": "module",
   "license": "Apache-2.0",