@aligndottech/cli 0.49.0 → 0.51.0

package/dist/lib/local-db-v11.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Schema v11 (ALI-1527): re-key zoom rows after connector-core 0.10.1 changed the zoom source key.
+ *
+ * Until 0.10.1 the key dropped the whole query for zoom, so the gateway's Discover recording URL
+ * `https://zoom.us/recording/detail?meeting_id=<uuid>` keyed every meeting to
+ * `zoom|https://zoom.us/recording/detail`. The key now keeps `meeting_id`. A graph written by an
+ * older build can still hold a row under the collapsed key (the v7 twin merge folded every
+ * Discover recording it saw into one such row).
+ *
+ * What it does: for each zoom row that has a key, recompute the key from the row's own source_url
+ * with the current function. Same key: untouched. A key that no longer exists (the URL names no
+ * item): cleared, and the row keeps its (source_url, title) identity. A different key that another
+ * row already holds: the two are twins, folded with the v7 fold (a ratified or confirmed row
+ * survives, everything that named the loser is re-pointed, the loser is backed up). Otherwise the
+ * key is rewritten in place, so the id, ratification, judgements and promotions are untouched.
+ *
+ * It does NOT bring back rows the v7 merge already folded away under the collapsed key: those are
+ * in `decisions_merged_backup`, and which of them were distinct meetings is a decision for a person.
+ *
+ * Replay-safe: a row already on the current key is skipped, so a second pass finds nothing.
+ */
+import type { DatabaseSync } from 'node:sqlite';
+export declare function migrateV11(db: DatabaseSync): void;
+//# sourceMappingURL=local-db-v11.d.ts.map

package/dist/lib/local-db-v11.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-db-v11.d.ts","sourceRoot":"","sources":["../../src/lib/local-db-v11.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAMhD,wBAAgB,UAAU,CAAC,EAAE,EAAE,YAAY,GAAG,IAAI,CAmBjD"}

package/dist/lib/local-db-v11.js

@@ -0,0 +1,25 @@
+import { foldTwins } from './local-db-v7.js';
+import { connectorItemKey } from './source-key.js';
+const TWIN_COLUMNS = 'id, rowid, created_at, title, summary, ratified_by, ratified_at, confirmed_by, confirmed_at';
+export function migrateV11(db) {
+    const rows = db.prepare(`SELECT id, source_url, source_key FROM decisions WHERE platform = 'zoom' AND source_key IS NOT NULL AND source_url IS NOT NULL ORDER BY rowid`)
+        .all();
+    for (const row of rows) {
+        const next = connectorItemKey('zoom', row.source_url);
+        if (next === row.source_key)
+            continue;
+        if (next === undefined) {
+            db.prepare('UPDATE decisions SET source_key = NULL WHERE id = ?').run(row.id);
+            continue;
+        }
+        const holder = db.prepare('SELECT id FROM decisions WHERE source_key = ? AND id <> ?').get(next, row.id);
+        if (holder === undefined) {
+            db.prepare('UPDATE decisions SET source_key = ? WHERE id = ?').run(next, row.id);
+            continue;
+        }
+        const twins = db.prepare(`SELECT ${TWIN_COLUMNS} FROM decisions WHERE id IN (?, ?) ORDER BY rowid`).all(row.id, holder.id);
+        // The row holding the right key is the preferred survivor when neither is attested.
+        foldTwins(db, twins, next, 'migration', holder.id);
+    }
+}
+//# sourceMappingURL=local-db-v11.js.map

package/dist/lib/local-db-v11.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-db-v11.js","sourceRoot":"","sources":["../../src/lib/local-db-v11.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAE,SAAS,EAAgB,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAEnD,MAAM,YAAY,GAAG,6FAA6F,CAAC;AAEnH,MAAM,UAAU,UAAU,CAAC,EAAgB;IACzC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,+IAA+I,CAAC;SACrK,GAAG,EAAmE,CAAC;IAC1E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,gBAAgB,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;QACtD,IAAI,IAAI,KAAK,GAAG,CAAC,UAAU;YAAE,SAAS;QACtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,EAAE,CAAC,OAAO,CAAC,qDAAqD,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9E,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC,2DAA2D,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAA+B,CAAC;QACvI,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,EAAE,CAAC,OAAO,CAAC,kDAAkD,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACjF,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,YAAY,mDAAmD,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAyB,CAAC;QACnJ,oFAAoF;QACpF,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;IACrD,CAAC;AACH,CAAC"}

package/dist/lib/local-db-v12.d.ts

@@ -0,0 +1,17 @@
+/**
+ * `decision_links.detector_version` (shared detector P3): an ADDITIVE step, not a schema version.
+ *
+ * Every link that exists when this runs was written by the v0 classifier, the cosine pass, a
+ * ref match or a person's mark, so all of them read 'v0'. A link the v1 detector writes is
+ * stamped 'v1'. Nothing is re-typed here: relation and confidence are untouched, and the only
+ * path that re-types an existing link is the explicit `align local relink`.
+ *
+ * Review F7: it does NOT bump user_version. An older CLI (0.50.0 refuses anything above 11) keeps
+ * opening the graph, and its link INSERTs, which name no detector_version, get the DEFAULT 'v0',
+ * which is true of what they write. It runs on every open, in a write lock, only when the column
+ * is missing, and re-checks inside the lock so two openers cannot both ALTER.
+ */
+import type { DatabaseSync } from 'node:sqlite';
+export declare function hasDetectorVersion(db: DatabaseSync): boolean;
+export declare function migrateV12(db: DatabaseSync): void;
+//# sourceMappingURL=local-db-v12.d.ts.map

