instar 1.3.269 → 1.3.270

package/dist/feedback-factory/migration/importIntegrity.d.ts

@@ -0,0 +1,112 @@
+/**
+ * importIntegrity.ts — the integrity-safe import core (spec §2.4).
+ *
+ * "Row counts + spot-check" is too weak to catch silent corruption of the irreplaceable
+ * curated state. This module is the pure, deterministic core of the AS-IS import gate;
+ * the real Prisma adapter wraps these in one transaction (parent-before-child FK order)
+ * and runs the synthetic post-import insert. Keeping the logic pure makes the Phase-2
+ * gate fully unit-testable without a database.
+ *
+ * The gate (spec §2.4): per-row curated-field checksums match (in vs out) + pre-import
+ * fingerprint-uniqueness resolved + schema-equivalence holds + FK referential integrity
+ * + a sequence reset computed so the next post-cutover insert cannot collide (P2002).
+ */
+import type { Cluster, FeedbackItem } from '../processor/types.js';
+/**
+ * Curated cluster fields whose exact preservation the checksum guards. The cluster table
+ * is curated human/LLM judgment, not a cache — every one of these must survive AS-IS.
+ */
+export declare const CURATED_CLUSTER_FIELDS: readonly ["clusterId", "title", "description", "type", "status", "fingerprint", "recurrenceCount", "reportCount", "createdAt", "fixedInVersion", "fixAppliedAt", "dispatchedAt", "governanceNotes", "processingNotes", "actionTaken", "researchNotes", "chronicCount"];
+/** Curated feedback fields (the report rows linked to clusters). */
+export declare const CURATED_FEEDBACK_FIELDS: readonly ["feedbackId", "title", "description", "type", "status", "receivedAt", "instarVersion"];
+/** Deterministic checksum over the named fields of a row (field order fixed by `fields`). */
+export declare function curatedChecksum(row: Record<string, unknown>, fields: readonly string[]): string;
+export declare function clusterChecksum(cluster: Cluster): string;
+export declare function feedbackChecksum(item: FeedbackItem): string;
+export interface ChecksumMismatch {
+    id: string;
+    kind: 'cluster' | 'feedback';
+    reason: 'missing-in-target' | 'extra-in-target' | 'checksum-differs';
+    sourceChecksum?: string;
+    targetChecksum?: string;
+}
+/**
+ * Compare source rows (Dawn's export) against imported rows (canonical instance) by id,
+ * field-by-field via checksum. Returns every divergence — empty array == clean import.
+ */
+export declare function verifyImportChecksums(source: {
+    clusters: Cluster[];
+    feedback: FeedbackItem[];
+}, target: {
+    clusters: Cluster[];
+    feedback: FeedbackItem[];
+}): ChecksumMismatch[];
+/** A set of clusters that collide on `fingerprint` (the @unique constraint would abort the import). */
+export interface FingerprintCollision {
+    fingerprint: string;
+    clusterIds: string[];
+}
+/**
+ * Pre-import uniqueness scan on the SOURCE: curated history may hold two clusters sharing a
+ * fingerprint (after manual merges/edits). An AS-IS import would abort on @unique mid-txn or
+ * silently collapse them — detect + surface BEFORE importing so a human resolves it.
+ */
+export declare function scanFingerprintUniqueness(clusters: Cluster[]): FingerprintCollision[];
+/** A field whose value-domain differs between Dawn's schema and the canonical instance. */
+export interface SchemaDivergence {
+    field: string;
+    kind: 'unknown-status-value' | 'type-mismatch' | 'missing-field';
+    detail: string;
+}
+export interface SchemaDescriptor {
+    /** Allowed lifecycle status values (enum or string union). */
+    statusValues: string[];
+    /** Field → declared type, for the fields the processor reads. */
+    fieldTypes: Record<string, string>;
+}
+/**
+ * Schema-equivalence assertion: every status value the SOURCE uses must be accepted by the
+ * TARGET, and the field types must line up. Mismatched enums or a status the target rejects
+ * would corrupt the import silently — surface it before the transaction.
+ */
+export declare function assertSchemaEquivalence(source: SchemaDescriptor, target: SchemaDescriptor): SchemaDivergence[];
+/** A feedback row pointing at a cluster that does not exist in the import set. */
+export interface DanglingRef {
+    feedbackId: string;
+    clusterId: string;
+}
+/**
+ * FK referential-integrity check (not just row counts): every feedback row that claims a
+ * clusterId must resolve to an imported cluster. Run AFTER the parent-before-child import
+ * to prove no dangling references survived.
+ */
+export declare function checkReferentialIntegrity(clusters: Cluster[], feedback: FeedbackItem[]): DanglingRef[];
+/**
+ * The next auto-increment value to set after importing explicit PKs, so the next NEW
+ * post-cutover insert cannot collide (P2002). Returns maxNumericId + 1, or 1 if no numeric
+ * ids were imported. Non-numeric ids are ignored (cuid/uuid PKs need no sequence reset).
+ */
+export declare function planSequenceReset(importedIds: Array<string | number>): number;
+export interface IntegrityReport {
+    fingerprintCollisions: FingerprintCollision[];
+    schemaDivergences: SchemaDivergence[];
+    checksumMismatches: ChecksumMismatch[];
+    danglingRefs: DanglingRef[];
+    sequenceResetTo: number;
+    /** True only when EVERY check is clean — the Phase-2/4 import gate. */
+    passed: boolean;
+}
+/**
+ * Run the full integrity gate over a source export and its imported copy. `passed` is the
+ * single Phase-2/4 gate boolean; any non-empty divergence list fails it.
+ */
+export declare function runIntegrityGate(source: {
+    clusters: Cluster[];
+    feedback: FeedbackItem[];
+    schema: SchemaDescriptor;
+}, target: {
+    clusters: Cluster[];
+    feedback: FeedbackItem[];
+    schema: SchemaDescriptor;
+}): IntegrityReport;
+//# sourceMappingURL=importIntegrity.d.ts.map