package/dist/lib/local-db-v12.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-db-v12.d.ts","sourceRoot":"","sources":["../../src/lib/local-db-v12.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEhD,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,YAAY,GAAG,OAAO,CAE5D;AAED,wBAAgB,UAAU,CAAC,EAAE,EAAE,YAAY,GAAG,IAAI,CAEjD"}

package/dist/lib/local-db-v12.js

@@ -0,0 +1,8 @@
+export function hasDetectorVersion(db) {
+    return db.prepare('PRAGMA table_info(decision_links)').all().some((c) => c.name === 'detector_version');
+}
+export function migrateV12(db) {
+    if (!hasDetectorVersion(db))
+        db.exec(`ALTER TABLE decision_links ADD COLUMN detector_version TEXT NOT NULL DEFAULT 'v0'`);
+}
+//# sourceMappingURL=local-db-v12.js.map

package/dist/lib/local-db-v12.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-db-v12.js","sourceRoot":"","sources":["../../src/lib/local-db-v12.ts"],"names":[],"mappings":"AAeA,MAAM,UAAU,kBAAkB,CAAC,EAAgB;IACjD,OAAQ,EAAE,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC,GAAG,EAA8B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,kBAAkB,CAAC,CAAC;AACvI,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,EAAgB;IACzC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC;QAAE,EAAE,CAAC,IAAI,CAAC,mFAAmF,CAAC,CAAC;AAC5H,CAAC"}

package/dist/lib/local-db-v7.d.ts

@@ -0,0 +1,30 @@
+import type { DatabaseSync } from 'node:sqlite';
+export interface TwinRow {
+    id: string;
+    rowid: number;
+    created_at: string;
+    title: string;
+    summary: string;
+    ratified_by: string | null;
+    ratified_at: string | null;
+    confirmed_by: string | null;
+    confirmed_at: string | null;
+}
+/**
+ * Fold a set of twins of one item into one row. Survivor: the earliest ratified row, else the
+ * earliest confirmed row, else `preferred` (the keyed holder at runtime) or the newest. A row a
+ * person ratified or confirmed keeps ITS text and vector: the attestation covers text they
+ * read, so newer upstream text is recorded as a `text_revision_pending` audit note instead of
+ * replacing it. An unattested survivor holds the newest text already. Either way the survivor
+ * keeps the earliest created_at and carries any ratification or confirmation a loser held that
+ * it lacks. A SECOND ratified twin with different text is a disagreement between two people:
+ * its ratification is kept as a `ratification_conflict` audit row (by, at, text) on the
+ * survivor. The local graph has no decision flag column or status surface for that, so the
+ * audit row is the visible record. Caller owns the transaction.
+ */
+export declare function foldTwins(db: DatabaseSync, twins: TwinRow[], key: string, actor: string, preferred?: string): void;
+/** Runtime entry: fold the keyless row `twinId` into the row holding `key`, in one transaction
+ *  (no partial re-points, no duplicate backup row on a retry). */
+export declare function foldKeylessTwin(db: DatabaseSync, twinId: string, holderId: string, key: string): void;
+export declare function migrateV7(db: DatabaseSync): void;
+//# sourceMappingURL=local-db-v7.d.ts.map

package/dist/lib/local-db-v7.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-db-v7.d.ts","sourceRoot":"","sources":["../../src/lib/local-db-v7.ts"],"names":[],"mappings":"AAuCA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAyHhD,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAC9E,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;CAClH;AAUD;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CA0ClH;AAID;kEACkE;AAClE,wBAAgB,eAAe,CAAC,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAYrG;AAQD,wBAAgB,SAAS,CAAC,EAAE,EAAE,YAAY,GAAG,IAAI,CA8ChD"}

package/dist/lib/local-db-v7.js