package/dist/feedback-factory/migration/importIntegrity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"importIntegrity.d.ts","sourceRoot":"","sources":["../../../src/feedback-factory/migration/importIntegrity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAEnE;;;GAGG;AACH,eAAO,MAAM,sBAAsB,wQAkBzB,CAAC;AAEX,oEAAoE;AACpE,eAAO,MAAM,uBAAuB,kGAQ1B,CAAC;AAcX,6FAA6F;AAC7F,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAS/F;AAED,wBAAgB,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAExD;AACD,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,CAE3D;AAED,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,SAAS,GAAG,UAAU,CAAC;IAC7B,MAAM,EAAE,mBAAmB,GAAG,iBAAiB,GAAG,kBAAkB,CAAC;IACrE,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE;IAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAAC,QAAQ,EAAE,YAAY,EAAE,CAAA;CAAE,EACzD,MAAM,EAAE;IAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAAC,QAAQ,EAAE,YAAY,EAAE,CAAA;CAAE,GACxD,gBAAgB,EAAE,CAiCpB;AAED,uGAAuG;AACvG,MAAM,WAAW,oBAAoB;IACnC,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED;;;;GAIG;AACH,wBAAgB,yBAAyB,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,oBAAoB,EAAE,CAcrF;AAED,2FAA2F;AAC3F,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,sBAAsB,GAAG,eAAe,GAAG,eAAe,CAAC;IACjE,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,gBAAgB;IAC/B,8DAA8D;IAC9D,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,iEAAiE;IACjE,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACpC;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,MAAM,EAAE,gBAAgB,EAAE,MAAM,EAAE,gBAAgB,GAAG,gBAAgB,EAAE,CAiB9G;AAED,kFAAkF;AAClF,MAAM,WAAW,WAAW;IAC1B,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;GAIG;AACH,wBAAgB,yBAAyB,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,YAAY,EAAE,GAAG,WAAW,EAAE,CAUtG;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAO7E;AAED,MAAM,WAAW,eAAe;IAC9B,qBAAqB,EAAE,oBAAoB,EAAE,CAAC;IAC9C,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;IACtC,kBAAkB,EAAE,gBAAgB,EAAE,CAAC;IACvC,YAAY,EAAE,WAAW,EAAE,CAAC;IAC5B,eAAe,EAAE,MAAM,CAAC;IACxB,uEAAuE;IACvE,MAAM,EAAE,OAAO,CAAC;CACjB;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE;IAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAAC,QAAQ,EAAE,YAAY,EAAE,CAAC;IAAC,MAAM,EAAE,gBAAgB,CAAA;CAAE,EACnF,MAAM,EAAE;IAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAAC,QAAQ,EAAE,YAAY,EAAE,CAAC;IAAC,MAAM,EAAE,gBAAgB,CAAA;CAAE,GAClF,eAAe,CAYjB"}

package/dist/feedback-factory/migration/importIntegrity.js