@@ -0,0 +1,285 @@
+/**
+ * Schema v7 (plan phase L2): one bump for sync state, source identity, enrichment and local
+ * judgements. Called from migrate() in local-db-migrate.ts, inside the `version < 7` branch.
+ *
+ * What it adds:
+ * - `source_sync`: one row per (source, scope) - window, watermark, status and who changed it
+ *   (`changed_via` cli|mcp, plus the agent for mcp). A widened scope is a NEW row, so it starts
+ *   a fresh window instead of inheriting the narrow scope's watermark.
+ * - `decisions.source_key`: the identity of a one-item-per-URL connector item
+ *   (source-key.ts). (source_url, title) stays the identity of every other row, because a
+ *   session transcript or a manual capture can hold several decisions under one URL.
+ * - `decisions.detail_pending`: 1 while a GitHub item's discussion has not been fetched yet.
+ * - `decisions.enriched_at`: set by ingestOne as its LAST write, after the link pass. NULL on
+ *   every row that exists at upgrade, on purpose: nothing on disk tells a finished ingest from
+ *   one that died between embedding and linking, so every row is re-linked once by the next
+ *   sync (Decision 30). The migration itself does no re-linking, so it stays fast.
+ * - `local_judgements`: a person's verdict on a decision, with judge, time and cli|mcp origin.
+ *   No foreign key to `decisions`, like C7's `promotions`: a purge must not erase a record the
+ *   user may still want to share. Ratification is not here (Decision 14).
+ * - `decisions_merged_backup`, `decision_embeddings_merged_backup`, `decision_refs_merged_backup`:
+ *   every decision row the twin merge deletes, with that row's vector and refs. That is what a
+ *   restore can recover (INSERT ... SELECT the three back). It is NOT a full undo: links, audit
+ *   rows, local judgements and promotions that named a loser were RE-POINTED at the survivor
+ *   (a link between two twins, and a duplicate link's lower confidence, were dropped), and are
+ *   not copied anywhere. A restored loser comes back without them.
+ *
+ * Twin merge (Decision 3). v6 keyed rows on (source_url, title), so an edited PR or issue title
+ * wrote a second row for the same item. Rows sharing a source_key are merged: the survivor is
+ * the first ratified row, else the first confirmed row, else the most recently inserted. An
+ * unattested survivor holds the newest text (it is the newest row). An attested survivor KEEPS
+ * its own text and vector, and the newer text is stored as a `text_revision_pending` audit note
+ * (mergeGroup). Everything that named a loser is re-pointed; a link between two twins is dropped
+ * rather than turned into a self-link; a duplicate link keeps the higher confidence.
+ *
+ * Replay-safe: every CREATE is IF NOT EXISTS, every ALTER is guarded by table_info, keys are
+ * computed only where NULL, and a second pass finds no group of twins left to merge.
+ */
+import { copyRowsToBackup } from './backup-copy.js';
+import { bumpRowSetEpoch } from './local-db-epoch.js';
+import { isCaptureShaped } from './local-ingest.js';
+import { connectorItemKey } from './source-key.js';
+const V7_TABLES = `
+CREATE TABLE IF NOT EXISTS source_sync (
+  source_id        TEXT NOT NULL,
+  scope_key        TEXT NOT NULL,
+  scope            TEXT NOT NULL CHECK (scope IN ('yours', 'team')),
+  window_since     TEXT,
+  high_water       TEXT,
+  pending_until    TEXT,
+  status           TEXT NOT NULL DEFAULT 'ok' CHECK (status IN ('ok', 'partial', 'needs_reauth', 'error')),
+  last_started_at  TEXT,
+  last_success_at  TEXT,
+  items_last_run   INTEGER,
+  skips_last_run   TEXT,
+  changed_via      TEXT CHECK (changed_via IS NULL OR changed_via IN ('cli', 'mcp')),
+  changed_by_agent TEXT,
+  PRIMARY KEY (source_id, scope_key)
+);
+
+CREATE TABLE IF NOT EXISTS local_judgements (
+  id             TEXT PRIMARY KEY,
+  decision_id    TEXT NOT NULL,
+  counterpart_id TEXT,
+  context_key    TEXT,
+  kind           TEXT NOT NULL CHECK (kind IN ('conflict_verdict', 'check_verdict', 'supersede', 'not_a_decision', 'note')),
+  value          TEXT CHECK (value IS NULL OR value IN ('real', 'false')),
+  note           TEXT,
+  judge_id       TEXT NOT NULL,
+  judge_label    TEXT,
+  via            TEXT NOT NULL CHECK (via IN ('cli', 'mcp')),
+  agent_id       TEXT,
+  judged_at      TEXT NOT NULL,
+  CHECK ((via = 'mcp') = (agent_id IS NOT NULL)),
+  CHECK ((kind = 'check_verdict') = (context_key IS NOT NULL))
+);
+CREATE UNIQUE INDEX IF NOT EXISTS uq_local_judgements_person
+  ON local_judgements (decision_id, COALESCE(counterpart_id, context_key, decision_id), judge_id, kind)
+  WHERE kind <> 'note';
+`;
+/** Created LAST: the source_key index cannot build while twins still share a key. */
+const V7_INDEXES = `
+CREATE UNIQUE INDEX IF NOT EXISTS uq_decisions_source_key ON decisions(source_key) WHERE source_key IS NOT NULL;
+CREATE INDEX IF NOT EXISTS idx_decisions_detail_pending ON decisions(platform, decided_at) WHERE detail_pending = 1;
+CREATE INDEX IF NOT EXISTS idx_decisions_not_enriched ON decisions(created_at) WHERE enriched_at IS NULL;
+`;
+const V7_COLUMNS = [
+    ['source_key', 'source_key TEXT'],
+    ['detail_pending', 'detail_pending INTEGER NOT NULL DEFAULT 0'],
+    ['enriched_at', 'enriched_at TEXT'],
+];
+function tableExists(db, name) {
+    return db.prepare(`SELECT 1 AS hit FROM sqlite_master WHERE type = 'table' AND name = ?`).get(name) !== undefined;
+}
+function columnsOf(db, table) {
+    return new Set(db.prepare(`PRAGMA table_info(${table})`).all().map(c => c.name));
+}
+/** Rows naming `from` now name `to`. A row whose re-pointed key already exists is left on the
+ *  loser's id (the loser is in the backup table), never deleted: losing a record is the
+ *  destructive direction, and an orphan pointing at a backed-up row can still be restored. */
+function repoint(db, table, column, from, to) {
+    db.prepare(`UPDATE OR IGNORE ${table} SET ${column} = ? WHERE ${column} = ?`).run(to, from);
+}
+function repointLinks(db, loser, survivor, group) {
+    const links = db.prepare(`SELECT id, source_id AS s, target_id AS t, relation, confidence FROM decision_links WHERE source_id = ? OR target_id = ?`)
+        .all(loser, loser);
+    for (const link of links) {
+        const s = link.s === loser ? survivor : link.s;
+        const t = link.t === loser ? survivor : link.t;
+        // A link between two twins of one item would become a self-link: drop it.
+        if (s === t || (group.has(s) && group.has(t))) {
+            db.prepare('DELETE FROM decision_links WHERE id = ?').run(link.id);
+            continue;
+        }
+        const existing = db.prepare('SELECT id FROM decision_links WHERE source_id = ? AND target_id = ? AND relation = ?')
+            .get(s, t, link.relation);
+        if (existing) {
+            db.prepare('UPDATE decision_links SET confidence = MAX(confidence, ?) WHERE id = ?').run(link.confidence, existing.id);
+            db.prepare('DELETE FROM decision_links WHERE id = ?').run(link.id);
+        }
+        else {
+            db.prepare('UPDATE decision_links SET source_id = ?, target_id = ? WHERE id = ?').run(s, t, link.id);
+        }
+    }
+}
+/** Fold one twin into its survivor: back the row up, re-point everything that named it, delete
+ *  it. The loser's vector is dropped: the survivor keeps its own text, so it keeps its own
+ *  vector (a survivor that takes newer text is the newest row, which already holds that
+ *  text's vector). Also used by insertDecision to absorb a keyless row written by an older
+ *  binary. */
+function absorbLoser(db, loserId, survivorId, group, actor) {
+    bumpRowSetEpoch(db);
+    const hasJudgements = tableExists(db, 'local_judgements');
+    const hasPromotions = tableExists(db, 'promotions');
+    copyRowsToBackup(db, 'decisions', 'decisions_merged_backup', 'id', loserId);
+    copyRowsToBackup(db, 'decision_embeddings', 'decision_embeddings_merged_backup', 'decision_id', loserId);
+    copyRowsToBackup(db, 'decision_refs', 'decision_refs_merged_backup', 'decision_id', loserId);
+    repoint(db, 'decision_audit', 'decision_id', loserId, survivorId);
+    repointLinks(db, loserId, survivorId, group);
+    repoint(db, 'decision_refs', 'decision_id', loserId, survivorId);
+    if (hasJudgements) {
+        repoint(db, 'local_judgements', 'decision_id', loserId, survivorId);
+        repoint(db, 'local_judgements', 'counterpart_id', loserId, survivorId);
+    }
+    if (hasPromotions)
+        repoint(db, 'promotions', 'local_id', loserId, survivorId);
+    // Refs the survivor already had stay as they are; the loser's leftovers are duplicates.
+    db.prepare('DELETE FROM decision_refs WHERE decision_id = ?').run(loserId);
+    db.prepare('DELETE FROM decision_embeddings WHERE decision_id = ?').run(loserId);
+    db.prepare('DELETE FROM decisions WHERE id = ?').run(loserId);
+    db.prepare(`INSERT INTO decision_audit (id, decision_id, action, actor, detail) VALUES (lower(hex(randomblob(16))), ?, 'merged', ?, ?)`)
+        .run(survivorId, actor, loserId);
+}
+/** Earliest first by the attestation time, ties by insertion order. */
+function earliestBy(twins, at) {
+    return twins.filter(t => t[at] !== null)
+        .sort((a, b) => (a[at] < b[at] ? -1 : a[at] > b[at] ? 1 : a.rowid - b.rowid));
+}
+const auditInsert = `INSERT INTO decision_audit (id, decision_id, action, actor, detail) VALUES (lower(hex(randomblob(16))), ?, ?, ?, ?)`;
+/**
+ * Fold a set of twins of one item into one row. Survivor: the earliest ratified row, else the
+ * earliest confirmed row, else `preferred` (the keyed holder at runtime) or the newest. A row a
+ * person ratified or confirmed keeps ITS text and vector: the attestation covers text they
+ * read, so newer upstream text is recorded as a `text_revision_pending` audit note instead of
+ * replacing it. An unattested survivor holds the newest text already. Either way the survivor
+ * keeps the earliest created_at and carries any ratification or confirmation a loser held that
+ * it lacks. A SECOND ratified twin with different text is a disagreement between two people:
+ * its ratification is kept as a `ratification_conflict` audit row (by, at, text) on the
+ * survivor. The local graph has no decision flag column or status surface for that, so the
+ * audit row is the visible record. Caller owns the transaction.
+ */
+export function foldTwins(db, twins, key, actor, preferred) {
+    const newest = twins[twins.length - 1];
+    const ratifiedAll = earliestBy(twins, 'ratified_at');
+    const ratified = ratifiedAll[0];
+    const confirmed = earliestBy(twins, 'confirmed_at')[0];
+    const attested = ratified ?? confirmed;
+    const survivor = attested ?? twins.find(t => t.id === preferred) ?? newest;
+    const group = new Set(twins.map(t => t.id));
+    const earliestCreated = twins.map(t => t.created_at).sort()[0];
+    const latest = db.prepare('SELECT source_url, repo, decided_at FROM decisions WHERE id = ?')
+        .get(newest.id);
+    for (const loser of twins.filter(t => t.id !== survivor.id))
+        absorbLoser(db, loser.id, survivor.id, group, actor);
+    const others = ratifiedAll.slice(1).filter(t => t.id !== survivor.id);
+    const conflicts = others.filter(t => t.title !== survivor.title || t.summary !== survivor.summary);
+    // A second ratifier of the SAME text: their ratification would otherwise exist only in the backup.
+    for (const t of others.filter(o => !conflicts.includes(o))) {
+        db.prepare(auditInsert).run(survivor.id, 'ratification_agreed', actor, JSON.stringify({ by: t.ratified_by, at: t.ratified_at }));
+    }
+    for (const c of conflicts) {
+        db.prepare(auditInsert).run(survivor.id, 'ratification_conflict', actor, JSON.stringify({ by: c.ratified_by, at: c.ratified_at, title: c.title, summary: c.summary }));
+    }
+    if (attested === undefined) {
+        db.prepare('UPDATE decisions SET source_url = ?, repo = COALESCE(?, repo), decided_at = COALESCE(?, decided_at) WHERE id = ?')
+            .run(latest.source_url, latest.repo, latest.decided_at, survivor.id);
+    }
+    else {
+        db.prepare('UPDATE decisions SET repo = COALESCE(?, repo), decided_at = COALESCE(?, decided_at) WHERE id = ?')
+            .run(latest.repo, latest.decided_at, survivor.id);
+        const covered = conflicts.some(c => c.id === newest.id);
+        if (newest.id !== survivor.id && !covered && (newest.title !== survivor.title || newest.summary !== survivor.summary)) {
+            db.prepare(auditInsert).run(survivor.id, 'text_revision_pending', actor, JSON.stringify({ title: newest.title, summary: newest.summary }));
+        }
+    }
+    db.prepare(`UPDATE decisions SET created_at = ?, source_key = ?,
+       ratified_by = COALESCE(ratified_by, ?), ratified_at = COALESCE(ratified_at, ?),
+       confirmed_by = COALESCE(confirmed_by, ?), confirmed_at = COALESCE(confirmed_at, ?)
+     WHERE id = ?`).run(earliestCreated, key, ratified?.ratified_by ?? null, ratified?.ratified_at ?? null, confirmed?.confirmed_by ?? null, confirmed?.confirmed_at ?? null, survivor.id);
+}
+const TWIN_COLUMNS = 'id, rowid, created_at, title, summary, ratified_by, ratified_at, confirmed_by, confirmed_at';
+/** Runtime entry: fold the keyless row `twinId` into the row holding `key`, in one transaction
+ *  (no partial re-points, no duplicate backup row on a retry). */
+export function foldKeylessTwin(db, twinId, holderId, key) {
+    const own = !db.isTransaction;
+    if (own)
+        db.exec('BEGIN IMMEDIATE');
+    try {
+        const twins = db.prepare(`SELECT ${TWIN_COLUMNS} FROM decisions WHERE id IN (?, ?) ORDER BY rowid`)
+            .all(twinId, holderId);
+        foldTwins(db, twins, key, 'sync', holderId);
+        if (own)
+            db.exec('COMMIT');
+    }
+    catch (err) {
+        if (own && db.isTransaction)
+            db.exec('ROLLBACK');
+        throw err;
+    }
+}
+function mergeGroup(db, key) {
+    const twins = db.prepare(`SELECT ${TWIN_COLUMNS} FROM decisions WHERE source_key = ? ORDER BY rowid`)
+        .all(key);
+    foldTwins(db, twins, key, 'migration');
+}
+export function migrateV7(db) {
+    const existing = columnsOf(db, 'decisions');
+    for (const [name, ddl] of V7_COLUMNS) {
+        if (!existing.has(name))
+            db.exec(`ALTER TABLE decisions ADD COLUMN ${ddl}`);
+    }
+    db.exec(V7_TABLES);
+    // After the ALTERs, so the backup carries every column a row can hold.
+    db.exec('CREATE TABLE IF NOT EXISTS decisions_merged_backup AS SELECT * FROM decisions WHERE 0');
+    db.exec('CREATE TABLE IF NOT EXISTS decision_embeddings_merged_backup AS SELECT * FROM decision_embeddings WHERE 0');
+    db.exec('CREATE TABLE IF NOT EXISTS decision_refs_merged_backup AS SELECT * FROM decision_refs WHERE 0');
+    // Only rows that look like connector imports are keyed. A v6 row cannot say how it was
+    // written, and `align capture <PR url>` wrote platform github too, so the rule is on the
+    // row: a capture has the summary "Captured from <host>" or the URL's last path segment as
+    // its title (isCaptureShaped). Those stay unkeyed. When unsure, do not merge: the cost of
+    // a missed twin is a duplicate the next sync can still resolve, the cost of a wrong merge
+    // is a lost record.
+    const unkeyed = db.prepare('SELECT id, platform, source_url, title, summary FROM decisions WHERE source_key IS NULL AND source_url IS NOT NULL')
+        .all();
+    const setKey = db.prepare('UPDATE decisions SET source_key = ? WHERE id = ?');
+    for (const row of unkeyed) {
+        if (isCaptureShaped(row))
+            continue;
+        const key = connectorItemKey(row.platform, row.source_url);
+        if (key !== undefined)
+            setKey.run(key, row.id);
+    }
+    // Non-unique and temporary: the unique index cannot exist while twins share a key, and
+    // without any index each group's `WHERE source_key = ?` scanned the whole table.
+    db.exec('CREATE INDEX IF NOT EXISTS tmp_v7_key ON decisions(source_key)');
+    const groups = db.prepare('SELECT source_key AS k FROM decisions WHERE source_key IS NOT NULL GROUP BY source_key HAVING count(*) > 1')
+        .all();
+    // The fold looks up links by target, audit rows and judgements by decision for every loser;
+    // none of those has an index (links are indexed by source only), so 3k merges scanned the
+    // tables 3k times. Temporary, created inside the migration's transaction and dropped with it.
+    const temp = [
+        'CREATE INDEX IF NOT EXISTS tmp_v7_links_target ON decision_links(target_id)',
+        'CREATE INDEX IF NOT EXISTS tmp_v7_audit_decision ON decision_audit(decision_id)',
+        'CREATE INDEX IF NOT EXISTS tmp_v7_judgements_counterpart ON local_judgements(counterpart_id)',
+    ];
+    if (groups.length > 0)
+        for (const ddl of temp)
+            db.exec(ddl);
+    for (const { k } of groups)
+        mergeGroup(db, k);
+    for (const name of ['tmp_v7_key', 'tmp_v7_links_target', 'tmp_v7_audit_decision', 'tmp_v7_judgements_counterpart']) {
+        db.exec(`DROP INDEX IF EXISTS ${name}`);
+    }
+    db.exec(V7_INDEXES);
+}
+//# sourceMappingURL=local-db-v7.js.map

package/dist/lib/local-db-v7.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-db-v7.js","sourceRoot":"","sources":["../../src/lib/local-db-v7.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAEtD,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAEnD,MAAM,SAAS,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAqCjB,CAAC;AAEF,qFAAqF;AACrF,MAAM,UAAU,GAAG;;;;CAIlB,CAAC;AAEF,MAAM,UAAU,GAAuC;IACrD,CAAC,YAAY,EAAE,iBAAiB,CAAC;IACjC,CAAC,gBAAgB,EAAE,2CAA2C,CAAC;IAC/D,CAAC,aAAa,EAAE,kBAAkB,CAAC;CACpC,CAAC;AAEF,SAAS,WAAW,CAAC,EAAgB,EAAE,IAAY;IACjD,OAAO,EAAE,CAAC,OAAO,CAAC,sEAAsE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC;AACpH,CAAC;AAED,SAAS,SAAS,CAAC,EAAgB,EAAE,KAAa;IAChD,OAAO,IAAI,GAAG,CAAE,EAAE,CAAC,OAAO,CAAC,qBAAqB,KAAK,GAAG,CAAC,CAAC,GAAG,EAA8B,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAChH,CAAC;AAED;;8FAE8F;AAC9F,SAAS,OAAO,CAAC,EAAgB,EAAE,KAAa,EAAE,MAAc,EAAE,IAAY,EAAE,EAAU;IACxF,EAAE,CAAC,OAAO,CAAC,oBAAoB,KAAK,QAAQ,MAAM,cAAc,MAAM,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;AAC9F,CAAC;AAED,SAAS,YAAY,CAAC,EAAgB,EAAE,KAAa,EAAE,QAAgB,EAAE,KAAkB;IACzF,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,0HAA0H,CAAC;SACjJ,GAAG,CAAC,KAAK,EAAE,KAAK,CAAsF,CAAC;IAC1G,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,0EAA0E;QAC1E,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9C,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnE,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,sFAAsF,CAAC;aAChH,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAA+B,CAAC;QAC1D,IAAI,QAAQ,EAAE,CAAC;YACb,EAAE,CAAC,OAAO,CAAC,wEAAwE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YACvH,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC;aAAM,CAAC;YACN,EAAE,CAAC,OAAO,CAAC,qEAAqE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QACvG,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;cAIc;AACd,SAAS,WAAW,CAAC,EAAgB,EAAE,OAAe,EAAE,UAAkB,EAAE,KAAkB,EAAE,KAAa;IAC3G,eAAe,CAAC,EAAE,CAAC,CAAC;IACpB,MAAM,aAAa,GAAG,WAAW,CAAC,EAAE,EAAE,kBAAkB,CAAC,CAAC;IAC1D,MAAM,aAAa,GAAG,WAAW,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;IACpD,gBAAgB,CAAC,EAAE,EAAE,WAAW,EAAE,yBAAyB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAC5E,gBAAgB,CAAC,EAAE,EAAE,qBAAqB,EAAE,mCAAmC,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC;IACzG,gBAAgB,CAAC,EAAE,EAAE,eAAe,EAAE,6BAA6B,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC;IAC7F,OAAO,CAAC,EAAE,EAAE,gBAAgB,EAAE,aAAa,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IAClE,YAAY,CAAC,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;IAC7C,OAAO,CAAC,EAAE,EAAE,eAAe,EAAE,aAAa,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IACjE,IAAI,aAAa,EAAE,CAAC;QAClB,OAAO,CAAC,EAAE,EAAE,kBAAkB,EAAE,aAAa,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QACpE,OAAO,CAAC,EAAE,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IACzE,CAAC;IACD,IAAI,aAAa;QAAE,OAAO,CAAC,EAAE,EAAE,YAAY,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IAC9E,wFAAwF;IACxF,EAAE,CAAC,OAAO,CAAC,iDAAiD,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC3E,EAAE,CAAC,OAAO,CAAC,uDAAuD,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACjF,EAAE,CAAC,OAAO,CAAC,oCAAoC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC9D,EAAE,CAAC,OAAO,CAAC,4HAA4H,CAAC;SACrI,GAAG,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AACrC,CAAC;AAOD,uEAAuE;AACvE,SAAS,UAAU,CAAC,KAAgB,EAAE,EAAkC;IACtE,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC;SACrC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAE,GAAG,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAE,GAAG,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AACtF,CAAC;AAED,MAAM,WAAW,GAAG,qHAAqH,CAAC;AAE1I;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,SAAS,CAAC,EAAgB,EAAE,KAAgB,EAAE,GAAW,EAAE,KAAa,EAAE,SAAkB;IAC1G,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;IACxC,MAAM,WAAW,GAAG,UAAU,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;IACrD,MAAM,QAAQ,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,QAAQ,GAAG,QAAQ,IAAI,SAAS,CAAC;IACvC,MAAM,QAAQ,GAAG,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,IAAI,MAAM,CAAC;IAC3E,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,MAAM,eAAe,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAE,CAAC;IAChE,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC,iEAAiE,CAAC;SACzF,GAAG,CAAC,MAAM,CAAC,EAAE,CAAkF,CAAC;IAEnG,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,EAAE,CAAC;QAAE,WAAW,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAElH,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,EAAE,CAAC,CAAC;IACtE,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,OAAO,KAAK,QAAQ,CAAC,OAAO,CAAC,CAAC;IACnG,mGAAmG;IACnG,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3D,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,qBAAqB,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACnI,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,uBAAuB,EAAE,KAAK,EACrE,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAClG,CAAC;IACD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,EAAE,CAAC,OAAO,CAAC,kHAAkH,CAAC;aAC3H,GAAG,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;IACzE,CAAC;SAAM,CAAC;QACN,EAAE,CAAC,OAAO,CAAC,kGAAkG,CAAC;aAC3G,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QACpD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;QACxD,IAAI,MAAM,CAAC,EAAE,KAAK,QAAQ,CAAC,EAAE,IAAI,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,IAAI,MAAM,CAAC,OAAO,KAAK,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YACtH,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,uBAAuB,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAC7I,CAAC;IACH,CAAC;IACD,EAAE,CAAC,OAAO,CACR;;;kBAGc,CACf,CAAC,GAAG,CAAC,eAAe,EAAE,GAAG,EAAE,QAAQ,EAAE,WAAW,IAAI,IAAI,EAAE,QAAQ,EAAE,WAAW,IAAI,IAAI,EACtF,SAAS,EAAE,YAAY,IAAI,IAAI,EAAE,SAAS,EAAE,YAAY,IAAI,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;AACnF,CAAC;AAED,MAAM,YAAY,GAAG,6FAA6F,CAAC;AAEnH;kEACkE;AAClE,MAAM,UAAU,eAAe,CAAC,EAAgB,EAAE,MAAc,EAAE,QAAgB,EAAE,GAAW;IAC7F,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC;IAC9B,IAAI,GAAG;QAAE,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IACpC,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,YAAY,mDAAmD,CAAC;aAChG,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAyB,CAAC;QACjD,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC5C,IAAI,GAAG;YAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,IAAI,EAAE,CAAC,aAAa;YAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,EAAgB,EAAE,GAAW;IAC/C,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,YAAY,qDAAqD,CAAC;SAClG,GAAG,CAAC,GAAG,CAAyB,CAAC;IACpC,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;AACzC,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,EAAgB;IACxC,MAAM,QAAQ,GAAG,SAAS,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,UAAU,EAAE,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,EAAE,CAAC,IAAI,CAAC,oCAAoC,GAAG,EAAE,CAAC,CAAC;IAC9E,CAAC;IACD,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnB,uEAAuE;IACvE,EAAE,CAAC,IAAI,CAAC,uFAAuF,CAAC,CAAC;IACjG,EAAE,CAAC,IAAI,CAAC,2GAA2G,CAAC,CAAC;IACrH,EAAE,CAAC,IAAI,CAAC,+FAA+F,CAAC,CAAC;IAEzG,uFAAuF;IACvF,yFAAyF;IACzF,0FAA0F;IAC1F,0FAA0F;IAC1F,0FAA0F;IAC1F,oBAAoB;IACpB,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,oHAAoH,CAAC;SAC7I,GAAG,EAAiG,CAAC;IACxG,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC,kDAAkD,CAAC,CAAC;IAC9E,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,eAAe,CAAC,GAAG,CAAC;YAAE,SAAS;QACnC,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;QAC3D,IAAI,GAAG,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC;IAED,uFAAuF;IACvF,iFAAiF;IACjF,EAAE,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;IAC1E,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC,4GAA4G,CAAC;SACpI,GAAG,EAA0B,CAAC;IACjC,4FAA4F;IAC5F,0FAA0F;IAC1F,8FAA8F;IAC9F,MAAM,IAAI,GAAa;QACrB,6EAA6E;QAC7E,iFAAiF;QACjF,8FAA8F;KAC/F,CAAC;IACF,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5D,KAAK,MAAM,EAAE,CAAC,EAAE,IAAI,MAAM;QAAE,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,CAAC,YAAY,EAAE,qBAAqB,EAAE,uBAAuB,EAAE,+BAA+B,CAAC,EAAE,CAAC;QACnH,EAAE,CAAC,IAAI,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;AACtB,CAAC"}