@@ -0,0 +1,202 @@
+/**
+ * importIntegrity.ts — the integrity-safe import core (spec §2.4).
+ *
+ * "Row counts + spot-check" is too weak to catch silent corruption of the irreplaceable
+ * curated state. This module is the pure, deterministic core of the AS-IS import gate;
+ * the real Prisma adapter wraps these in one transaction (parent-before-child FK order)
+ * and runs the synthetic post-import insert. Keeping the logic pure makes the Phase-2
+ * gate fully unit-testable without a database.
+ *
+ * The gate (spec §2.4): per-row curated-field checksums match (in vs out) + pre-import
+ * fingerprint-uniqueness resolved + schema-equivalence holds + FK referential integrity
+ * + a sequence reset computed so the next post-cutover insert cannot collide (P2002).
+ */
+import { createHash } from 'node:crypto';
+/**
+ * Curated cluster fields whose exact preservation the checksum guards. The cluster table
+ * is curated human/LLM judgment, not a cache — every one of these must survive AS-IS.
+ */
+export const CURATED_CLUSTER_FIELDS = [
+    'clusterId',
+    'title',
+    'description',
+    'type',
+    'status',
+    'fingerprint',
+    'recurrenceCount',
+    'reportCount',
+    'createdAt',
+    'fixedInVersion',
+    'fixAppliedAt',
+    'dispatchedAt',
+    'governanceNotes',
+    'processingNotes',
+    'actionTaken',
+    'researchNotes',
+    'chronicCount',
+];
+/** Curated feedback fields (the report rows linked to clusters). */
+export const CURATED_FEEDBACK_FIELDS = [
+    'feedbackId',
+    'title',
+    'description',
+    'type',
+    'status',
+    'receivedAt',
+    'instarVersion',
+];
+/**
+ * Canonicalize a value for checksumming so that semantically-identical rows hash equal
+ * across the source→target hop. null and undefined and "" all collapse to "" (the
+ * null-vs-empty governance-note distinction is asserted separately by schema-equivalence;
+ * the checksum must not flap on it). Everything else is JSON-stringified.
+ */
+function canonicalValue(v) {
+    if (v === null || v === undefined || v === '')
+        return '';
+    if (typeof v === 'number' && Number.isNaN(v))
+        return 'NaN';
+    return JSON.stringify(v);
+}
+/** Deterministic checksum over the named fields of a row (field order fixed by `fields`). */
+export function curatedChecksum(row, fields) {
+    const h = createHash('sha256');
+    for (const f of fields) {
+        h.update(f);
+        h.update('\x1f'); // unit separator: field-name | value
+        h.update(canonicalValue(row[f]));
+        h.update('\x1e'); // record separator after each field (no cross-field run ambiguity)
+    }
+    return h.digest('hex');
+}
+export function clusterChecksum(cluster) {
+    return curatedChecksum(cluster, CURATED_CLUSTER_FIELDS);
+}
+export function feedbackChecksum(item) {
+    return curatedChecksum(item, CURATED_FEEDBACK_FIELDS);
+}
+/**
+ * Compare source rows (Dawn's export) against imported rows (canonical instance) by id,
+ * field-by-field via checksum. Returns every divergence — empty array == clean import.
+ */
+export function verifyImportChecksums(source, target) {
+    const out = [];
+    const verify = (kind, idField, src, tgt, checksum) => {
+        const tgtById = new Map(tgt.map((r) => [String(r[idField]), r]));
+        const seen = new Set();
+        for (const s of src) {
+            const id = String(s[idField]);
+            seen.add(id);
+            const t = tgtById.get(id);
+            if (!t) {
+                out.push({ id, kind, reason: 'missing-in-target', sourceChecksum: checksum(s) });
+                continue;
+            }
+            const sc = checksum(s);
+            const tc = checksum(t);
+            if (sc !== tc)
+                out.push({ id, kind, reason: 'checksum-differs', sourceChecksum: sc, targetChecksum: tc });
+        }
+        for (const t of tgt) {
+            const id = String(t[idField]);
+            if (!seen.has(id))
+                out.push({ id, kind, reason: 'extra-in-target', targetChecksum: checksum(t) });
+        }
+    };
+    verify('cluster', 'clusterId', source.clusters, target.clusters, (c) => clusterChecksum(c));
+    verify('feedback', 'feedbackId', source.feedback, target.feedback, (f) => feedbackChecksum(f));
+    return out;
+}
+/**
+ * Pre-import uniqueness scan on the SOURCE: curated history may hold two clusters sharing a
+ * fingerprint (after manual merges/edits). An AS-IS import would abort on @unique mid-txn or
+ * silently collapse them — detect + surface BEFORE importing so a human resolves it.
+ */
+export function scanFingerprintUniqueness(clusters) {
+    const byFp = new Map();
+    for (const c of clusters) {
+        const fp = typeof c.fingerprint === 'string' ? c.fingerprint : '';
+        if (!fp)
+            continue; // a missing fingerprint isn't a @unique collision
+        const arr = byFp.get(fp) ?? [];
+        arr.push(c.clusterId);
+        byFp.set(fp, arr);
+    }
+    const out = [];
+    for (const [fingerprint, clusterIds] of byFp) {
+        if (clusterIds.length > 1)
+            out.push({ fingerprint, clusterIds });
+    }
+    return out;
+}
+/**
+ * Schema-equivalence assertion: every status value the SOURCE uses must be accepted by the
+ * TARGET, and the field types must line up. Mismatched enums or a status the target rejects
+ * would corrupt the import silently — surface it before the transaction.
+ */
+export function assertSchemaEquivalence(source, target) {
+    const out = [];
+    const targetStatus = new Set(target.statusValues);
+    for (const s of source.statusValues) {
+        if (!targetStatus.has(s)) {
+            out.push({ field: 'status', kind: 'unknown-status-value', detail: `target does not accept status "${s}"` });
+        }
+    }
+    for (const [field, srcType] of Object.entries(source.fieldTypes)) {
+        const tgtType = target.fieldTypes[field];
+        if (tgtType === undefined) {
+            out.push({ field, kind: 'missing-field', detail: `target schema has no field "${field}"` });
+        }
+        else if (tgtType !== srcType) {
+            out.push({ field, kind: 'type-mismatch', detail: `source ${srcType} vs target ${tgtType}` });
+        }
+    }
+    return out;
+}
+/**
+ * FK referential-integrity check (not just row counts): every feedback row that claims a
+ * clusterId must resolve to an imported cluster. Run AFTER the parent-before-child import
+ * to prove no dangling references survived.
+ */
+export function checkReferentialIntegrity(clusters, feedback) {
+    const clusterIds = new Set(clusters.map((c) => c.clusterId));
+    const out = [];
+    for (const f of feedback) {
+        const cid = f.clusterId;
+        if (typeof cid === 'string' && cid.length > 0 && !clusterIds.has(cid)) {
+            out.push({ feedbackId: f.feedbackId, clusterId: cid });
+        }
+    }
+    return out;
+}
+/**
+ * The next auto-increment value to set after importing explicit PKs, so the next NEW
+ * post-cutover insert cannot collide (P2002). Returns maxNumericId + 1, or 1 if no numeric
+ * ids were imported. Non-numeric ids are ignored (cuid/uuid PKs need no sequence reset).
+ */
+export function planSequenceReset(importedIds) {
+    let max = 0;
+    for (const id of importedIds) {
+        const n = typeof id === 'number' ? id : Number(id);
+        if (Number.isFinite(n) && n > max)
+            max = Math.floor(n);
+    }
+    return max + 1;
+}
+/**
+ * Run the full integrity gate over a source export and its imported copy. `passed` is the
+ * single Phase-2/4 gate boolean; any non-empty divergence list fails it.
+ */
+export function runIntegrityGate(source, target) {
+    const fingerprintCollisions = scanFingerprintUniqueness(source.clusters);
+    const schemaDivergences = assertSchemaEquivalence(source.schema, target.schema);
+    const checksumMismatches = verifyImportChecksums(source, target);
+    const danglingRefs = checkReferentialIntegrity(target.clusters, target.feedback);
+    const sequenceResetTo = planSequenceReset(target.clusters.map((c) => c.clusterId));
+    const passed = fingerprintCollisions.length === 0 &&
+        schemaDivergences.length === 0 &&
+        checksumMismatches.length === 0 &&
+        danglingRefs.length === 0;
+    return { fingerprintCollisions, schemaDivergences, checksumMismatches, danglingRefs, sequenceResetTo, passed };
+}
+//# sourceMappingURL=importIntegrity.js.map