package/dist/lib/local-db-v8.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Schema v8 (L5 review): the sync's own state moves into the migration system.
+ *
+ * - `source_sync.cycle_top`: the newest `updated_at` seen across a pending cycle (a read a ceiling
+ *   split over several runs), kept in the scope's own row so another scope's items can never
+ *   lift this scope's watermark.
+ * - `source_sync.last_attempt_at`: every run stamps it; `last_success_at` is stamped only by a
+ *   COMPLETE run, so a source that is always partial no longer reads as freshly synced.
+ * - `sync_item_state`: the vendor's own last-updated time per stored item and scope (hot Slack
+ *   threads). A cache of vendor facts, rebuilt by the next wide read. An earlier, unreleased shape
+ *   of this table (no scope column, created outside the migrations) is replaced and its rows carried across.
+ * - `*_purged_backup`: every row `align local forget --purge` deletes is copied here first, with its
+ *   vector and refs, inside the same transaction. Links, audit rows and judgements of a purged
+ *   row are not copied (a purge never touches a row that has an audit act or a judgement).
+ *
+ * An earlier, unreleased shape of `sync_item_state` (no scope column) keeps its rows, as scope 'yours'.
+ *
+ * Replay-safe: every ALTER is guarded by table_info, every CREATE is IF NOT EXISTS.
+ */
+import type { DatabaseSync } from 'node:sqlite';
+export declare function migrateV8(db: DatabaseSync): void;
+//# sourceMappingURL=local-db-v8.d.ts.map