package/dist/feedback-factory/migration/importIntegrity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"importIntegrity.js","sourceRoot":"","sources":["../../../src/feedback-factory/migration/importIntegrity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAGzC;;;GAGG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG;IACpC,WAAW;IACX,OAAO;IACP,aAAa;IACb,MAAM;IACN,QAAQ;IACR,aAAa;IACb,iBAAiB;IACjB,aAAa;IACb,WAAW;IACX,gBAAgB;IAChB,cAAc;IACd,cAAc;IACd,iBAAiB;IACjB,iBAAiB;IACjB,aAAa;IACb,eAAe;IACf,cAAc;CACN,CAAC;AAEX,oEAAoE;AACpE,MAAM,CAAC,MAAM,uBAAuB,GAAG;IACrC,YAAY;IACZ,OAAO;IACP,aAAa;IACb,MAAM;IACN,QAAQ;IACR,YAAY;IACZ,eAAe;CACP,CAAC;AAEX;;;;;GAKG;AACH,SAAS,cAAc,CAAC,CAAU;IAChC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACzD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IAC3D,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,eAAe,CAAC,GAA4B,EAAE,MAAyB;IACrF,MAAM,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACZ,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,qCAAqC;QACvD,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,mEAAmE;IACvF,CAAC;IACD,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACzB,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,OAAgB;IAC9C,OAAO,eAAe,CAAC,OAAkC,EAAE,sBAAsB,CAAC,CAAC;AACrF,CAAC;AACD,MAAM,UAAU,gBAAgB,CAAC,IAAkB;IACjD,OAAO,eAAe,CAAC,IAA+B,EAAE,uBAAuB,CAAC,CAAC;AACnF,CAAC;AAUD;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,MAAyD,EACzD,MAAyD;IAEzD,MAAM,GAAG,GAAuB,EAAE,CAAC;IAEnC,MAAM,MAAM,GAAG,CACb,IAA4B,EAC5B,OAAe,EACf,GAAQ,EACR,GAAQ,EACR,QAA4B,EAC5B,EAAE;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACb,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1B,IAAI,CAAC,CAAC,EAAE,CAAC;gBACP,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,mBAAmB,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACjF,SAAS;YACX,CAAC;YACD,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,EAAE,KAAK,EAAE;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,kBAAkB,EAAE,cAAc,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5G,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,iBAAiB,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpG,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,CAAC,SAAS,EAAE,WAAW,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAY,CAAC,CAAC,CAAC;IACvG,MAAM,CAAC,UAAU,EAAE,YAAY,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAiB,CAAC,CAAC,CAAC;IAC/G,OAAO,GAAG,CAAC;AACb,CAAC;AAQD;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CAAC,QAAmB;IAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,IAAI,CAAC,EAAE;YAAE,SAAS,CAAC,kDAAkD;QACrE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC/B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;IACD,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,WAAW,EAAE,UAAU,CAAC,IAAI,IAAI,EAAE,CAAC;QAC7C,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAgBD;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CAAC,MAAwB,EAAE,MAAwB;IACxF,MAAM,GAAG,GAAuB,EAAE,CAAC;IACnC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACpC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,sBAAsB,EAAE,MAAM,EAAE,kCAAkC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC9G,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;QACjE,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACzC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,EAAE,+BAA+B,KAAK,GAAG,EAAE,CAAC,CAAC;QAC9F,CAAC;aAAM,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YAC/B,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,EAAE,UAAU,OAAO,cAAc,OAAO,EAAE,EAAE,CAAC,CAAC;QAC/F,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAQD;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CAAC,QAAmB,EAAE,QAAwB;IACrF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,GAAG,GAAI,CAA6B,CAAC,SAAS,CAAC;QACrD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACtE,GAAG,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,WAAmC;IACnE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACnD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,GAAG,GAAG,CAAC,CAAC;AACjB,CAAC;AAYD;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAmF,EACnF,MAAmF;IAEnF,MAAM,qBAAqB,GAAG,yBAAyB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACzE,MAAM,iBAAiB,GAAG,uBAAuB,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IAChF,MAAM,kBAAkB,GAAG,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjE,MAAM,YAAY,GAAG,yBAAyB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACjF,MAAM,eAAe,GAAG,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACnF,MAAM,MAAM,GACV,qBAAqB,CAAC,MAAM,KAAK,CAAC;QAClC,iBAAiB,CAAC,MAAM,KAAK,CAAC;QAC9B,kBAAkB,CAAC,MAAM,KAAK,CAAC;QAC/B,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC;IAC5B,OAAO,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC;AACjH,CAAC"}