package/dist/lib/local-db-v8.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-db-v8.d.ts","sourceRoot":"","sources":["../../src/lib/local-db-v8.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAMhD,wBAAgB,SAAS,CAAC,EAAE,EAAE,YAAY,GAAG,IAAI,CA0BhD"}

package/dist/lib/local-db-v8.js

@@ -0,0 +1,33 @@
+function columnsOf(db, table) {
+    return new Set(db.prepare(`PRAGMA table_info(${table})`).all().map((c) => c.name));
+}
+export function migrateV8(db) {
+    const sync = columnsOf(db, 'source_sync');
+    for (const [name, ddl] of [['cycle_top', 'cycle_top TEXT'], ['last_attempt_at', 'last_attempt_at TEXT']]) {
+        if (!sync.has(name))
+            db.exec(`ALTER TABLE source_sync ADD COLUMN ${ddl}`);
+    }
+    // An earlier, unreleased shape (no scope column, created outside the migrations) is set aside and its rows
+    // carried across as scope 'yours', the only scope that ever wrote them.
+    const state = columnsOf(db, 'sync_item_state');
+    const legacy = state.size > 0 && !state.has('scope_key');
+    if (legacy)
+        db.exec('ALTER TABLE sync_item_state RENAME TO sync_item_state_unscoped');
+    db.exec(`CREATE TABLE IF NOT EXISTS sync_item_state (
+    decision_id TEXT NOT NULL,
+    scope_key   TEXT NOT NULL DEFAULT 'yours',
+    platform    TEXT NOT NULL,
+    updated_at  TEXT NOT NULL,
+    PRIMARY KEY (decision_id, scope_key)
+  )`);
+    db.exec('CREATE INDEX IF NOT EXISTS idx_sync_item_state_platform ON sync_item_state(platform)');
+    if (legacy) {
+        db.exec(`INSERT OR IGNORE INTO sync_item_state (decision_id, scope_key, platform, updated_at)
+             SELECT decision_id, 'yours', platform, updated_at FROM sync_item_state_unscoped`);
+        db.exec('DROP TABLE sync_item_state_unscoped');
+    }
+    db.exec('CREATE TABLE IF NOT EXISTS decisions_purged_backup AS SELECT * FROM decisions WHERE 0');
+    db.exec('CREATE TABLE IF NOT EXISTS decision_embeddings_purged_backup AS SELECT * FROM decision_embeddings WHERE 0');
+    db.exec('CREATE TABLE IF NOT EXISTS decision_refs_purged_backup AS SELECT * FROM decision_refs WHERE 0');
+}
+//# sourceMappingURL=local-db-v8.js.map