package/dist/feedback-factory/monitor/parityMonitor.d.ts

@@ -0,0 +1,75 @@
+/**
+ * parityMonitor.ts — the Phase-3 live dual-forward parity MONITOR + cutover gate (spec §2.5).
+ *
+ * The per-pass comparison already exists (processor/parity.ts → ParityResult over the
+ * order-independent invariants: per-report fingerprint, terminal-status, recurrence/cycling
+ * counts — NOT raw cluster membership, which is order-dependent and would flap on benign
+ * arrival-order noise). What Phase 3 needs ON TOP of one comparison is the WINDOW: run the
+ * comparison repeatedly over real dual-forward traffic and only clear the cutover when a
+ * genuine zero-divergence window has elapsed.
+ *
+ * This monitor records each pass, tracks the current zero-divergence streak (ANY divergent
+ * pass resets it), and exposes the single structural gate `gate()` → cleared/blocked. That
+ * `cleared` boolean is the objective `parity-zero-divergence` condition the Coordination
+ * Mandate's `execute-cutover` authority reads — the agent cannot fake it; the window decides.
+ *
+ * Structure > Willpower: cutover is blocked by the gate, not by an agent deciding "looks
+ * good". The pure core here is fully unit-testable; a thin durable wrapper (below) persists
+ * passes so the window survives a restart, since it spans real traffic time.
+ */
+import type { ParityResult } from '../processor/parity.js';
+/** One recorded comparison pass over a dual-forward traffic slice. */
+export interface MonitorPass {
+    /** ISO timestamp of this pass. */
+    at: string;
+    /** Clusters compared in this pass (the meaningful-sample input). */
+    clustersCompared: number;
+    /** Total divergences this pass (fingerprint + outcome). 0 == clean. */
+    divergences: number;
+    /** Convenience mirror of `divergences > 0`. */
+    divergent: boolean;
+}
+/** The window a clean streak must satisfy before the cutover gate clears. */
+export interface CutoverGatePolicy {
+    /** Consecutive zero-divergence passes required (default 3). */
+    requiredCleanPasses: number;
+    /** The clean streak must span at least this much REAL time (default 1h). */
+    minWindowMs: number;
+    /** Total clusters compared across the clean streak — a meaningful sample (default 1). */
+    minClustersObserved: number;
+}
+export declare const DEFAULT_GATE_POLICY: CutoverGatePolicy;
+export interface CutoverGateStatus {
+    /** The structural signal: true only when the zero-divergence window is genuinely satisfied. */
+    cleared: boolean;
+    reason: string;
+    cleanPasses: number;
+    windowMs: number;
+    clustersObserved: number;
+    /** ISO of the most recent divergent pass (the streak reset point), or null if never. */
+    lastDivergentAt: string | null;
+}
+/**
+ * Records parity passes and computes the cutover gate over the current zero-divergence
+ * streak. Pure + clock-injected (gate(now) takes the current time) → fully testable.
+ */
+export declare class ParityMonitor {
+    private readonly policy;
+    private readonly _passes;
+    constructor(policy?: Partial<CutoverGatePolicy>);
+    /** Feed a raw pass record. */
+    record(pass: MonitorPass): void;
+    /** Convenience: record straight from a ParityResult + the pass timestamp. */
+    recordResult(result: ParityResult, at: string): void;
+    get passes(): readonly MonitorPass[];
+    /**
+     * The structural cutover gate. `cleared` is true only when the trailing run of passes is:
+     *   - all clean (zero divergence), AND
+     *   - at least `requiredCleanPasses` long, AND
+     *   - spanning at least `minWindowMs` of real time (first-clean-pass → now), AND
+     *   - covering at least `minClustersObserved` clusters in total.
+     * Any divergent pass resets the streak. No passes → blocked.
+     */
+    gate(now: string): CutoverGateStatus;
+}
+//# sourceMappingURL=parityMonitor.d.ts.map

package/dist/feedback-factory/monitor/parityMonitor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parityMonitor.d.ts","sourceRoot":"","sources":["../../../src/feedback-factory/monitor/parityMonitor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAE3D,sEAAsE;AACtE,MAAM,WAAW,WAAW;IAC1B,kCAAkC;IAClC,EAAE,EAAE,MAAM,CAAC;IACX,oEAAoE;IACpE,gBAAgB,EAAE,MAAM,CAAC;IACzB,uEAAuE;IACvE,WAAW,EAAE,MAAM,CAAC;IACpB,+CAA+C;IAC/C,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,6EAA6E;AAC7E,MAAM,WAAW,iBAAiB;IAChC,+DAA+D;IAC/D,mBAAmB,EAAE,MAAM,CAAC;IAC5B,4EAA4E;IAC5E,WAAW,EAAE,MAAM,CAAC;IACpB,yFAAyF;IACzF,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED,eAAO,MAAM,mBAAmB,EAAE,iBAIjC,CAAC;AAEF,MAAM,WAAW,iBAAiB;IAChC,+FAA+F;IAC/F,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;IACjB,gBAAgB,EAAE,MAAM,CAAC;IACzB,wFAAwF;IACxF,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAMD;;;GAGG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAoB;IAC3C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAqB;gBAEjC,MAAM,GAAE,OAAO,CAAC,iBAAiB,CAAM;IAInD,8BAA8B;IAC9B,MAAM,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IAI/B,6EAA6E;IAC7E,YAAY,CAAC,MAAM,EAAE,YAAY,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI;IAKpD,IAAI,MAAM,IAAI,SAAS,WAAW,EAAE,CAEnC;IAED;;;;;;;OAOG;IACH,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,iBAAiB;CAwCrC"}