package/dist/lib/local-db-v8.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-db-v8.js","sourceRoot":"","sources":["../../src/lib/local-db-v8.ts"],"names":[],"mappings":"AAqBA,SAAS,SAAS,CAAC,EAAgB,EAAE,KAAa;IAChD,OAAO,IAAI,GAAG,CAAE,EAAE,CAAC,OAAO,CAAC,qBAAqB,KAAK,GAAG,CAAC,CAAC,GAAG,EAA8B,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAClH,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,EAAgB;IACxC,MAAM,IAAI,GAAG,SAAS,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,gBAAgB,CAAC,EAAE,CAAC,iBAAiB,EAAE,sBAAsB,CAAC,CAAU,EAAE,CAAC;QAClH,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,EAAE,CAAC,IAAI,CAAC,sCAAsC,GAAG,EAAE,CAAC,CAAC;IAC5E,CAAC;IACD,2GAA2G;IAC3G,wEAAwE;IACxE,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACzD,IAAI,MAAM;QAAE,EAAE,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;IACtF,EAAE,CAAC,IAAI,CAAC;;;;;;IAMN,CAAC,CAAC;IACJ,EAAE,CAAC,IAAI,CAAC,sFAAsF,CAAC,CAAC;IAChG,IAAI,MAAM,EAAE,CAAC;QACX,EAAE,CAAC,IAAI,CAAC;6FACiF,CAAC,CAAC;QAC3F,EAAE,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;IACjD,CAAC;IACD,EAAE,CAAC,IAAI,CAAC,uFAAuF,CAAC,CAAC;IACjG,EAAE,CAAC,IAAI,CAAC,2GAA2G,CAAC,CAAC;IACrH,EAAE,CAAC,IAAI,CAAC,+FAA+F,CAAC,CAAC;AAC3G,CAAC"}