package/dist/feedback-factory/monitor/parityMonitor.js

@@ -0,0 +1,98 @@
+/**
+ * parityMonitor.ts — the Phase-3 live dual-forward parity MONITOR + cutover gate (spec §2.5).
+ *
+ * The per-pass comparison already exists (processor/parity.ts → ParityResult over the
+ * order-independent invariants: per-report fingerprint, terminal-status, recurrence/cycling
+ * counts — NOT raw cluster membership, which is order-dependent and would flap on benign
+ * arrival-order noise). What Phase 3 needs ON TOP of one comparison is the WINDOW: run the
+ * comparison repeatedly over real dual-forward traffic and only clear the cutover when a
+ * genuine zero-divergence window has elapsed.
+ *
+ * This monitor records each pass, tracks the current zero-divergence streak (ANY divergent
+ * pass resets it), and exposes the single structural gate `gate()` → cleared/blocked. That
+ * `cleared` boolean is the objective `parity-zero-divergence` condition the Coordination
+ * Mandate's `execute-cutover` authority reads — the agent cannot fake it; the window decides.
+ *
+ * Structure > Willpower: cutover is blocked by the gate, not by an agent deciding "looks
+ * good". The pure core here is fully unit-testable; a thin durable wrapper (below) persists
+ * passes so the window survives a restart, since it spans real traffic time.
+ */
+export const DEFAULT_GATE_POLICY = {
+    requiredCleanPasses: 3,
+    minWindowMs: 60 * 60 * 1000,
+    minClustersObserved: 1,
+};
+function passDivergences(r) {
+    return r.fingerprintDivergences.length + r.outcomeDivergences.length;
+}
+/**
+ * Records parity passes and computes the cutover gate over the current zero-divergence
+ * streak. Pure + clock-injected (gate(now) takes the current time) → fully testable.
+ */
+export class ParityMonitor {
+    policy;
+    _passes = [];
+    constructor(policy = {}) {
+        this.policy = { ...DEFAULT_GATE_POLICY, ...policy };
+    }
+    /** Feed a raw pass record. */
+    record(pass) {
+        this._passes.push(pass);
+    }
+    /** Convenience: record straight from a ParityResult + the pass timestamp. */
+    recordResult(result, at) {
+        const divergences = passDivergences(result);
+        this._passes.push({ at, clustersCompared: result.clustersCompared, divergences, divergent: divergences > 0 });
+    }
+    get passes() {
+        return this._passes;
+    }
+    /**
+     * The structural cutover gate. `cleared` is true only when the trailing run of passes is:
+     *   - all clean (zero divergence), AND
+     *   - at least `requiredCleanPasses` long, AND
+     *   - spanning at least `minWindowMs` of real time (first-clean-pass → now), AND
+     *   - covering at least `minClustersObserved` clusters in total.
+     * Any divergent pass resets the streak. No passes → blocked.
+     */
+    gate(now) {
+        // Find the index just after the most recent divergent pass — the start of the clean streak.
+        let streakStart = 0;
+        let lastDivergentAt = null;
+        for (let i = this._passes.length - 1; i >= 0; i--) {
+            if (this._passes[i].divergent) {
+                streakStart = i + 1;
+                lastDivergentAt = this._passes[i].at;
+                break;
+            }
+        }
+        const streak = this._passes.slice(streakStart);
+        const cleanPasses = streak.length;
+        const clustersObserved = streak.reduce((s, p) => s + p.clustersCompared, 0);
+        const nowMs = Date.parse(now);
+        const firstCleanMs = cleanPasses > 0 ? Date.parse(streak[0].at) : nowMs;
+        const windowMs = Number.isNaN(nowMs) || Number.isNaN(firstCleanMs) ? 0 : Math.max(0, nowMs - firstCleanMs);
+        const reasons = [];
+        if (cleanPasses < this.policy.requiredCleanPasses) {
+            reasons.push(`need ${this.policy.requiredCleanPasses} consecutive clean passes, have ${cleanPasses}`);
+        }
+        if (windowMs < this.policy.minWindowMs) {
+            reasons.push(`clean window ${Math.round(windowMs / 1000)}s < required ${Math.round(this.policy.minWindowMs / 1000)}s`);
+        }
+        if (clustersObserved < this.policy.minClustersObserved) {
+            reasons.push(`observed ${clustersObserved} clusters < required ${this.policy.minClustersObserved}`);
+        }
+        const cleared = reasons.length === 0;
+        return {
+            cleared,
+            reason: cleared
+                ? `zero-divergence window satisfied: ${cleanPasses} clean passes over ${Math.round(windowMs / 1000)}s, ${clustersObserved} clusters`
+                : reasons.join('; '),
+            cleanPasses,
+            windowMs,
+            clustersObserved,
+            lastDivergentAt,
+        };
+    }
+}
+//# sourceMappingURL=parityMonitor.js.map

package/dist/feedback-factory/monitor/parityMonitor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parityMonitor.js","sourceRoot":"","sources":["../../../src/feedback-factory/monitor/parityMonitor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AA0BH,MAAM,CAAC,MAAM,mBAAmB,GAAsB;IACpD,mBAAmB,EAAE,CAAC;IACtB,WAAW,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI;IAC3B,mBAAmB,EAAE,CAAC;CACvB,CAAC;AAaF,SAAS,eAAe,CAAC,CAAe;IACtC,OAAO,CAAC,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC;AACvE,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,aAAa;IACP,MAAM,CAAoB;IAC1B,OAAO,GAAkB,EAAE,CAAC;IAE7C,YAAY,SAAqC,EAAE;QACjD,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,mBAAmB,EAAE,GAAG,MAAM,EAAE,CAAC;IACtD,CAAC;IAED,8BAA8B;IAC9B,MAAM,CAAC,IAAiB;QACtB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,6EAA6E;IAC7E,YAAY,CAAC,MAAoB,EAAE,EAAU;QAC3C,MAAM,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,GAAG,CAAC,EAAE,CAAC,CAAC;IAChH,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,CAAC,GAAW;QACd,4FAA4F;QAC5F,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,eAAe,GAAkB,IAAI,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;gBAC9B,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC;gBACpB,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrC,MAAM;YACR,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC/C,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC;QAClC,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;QAC5E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,YAAY,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACxE,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,YAAY,CAAC,CAAC;QAE3G,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC;YAClD,OAAO,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,mBAAmB,mCAAmC,WAAW,EAAE,CAAC,CAAC;QACxG,CAAC;QACD,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YACvC,OAAO,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACzH,CAAC;QACD,IAAI,gBAAgB,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC;YACvD,OAAO,CAAC,IAAI,CAAC,YAAY,gBAAgB,wBAAwB,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC,CAAC;QACtG,CAAC;QACD,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;QACrC,OAAO;YACL,OAAO;YACP,MAAM,EAAE,OAAO;gBACb,CAAC,CAAC,qCAAqC,WAAW,sBAAsB,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,gBAAgB,WAAW;gBACpI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;YACtB,WAAW;YACX,QAAQ;YACR,gBAAgB;YAChB,eAAe;SAChB,CAAC;IACJ,CAAC;CACF"}

package/dist/feedback-factory/monitor/parityMonitorStore.d.ts

@@ -0,0 +1,44 @@
+/**
+ * parityMonitorStore.ts — durable persistence for the Phase-3 parity monitor.
+ *
+ * The zero-divergence window that gates cutover spans HOURS of real dual-forward traffic.
+ * If the monitor's passes lived only in memory, a server restart mid-window would silently
+ * reset the streak — at best re-blocking cutover (conservative, survivable), at worst making
+ * the gate's `windowMs` meaningless across the very restart it must survive. So passes are
+ * appended to a JSONL and reloaded on construction: the window is durable across restarts.
+ *
+ * Append-only JSONL (one MonitorPass per line) matches Instar's file-based-state convention
+ * and is crash-safe (a torn final line is skipped on reload, never corrupting the rest).
+ * The pure ParityMonitor stays the gate brain; this is the I/O shell around it.
+ */
+import { type CutoverGatePolicy, type CutoverGateStatus, type MonitorPass } from './parityMonitor.js';
+import type { ParityResult } from '../processor/parity.js';
+/** Injectable I/O so unit tests can drive the durable layer without touching disk. */
+export interface PassPersistence {
+    /** Load all previously-recorded passes, oldest-first. */
+    load(): MonitorPass[];
+    /** Durably append one pass. */
+    append(pass: MonitorPass): void;
+}
+/** The default JSONL-on-disk persistence (append-only, torn-line tolerant). */
+export declare class JsonlPassPersistence implements PassPersistence {
+    private readonly path;
+    constructor(path: string);
+    load(): MonitorPass[];
+    append(pass: MonitorPass): void;
+}
+/**
+ * A ParityMonitor whose passes survive a restart. Reloads persisted passes on construction,
+ * then every record() both persists and feeds the in-memory monitor. gate() delegates to the
+ * monitor over the full (reloaded + new) history.
+ */
+export declare class DurableParityMonitor {
+    private readonly monitor;
+    private readonly persistence;
+    constructor(persistence: PassPersistence, policy?: Partial<CutoverGatePolicy>);
+    record(pass: MonitorPass): void;
+    recordResult(result: ParityResult, at: string): void;
+    gate(now: string): CutoverGateStatus;
+    get passes(): readonly MonitorPass[];
+}
+//# sourceMappingURL=parityMonitorStore.d.ts.map

package/dist/feedback-factory/monitor/parityMonitorStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parityMonitorStore.d.ts","sourceRoot":"","sources":["../../../src/feedback-factory/monitor/parityMonitorStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,OAAO,EAAiB,KAAK,iBAAiB,EAAE,KAAK,iBAAiB,EAAE,KAAK,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACrH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAE3D,sFAAsF;AACtF,MAAM,WAAW,eAAe;IAC9B,yDAAyD;IACzD,IAAI,IAAI,WAAW,EAAE,CAAC;IACtB,+BAA+B;IAC/B,MAAM,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI,CAAC;CACjC;AAED,+EAA+E;AAC/E,qBAAa,oBAAqB,YAAW,eAAe;IAC9C,OAAO,CAAC,QAAQ,CAAC,IAAI;gBAAJ,IAAI,EAAE,MAAM;IAEzC,IAAI,IAAI,WAAW,EAAE;IAqBrB,MAAM,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;CAIhC;AAED;;;;GAIG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAgB;IACxC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAkB;gBAElC,WAAW,EAAE,eAAe,EAAE,MAAM,GAAE,OAAO,CAAC,iBAAiB,CAAM;IAMjF,MAAM,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IAK/B,YAAY,CAAC,MAAM,EAAE,YAAY,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI;IAKpD,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,iBAAiB;IAIpC,IAAI,MAAM,IAAI,SAAS,WAAW,EAAE,CAEnC;CACF"}