package/dist/lib/local-db-v9.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Schema v9 (L5 second review): a hole that comes back run after run has to be NAMED and counted, or the
+ * source re-reads it forever (or, worse, hides it). `source_sync.hole_sig` is a signature of what the last
+ * incomplete run could not read and `hole_streak` is how many consecutive runs had that same hole; after
+ * five, the sync says plainly that it is a persistent hole and stops letting it hold the watermark back.
+ * Guarded ALTERs: replay-safe.
+ */
+import type { DatabaseSync } from 'node:sqlite';
+export declare function migrateV9(db: DatabaseSync): void;
+//# sourceMappingURL=local-db-v9.d.ts.map

package/dist/lib/local-db-v9.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-db-v9.d.ts","sourceRoot":"","sources":["../../src/lib/local-db-v9.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEhD,wBAAgB,SAAS,CAAC,EAAE,EAAE,YAAY,GAAG,IAAI,CAIhD"}

package/dist/lib/local-db-v9.js

@@ -0,0 +1,8 @@
+export function migrateV9(db) {
+    const have = new Set(db.prepare('PRAGMA table_info(source_sync)').all().map((c) => c.name));
+    if (!have.has('hole_sig'))
+        db.exec('ALTER TABLE source_sync ADD COLUMN hole_sig TEXT');
+    if (!have.has('hole_streak'))
+        db.exec('ALTER TABLE source_sync ADD COLUMN hole_streak INTEGER NOT NULL DEFAULT 0');
+}
+//# sourceMappingURL=local-db-v9.js.map

package/dist/lib/local-db-v9.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-db-v9.js","sourceRoot":"","sources":["../../src/lib/local-db-v9.ts"],"names":[],"mappings":"AASA,MAAM,UAAU,SAAS,CAAC,EAAgB;IACxC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAE,EAAE,CAAC,OAAO,CAAC,gCAAgC,CAAC,CAAC,GAAG,EAA8B,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACzH,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,EAAE,CAAC,IAAI,CAAC,kDAAkD,CAAC,CAAC;IACvF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC;QAAE,EAAE,CAAC,IAAI,CAAC,2EAA2E,CAAC,CAAC;AACrH,CAAC"}