package/dist/feedback-factory/monitor/parityMonitorStore.js

@@ -0,0 +1,80 @@
+/**
+ * parityMonitorStore.ts — durable persistence for the Phase-3 parity monitor.
+ *
+ * The zero-divergence window that gates cutover spans HOURS of real dual-forward traffic.
+ * If the monitor's passes lived only in memory, a server restart mid-window would silently
+ * reset the streak — at best re-blocking cutover (conservative, survivable), at worst making
+ * the gate's `windowMs` meaningless across the very restart it must survive. So passes are
+ * appended to a JSONL and reloaded on construction: the window is durable across restarts.
+ *
+ * Append-only JSONL (one MonitorPass per line) matches Instar's file-based-state convention
+ * and is crash-safe (a torn final line is skipped on reload, never corrupting the rest).
+ * The pure ParityMonitor stays the gate brain; this is the I/O shell around it.
+ */
+import { appendFileSync, readFileSync, mkdirSync, existsSync } from 'node:fs';
+import { dirname } from 'node:path';
+import { ParityMonitor } from './parityMonitor.js';
+/** The default JSONL-on-disk persistence (append-only, torn-line tolerant). */
+export class JsonlPassPersistence {
+    path;
+    constructor(path) {
+        this.path = path;
+    }
+    load() {
+        if (!existsSync(this.path))
+            return [];
+        const out = [];
+        const lines = readFileSync(this.path, 'utf8').split('\n');
+        for (const line of lines) {
+            const trimmed = line.trim();
+            if (!trimmed)
+                continue;
+            try {
+                const p = JSON.parse(trimmed);
+                // Defensive: only accept well-formed pass records.
+                if (typeof p.at === 'string' && typeof p.clustersCompared === 'number' && typeof p.divergences === 'number') {
+                    out.push({ at: p.at, clustersCompared: p.clustersCompared, divergences: p.divergences, divergent: !!p.divergent });
+                }
+            }
+            catch {
+                // A torn final line (crash mid-append) is skipped, never corrupting the prior window.
+                // @silent-fallback-ok — durability is best-effort-forward; a bad line is dropped, loudly recoverable.
+            }
+        }
+        return out;
+    }
+    append(pass) {
+        mkdirSync(dirname(this.path), { recursive: true });
+        appendFileSync(this.path, JSON.stringify(pass) + '\n');
+    }
+}
+/**
+ * A ParityMonitor whose passes survive a restart. Reloads persisted passes on construction,
+ * then every record() both persists and feeds the in-memory monitor. gate() delegates to the
+ * monitor over the full (reloaded + new) history.
+ */
+export class DurableParityMonitor {
+    monitor;
+    persistence;
+    constructor(persistence, policy = {}) {
+        this.persistence = persistence;
+        this.monitor = new ParityMonitor(policy);
+        for (const p of persistence.load())
+            this.monitor.record(p);
+    }
+    record(pass) {
+        this.persistence.append(pass);
+        this.monitor.record(pass);
+    }
+    recordResult(result, at) {
+        const divergences = result.fingerprintDivergences.length + result.outcomeDivergences.length;
+        this.record({ at, clustersCompared: result.clustersCompared, divergences, divergent: divergences > 0 });
+    }
+    gate(now) {
+        return this.monitor.gate(now);
+    }
+    get passes() {
+        return this.monitor.passes;
+    }
+}
+//# sourceMappingURL=parityMonitorStore.js.map

package/dist/feedback-factory/monitor/parityMonitorStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parityMonitorStore.js","sourceRoot":"","sources":["../../../src/feedback-factory/monitor/parityMonitorStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAC9E,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,aAAa,EAAoE,MAAM,oBAAoB,CAAC;AAWrH,+EAA+E;AAC/E,MAAM,OAAO,oBAAoB;IACF;IAA7B,YAA6B,IAAY;QAAZ,SAAI,GAAJ,IAAI,CAAQ;IAAG,CAAC;IAE7C,IAAI;QACF,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QACtC,MAAM,GAAG,GAAkB,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,IAAI,CAAC;gBACH,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAgB,CAAC;gBAC7C,mDAAmD;gBACnD,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,gBAAgB,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;oBAC5G,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC,gBAAgB,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;gBACrH,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,sFAAsF;gBACtF,sGAAsG;YACxG,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,CAAC,IAAiB;QACtB,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACnD,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IACzD,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,oBAAoB;IACd,OAAO,CAAgB;IACvB,WAAW,CAAkB;IAE9C,YAAY,WAA4B,EAAE,SAAqC,EAAE;QAC/E,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,IAAI,EAAE;YAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,MAAM,CAAC,IAAiB;QACtB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,YAAY,CAAC,MAAoB,EAAE,EAAU;QAC3C,MAAM,WAAW,GAAG,MAAM,CAAC,sBAAsB,CAAC,MAAM,GAAG,MAAM,CAAC,kBAAkB,CAAC,MAAM,CAAC;QAC5F,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,GAAG,CAAC,EAAE,CAAC,CAAC;IAC1G,CAAC;IAED,IAAI,CAAC,GAAW;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;CACF"}