@fitchmultz/pi-subagents 0.44.5 → 0.44.6

package/CHANGELOG.md

@@ -1,5 +1,12 @@
 # Changelog
 
+## [0.44.6] - 2026-10-09
+
+### Fixed
+- Keep full Agents pages available for long native histories by sharing bounded configuration results across rows and repeated queries. Committed publication, source generations and exact terminal/time/leaf boundaries invalidate reuse; strict errors and source integrity checks remain unchanged.
+- Restrict scoped saved-text search to eligible records before aggregating matches, retaining the complete corpus for global relevance scores, cross-field word matching, phrases, attempt boundaries and pagination.
+- Publish one settled-freshness notification for unchanged history census work instead of one per run/source. Real commits, canonical failures and source error/recovery observations still notify; polling, census and watches remain active.
+
 ## [0.44.5] - 2026-10-08
 
 ### Added

package/dist/extension/build-info.js

@@ -1 +1 @@
-export const EXTENSION_BUILD = Object.freeze({"version":"0.44.5","sha256":"53f1d8cd3c71b05fdfc903bfcecd06eb5d80bb367a16a09d235199d3f93266f2"});
+export const EXTENSION_BUILD = Object.freeze({"version":"0.44.6","sha256":"e9a0bfe1bf57b2b67e3b32c6f449996dadf8bc897fe2577eea3d919158b40466"});

package/dist/history/queries.js

@@ -7,7 +7,9 @@ import { hash, HistoryStore, integer, pageLimit } from "./store.js";
 export class HistoryQueries {
     store;
     info;
+    configurations = new Map();
     constructor(store, info) { this.store = store; this.info = info; }
+    sourcesRemoved() { this.configurations.clear(); }
     cursor(query, keys, offset) {
         return Buffer.from(JSON.stringify({ generation: this.store.generation, owner: this.store.owner, version: this.info().version, query, keys, offset })).toString("base64url");
     }
@@ -120,6 +122,13 @@ export class HistoryQueries {
                 return {};
             throw error;
         }
+        // Only committed source changes invalidate ancestry, not unrelated run projections.
+        // Validate boundaries before reuse; explicit null leaves returned above remain empty.
+        const leafKey = input.leaf === undefined ? null : [typeof input.leaf, String(input.leaf)];
+        const key = JSON.stringify([source.id, source.generation, source.cursor, source.stamp, input.terminalEntryId || null, input.terminalEntryId ? null : input.endedAt ?? null, leafKey, strict]);
+        const cached = this.configurations.get(key);
+        if (cached)
+            return { ...cached };
         const leaf = input.leaf ?? this.store.get(`SELECT id FROM entries WHERE ${boundary.clauses.join(" AND ")} ORDER BY start DESC LIMIT 1`, ...boundary.params)?.id;
         if (!leaf)
             return {};
@@ -139,7 +148,12 @@ export class HistoryQueries {
                 return {};
             throw new HistoryIndexError("MALFORMED_ANCESTRY", "Selected native configuration has cyclic ancestry.");
         }
-        return { ...(facts.model ? { model: facts.model, modelRecordedAt: facts.recorded_at ?? undefined } : {}), ...(facts.thinking ? { thinking: facts.thinking } : {}) };
+        const configuration = { ...(facts.model ? { model: facts.model, modelRecordedAt: facts.recorded_at ?? undefined } : {}), ...(facts.thinking ? { thinking: facts.thinking } : {}) };
+        // Bound memory across arbitrary sources, boundaries and pages. Eviction only recomputes.
+        if (this.configurations.size >= 128)
+            this.configurations.delete(this.configurations.keys().next().value);
+        this.configurations.set(key, configuration);
+        return { ...configuration };
     }
     historyPage(input) {
         const { source } = this.child(input.runId, input.index);
@@ -224,6 +238,12 @@ export class HistoryQueries {
             clauses.push("c.agent=?");
             params.push(input.agent);
         }
+        const joins = "JOIN sources s ON s.id=e.source_id JOIN children c ON c.source_id=s.id LEFT JOIN entries terminal ON terminal.source_id=s.id AND terminal.generation=s.generation AND terminal.id=c.terminal_entry_id AND terminal.published=1";
+        // Scope records before materializing/grouping hits, while bm25 still sees the
+        // complete corpus. Scan each linked source once, not once per continuation.
+        // Attempt boundaries, attribution and seek filtering remain in the final join.
+        const eligible = input.runId || input.agent ? `eligible AS MATERIALIZED (SELECT e.rowid FROM entries e JOIN sources s ON s.id=e.source_id WHERE e.published=1 AND e.generation=s.generation AND e.source_id IN (SELECT c.source_id FROM children c WHERE ${clauses.slice(4).join(" AND ")})),` : "";
+        const eligibleParams = eligible ? params.slice(expression.length) : [];
         // Ordering/filters apply globally before limit. Common terms may still require an FTS
         // scan/sort; the parent enforces a hard deadline by killing this separate process.
         const score = sort === "relevance" ? "matched.score" : "-COALESCE(e.timestamp,0)";
@@ -235,8 +255,8 @@ export class HistoryQueries {
         }
         // Match words across all visible fields/windows of one native record. A quoted
         // phrase remains a single FTS expression, so it cannot span unrelated fields.
-        const rows = this.store.all(`WITH hits AS MATERIALIZED (
-			${expression.map((_term, index) => `SELECT d.id,d.entry_rowid,bm25(corpus) AS score,${index} AS term FROM corpus JOIN documents d ON d.id=corpus.rowid WHERE corpus MATCH ?`).join(" UNION ALL ")}
+        const rows = this.store.all(`WITH ${eligible} hits AS MATERIALIZED (
+			${expression.map((_term, index) => `SELECT d.id,d.entry_rowid,bm25(corpus) AS score,${index} AS term FROM corpus JOIN documents d ON d.id=corpus.rowid WHERE corpus MATCH ?${eligible ? " AND d.entry_rowid IN (SELECT rowid FROM eligible)" : ""}`).join(" UNION ALL ")}
 		), terms AS (
 			SELECT entry_rowid,term,MIN(score) AS score FROM hits GROUP BY entry_rowid,term
 		), matched AS (
@@ -244,7 +264,7 @@ export class HistoryQueries {
 		), excerpts AS (
 			SELECT id,entry_rowid,ROW_NUMBER() OVER (PARTITION BY entry_rowid ORDER BY score,id) AS choice FROM hits
 		)
-		SELECT d.*,${score} AS score,e.*,d.id AS document_id,s.path,s.session_id,c.run_id,c.child_index,c.agent,d.preview AS document_preview FROM matched JOIN excerpts ON excerpts.entry_rowid=matched.entry_rowid AND excerpts.choice=1 JOIN documents d ON d.id=excerpts.id JOIN entries e ON e.rowid=matched.entry_rowid JOIN sources s ON s.id=e.source_id JOIN children c ON c.source_id=s.id LEFT JOIN entries terminal ON terminal.source_id=s.id AND terminal.generation=s.generation AND terminal.id=c.terminal_entry_id AND terminal.published=1 WHERE ${clauses.join(" AND ")} ORDER BY score,d.id,c.run_id,c.child_index LIMIT ?`, ...params, limit + 1);
+		SELECT d.*,${score} AS score,e.*,d.id AS document_id,s.path,s.session_id,c.run_id,c.child_index,c.agent,d.preview AS document_preview FROM matched JOIN excerpts ON excerpts.entry_rowid=matched.entry_rowid AND excerpts.choice=1 JOIN documents d ON d.id=excerpts.id JOIN entries e ON e.rowid=matched.entry_rowid ${joins} WHERE ${clauses.join(" AND ")} ORDER BY score,d.id,c.run_id,c.child_index LIMIT ?`, ...eligibleParams, ...params, limit + 1);
         const more = rows.length > limit, page = rows.slice(0, limit);
         return { ...this.info(), matches: page.map((row) => ({ id: row.document_id, runId: row.run_id, index: row.child_index, agent: row.agent, entryId: row.id, nativeId: row.native_id, sessionId: row.session_id, sessionFile: row.path, timestamp: row.timestamp,
                 ref: { sourceId: row.source_id, generation: row.generation, start: row.start, end: row.end, digest: row.digest }, preview: row.document_preview, field: row.field, textStart: row.text_start, textEnd: row.text_end, score: row.score })),

package/dist/history/worker.js

@@ -18,6 +18,8 @@ const sourceWatchers = new Map();
 const watchIdentities = new WeakMap();
 const watchedSources = new Map();
 let job, scheduled = false, closed = false;
+let sourceObservation;
+let notifiedVersion;
 let retryTimer;
 let runErrors = new Set();
 const barriers = [];
@@ -31,7 +33,15 @@ function send(response) {
         process.send(response, undefined, undefined, (error) => { if (error)
             shutdown(); });
 }
-function changed() { send({ changed: true }); }
+function changed(observationChanged = false) {
+    const version = store?.get("SELECT value FROM meta WHERE key='version'").value;
+    // Unchanged census projections need only one final freshness notification.
+    // Non-versioned errors/recovery and real commits still publish immediately.
+    if (observationChanged || version !== notifiedVersion || !hasPending()) {
+        notifiedVersion = version;
+        send({ changed: true });
+    }
+}
 function errorReply(id, error) {
     const code = error instanceof HistoryIndexError ? error.code : "UNAVAILABLE";
     // Parser errors can include fragments from the malformed body. IPC/logs must never carry them.
@@ -191,8 +201,11 @@ function prune(previousSources) {
             store.run("DELETE FROM sources WHERE id=?", source.id);
             removed = true;
         }
-        if (removed)
+        if (removed) {
             store.bump();
+            // A later admission of the same path can recreate source generation 1.
+            queries?.sourcesRemoved();
+        }
     });
 }
 function admit(run) {
@@ -247,6 +260,7 @@ function pump() {
         if (dirtyRuns.size) {
             const id = dirtyRuns.values().next().value;
             dirtyRuns.delete(id);
+            const failed = runErrors.has(id);
             installWatches(id);
             const previousSources = store.all("SELECT source_id FROM children WHERE run_id=? AND source_id IS NOT NULL", id).map((child) => child.source_id);
             try {
@@ -265,7 +279,7 @@ function pump() {
                 if (child.source_id !== job?.id)
                     dirtySources.set(child.source_id, dirtySources.get(child.source_id) ?? false);
             installWatches(id);
-            changed();
+            changed(failed !== runErrors.has(id));
         }
         else if (job) {
             if (job.step()) {
@@ -273,7 +287,8 @@ function pump() {
                 if (source)
                     watchSources(path.dirname(source.path));
                 job = undefined;
-                changed();
+                changed(source?.state !== sourceObservation?.state || source?.error !== sourceObservation?.error);
+                sourceObservation = undefined;
             }
         }
         else if (dirtySources.size) {
@@ -282,6 +297,7 @@ function pump() {
             const source = store.source(id);
             if (source) {
                 activeSource = id;
+                sourceObservation = source;
                 job = new SourceIngest(store, source, force);
             }
         }
@@ -302,8 +318,11 @@ function pump() {
             else
                 store.run("UPDATE sources SET state='error',error=?,checked_at=? WHERE id=?", "Linked native conversation could not be indexed.", Date.now(), id);
         }
-        if (!(error instanceof HistoryIndexError && error.code === "INDEX_BUSY"))
-            changed();
+        if (!(error instanceof HistoryIndexError && error.code === "INDEX_BUSY")) {
+            const source = id ? store.source(id) : undefined;
+            changed(Boolean(source && (source.state !== sourceObservation?.state || source.error !== sourceObservation?.error)));
+        }
+        sourceObservation = undefined;
     }
     activeSource = undefined;
     finishBarriers();
@@ -328,6 +347,8 @@ function clear() {
     retryTimer = undefined;
     job?.close();
     job = undefined;
+    sourceObservation = undefined;
+    notifiedVersion = undefined;
     for (const watcher of watchers.values())
         watcher.close();
     watchers.clear();

package/docs/performance.md

@@ -9,10 +9,10 @@ Startup recovers saved ownership, unanswered questions and Intercom receipts in
 ### Indexed browsing and lazy Agents work
 
 - A separate Node process incrementally indexes only the current saved parent's admitted runs and linked native sources. A fresh session with no owned work starts no history process or database until it browses. No directory-wide transcript backfill runs at startup.
-- List filters and attention/newest/oldest ordering apply globally before a bounded page. Ordinary tool lists return 20 runs by default, at most 100; the Agents picker loads 50 runs and searches full assignments, not just shortened labels. Latest-assignment queries retain unsuperseded siblings while hiding older continuation attempts.
+- List filters and attention/newest/oldest ordering apply globally before a bounded page. Ordinary tool lists return 20 runs by default, at most 100; the Agents picker loads 50 runs and searches full assignments, not just shortened labels. Latest-assignment queries retain unsuperseded siblings while hiding older continuation attempts. Native branch configuration reuses at most 128 compact results across rows and queries, keyed by physical source generation, committed cursor, observed stamp and exact terminal/time/leaf boundary. Publication (including backdated records), replacement and reset invalidate reuse; null leaves and strict missing/cyclic-boundary errors retain their original meaning.
 - The parent UI does not scan child journals on startup, ticks, filtering or pagination. Only an opened conversation loads a 100-physical-record page; components are retained for that page. Full details and contextual Reply validate selected native byte references off-thread, including paired tool results outside the current page. Explicit navigation supersedes older requests; background refreshes are coalesced and retain the settled display rather than briefly adding loading rows. Reopening the picker restores its visible filter and page.
 - Catch-up, degraded sources, loading, no matches and unavailable history are distinct states. F5 explicitly retries. Drafts, reading anchors, unread boundaries and pins survive same-parent reopen; a changed owner or abandoned overlay cannot accept late results.
-- Search indexes saved visible text, not thinking, tool arguments, image payloads, hidden custom data or provider fields. Terminal sequences are removed incrementally before tokenization, including sequences split across read/parser chunks. Its grammar is lexical words or one quoted phrase. Unquoted words must all occur in the same native record, across any of its visible fields/windows; quoted phrases must remain contiguous in one field. Each record contributes one excerpt per matching child attempt. Filters and attempt terminal/time boundaries apply before ranking/paging. Common terms may still require broad matching and sorting: a small result page is not a constant-work guarantee. Deadlines and cancellation stop the owned history process, which can reopen and replay committed index progress.
+- Search indexes saved visible text, not thinking, tool arguments, image payloads, hidden custom data or provider fields. Terminal sequences are removed incrementally before tokenization, including sequences split across read/parser chunks. Its grammar is lexical words or one quoted phrase. Unquoted words must all occur in the same native record, across any of its visible fields/windows; quoted phrases must remain contiguous in one field. Each record contributes one excerpt per matching child attempt. Filters and attempt terminal/time boundaries apply before ranking/paging. Run/child/agent scopes restrict linked physical sources before match aggregation without changing global relevance scores. Each scoped source is scanned once, even when many continuation attempts share it; terminal/time boundaries and attempt attribution still apply before ranking/paging in the final join. Common terms still scan global FTS postings, and global searches may require broad matching and sorting: a small result page is not a constant-work guarantee. Deadlines and cancellation stop the owned history process, which can reopen and replay committed index progress.
 - Browse freshness is never authoritative. Selected controls recheck canonical owner facts before acting. Human-message delivery and a later nonempty assistant reply are separate observations. Receipt integrity and native accounting safeguards remain unchanged.
 
 ### Storage, budgets and recovery
@@ -34,7 +34,7 @@ The changed boundaries are exercised through real extension functions and regist
 - Native Intercom reload restores all 1,024 historical receipts while servicing input. Cleared-queue recovery also services input before its 100 followers finish appending, retaining each message once and one final wake-up across an in-flight reload or a cleared busy handoff. New results and explicit steers are staged before acknowledgement and handed to native steering for the next tool boundary; ordinary queued and passive arrivals wait.
 - 125 owned assignments: global filtering finds an item beyond the first two picker pages; all later pages remain reachable without UI-thread source access.
 - 65 retained runs: off-page reads/stats and migration scans are zero while displayed controls, questions, review and continuation identities remain fresh.
-- Warm indexed list/search queries perform no source checks, opens or canonical projections. Cold ingestion and explicit refresh still do necessary verification off-thread.
+- Warm indexed list/search queries perform no source checks, opens or canonical projections. Cold ingestion and explicit refresh still do necessary verification off-thread. Fifty genuinely admitted live rows sharing an 80,004-entry native journal retain correct state, model, thinking and bounded history through the real worker's unchanged three-second deadline under a 96 MiB JavaScript heap; completed terminal branches remain correct. An unchanged 1,000-run native census keeps projecting all handles but emits only settled freshness, while canonical changes and source failure/recovery still notify. This removes redundant notifications, not the census or UI polling.
 - A 512 MiB discarded native field preserves exact eligible usage/IDs/configuration/history, with unchanged source bytes, under a **96 MiB** heap limit. Structural over-budget image/deep/key records degrade explicitly while later visible text remains searchable.
 - Completed-attempt search cannot return a successor's later text from a shared physical source. Full selected details reject missing/replaced/truncated sources; canonical output reads reject concurrent growth beyond their snapshot.
 - Competing history processes preserve staged configuration/text on normal completion and recover after a writer is killed. Schema-4 indexes with intact cursors but missing entries rebuild from unchanged journals.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fitchmultz/pi-subagents",
-  "version": "0.44.5",
+  "version": "0.44.6",
   "description": "Pi extension for subagent orchestration and local session coordination",
   "license": "MIT",
   "type": "module",

package/src/history/queries.ts

@@ -11,7 +11,9 @@ interface Cursor { generation: string; owner: string; version: number; query: st
 export class HistoryQueries {
 	private store: HistoryStore;
 	private info: () => HistoryVersion;
+	private configurations = new Map<string, HistoryConfiguration>();
 	constructor(store: HistoryStore, info: () => HistoryVersion) { this.store = store; this.info = info; }
+	sourcesRemoved(): void { this.configurations.clear(); }
 	private cursor(query: string, keys: (string | number)[], offset: number): string {
 		return Buffer.from(JSON.stringify({ generation: this.store.generation, owner: this.store.owner, version: this.info().version, query, keys, offset } satisfies Cursor)).toString("base64url");
 	}
@@ -80,6 +82,12 @@ export class HistoryQueries {
 		if (input.leaf === null) return {};
 		let boundary: ReturnType<HistoryQueries["boundary"]>;
 		try { boundary = this.boundary(source, input); } catch (error) { if (!strict && error instanceof HistoryIndexError && error.code === "BOUNDARY_UNAVAILABLE") return {}; throw error; }
+		// Only committed source changes invalidate ancestry, not unrelated run projections.
+		// Validate boundaries before reuse; explicit null leaves returned above remain empty.
+		const leafKey = input.leaf === undefined ? null : [typeof input.leaf, String(input.leaf)];
+		const key = JSON.stringify([source.id, source.generation, source.cursor, source.stamp, input.terminalEntryId || null, input.terminalEntryId ? null : input.endedAt ?? null, leafKey, strict]);
+		const cached = this.configurations.get(key);
+		if (cached) return { ...cached };
 		const leaf = input.leaf ?? this.store.get(`SELECT id FROM entries WHERE ${boundary.clauses.join(" AND ")} ORDER BY start DESC LIMIT 1`, ...boundary.params)?.id;
 		if (!leaf) return {};
 		// Fix recursive loop order: look up each child's parent by ID instead of
@@ -93,7 +101,11 @@ export class HistoryQueries {
 			(SELECT configuration_thinking FROM branch WHERE configuration_thinking IS NOT NULL ORDER BY start DESC LIMIT 1) AS thinking`, ...boundary.params, leaf);
 		if (!facts.count && input.leaf && strict) throw new HistoryIndexError("BOUNDARY_UNAVAILABLE", "Selected configuration leaf is not available in the indexed generation.");
 		if (facts.count && !facts.rooted) { if (!strict) return {}; throw new HistoryIndexError("MALFORMED_ANCESTRY", "Selected native configuration has cyclic ancestry."); }
-		return { ...(facts.model ? { model: facts.model, modelRecordedAt: facts.recorded_at ?? undefined } : {}), ...(facts.thinking ? { thinking: facts.thinking } : {}) };
+		const configuration = { ...(facts.model ? { model: facts.model, modelRecordedAt: facts.recorded_at ?? undefined } : {}), ...(facts.thinking ? { thinking: facts.thinking } : {}) };
+		// Bound memory across arbitrary sources, boundaries and pages. Eviction only recomputes.
+		if (this.configurations.size >= 128) this.configurations.delete(this.configurations.keys().next().value!);
+		this.configurations.set(key, configuration);
+		return { ...configuration };
 	}
 	historyPage(input: HistoryPageInput): HistoryPage {
 		const { source } = this.child(input.runId, input.index);
@@ -149,6 +161,12 @@ export class HistoryQueries {
 		if (input.runId) { clauses.push("c.run_id=?"); params.push(input.runId); }
 		if (input.index !== undefined) { clauses.push("c.child_index=?"); params.push(input.index); }
 		if (input.agent) { if (input.agent.length > 256) throw new HistoryIndexError("INVALID", "Agent filter is too long."); clauses.push("c.agent=?"); params.push(input.agent); }
+		const joins = "JOIN sources s ON s.id=e.source_id JOIN children c ON c.source_id=s.id LEFT JOIN entries terminal ON terminal.source_id=s.id AND terminal.generation=s.generation AND terminal.id=c.terminal_entry_id AND terminal.published=1";
+		// Scope records before materializing/grouping hits, while bm25 still sees the
+		// complete corpus. Scan each linked source once, not once per continuation.
+		// Attempt boundaries, attribution and seek filtering remain in the final join.
+		const eligible = input.runId || input.agent ? `eligible AS MATERIALIZED (SELECT e.rowid FROM entries e JOIN sources s ON s.id=e.source_id WHERE e.published=1 AND e.generation=s.generation AND e.source_id IN (SELECT c.source_id FROM children c WHERE ${clauses.slice(4).join(" AND ")})),` : "";
+		const eligibleParams = eligible ? params.slice(expression.length) : [];
 		// Ordering/filters apply globally before limit. Common terms may still require an FTS
 		// scan/sort; the parent enforces a hard deadline by killing this separate process.
 		const score = sort === "relevance" ? "matched.score" : "-COALESCE(e.timestamp,0)";
@@ -158,8 +176,8 @@ export class HistoryQueries {
 		}
 		// Match words across all visible fields/windows of one native record. A quoted
 		// phrase remains a single FTS expression, so it cannot span unrelated fields.
-		const rows = this.store.all(`WITH hits AS MATERIALIZED (
-			${expression.map((_term, index) => `SELECT d.id,d.entry_rowid,bm25(corpus) AS score,${index} AS term FROM corpus JOIN documents d ON d.id=corpus.rowid WHERE corpus MATCH ?`).join(" UNION ALL ")}
+		const rows = this.store.all(`WITH ${eligible} hits AS MATERIALIZED (
+			${expression.map((_term, index) => `SELECT d.id,d.entry_rowid,bm25(corpus) AS score,${index} AS term FROM corpus JOIN documents d ON d.id=corpus.rowid WHERE corpus MATCH ?${eligible ? " AND d.entry_rowid IN (SELECT rowid FROM eligible)" : ""}`).join(" UNION ALL ")}
 		), terms AS (
 			SELECT entry_rowid,term,MIN(score) AS score FROM hits GROUP BY entry_rowid,term
 		), matched AS (
@@ -167,7 +185,7 @@ export class HistoryQueries {
 		), excerpts AS (
 			SELECT id,entry_rowid,ROW_NUMBER() OVER (PARTITION BY entry_rowid ORDER BY score,id) AS choice FROM hits
 		)
-		SELECT d.*,${score} AS score,e.*,d.id AS document_id,s.path,s.session_id,c.run_id,c.child_index,c.agent,d.preview AS document_preview FROM matched JOIN excerpts ON excerpts.entry_rowid=matched.entry_rowid AND excerpts.choice=1 JOIN documents d ON d.id=excerpts.id JOIN entries e ON e.rowid=matched.entry_rowid JOIN sources s ON s.id=e.source_id JOIN children c ON c.source_id=s.id LEFT JOIN entries terminal ON terminal.source_id=s.id AND terminal.generation=s.generation AND terminal.id=c.terminal_entry_id AND terminal.published=1 WHERE ${clauses.join(" AND ")} ORDER BY score,d.id,c.run_id,c.child_index LIMIT ?`, ...params, limit + 1);
+		SELECT d.*,${score} AS score,e.*,d.id AS document_id,s.path,s.session_id,c.run_id,c.child_index,c.agent,d.preview AS document_preview FROM matched JOIN excerpts ON excerpts.entry_rowid=matched.entry_rowid AND excerpts.choice=1 JOIN documents d ON d.id=excerpts.id JOIN entries e ON e.rowid=matched.entry_rowid ${joins} WHERE ${clauses.join(" AND ")} ORDER BY score,d.id,c.run_id,c.child_index LIMIT ?`, ...eligibleParams, ...params, limit + 1);
 		const more = rows.length > limit, page = rows.slice(0, limit);
 		return { ...this.info(), matches: page.map((row) => ({ id: row.document_id, runId: row.run_id, index: row.child_index, agent: row.agent, entryId: row.id, nativeId: row.native_id, sessionId: row.session_id, sessionFile: row.path, timestamp: row.timestamp,
 			ref: { sourceId: row.source_id, generation: row.generation, start: row.start, end: row.end, digest: row.digest }, preview: row.document_preview, field: row.field, textStart: row.text_start, textEnd: row.text_end, score: row.score })),

package/src/history/worker.ts

@@ -21,6 +21,8 @@ const sourceWatchers = new Map<string, fs.FSWatcher>();
 const watchIdentities = new WeakMap<fs.FSWatcher, string>();
 const watchedSources = new Map<string, Map<string, string>>();
 let job: SourceIngest | undefined, scheduled = false, closed = false;
+let sourceObservation: { state: string; error: string | null } | undefined;
+let notifiedVersion: string | undefined;
 let retryTimer: ReturnType<typeof setTimeout> | undefined;
 let runErrors = new Set<string>();
 const barriers: Array<{ id: number; runId?: string }> = [];
@@ -32,7 +34,14 @@ function send(response: Response): void {
 	// The parent can disconnect after process.connected was read; then this and later replies are undeliverable, so stop as on disconnect.
 	if (process.connected) process.send!(response, undefined, undefined, (error) => { if (error) shutdown(); });
 }
-function changed(): void { send({ changed: true }); }
+function changed(observationChanged = false): void {
+	const version = store?.get("SELECT value FROM meta WHERE key='version'").value;
+	// Unchanged census projections need only one final freshness notification.
+	// Non-versioned errors/recovery and real commits still publish immediately.
+	if (observationChanged || version !== notifiedVersion || !hasPending()) {
+		notifiedVersion = version; send({ changed: true });
+	}
+}
 function errorReply(id: number, error: unknown): void {
 	const code = error instanceof HistoryIndexError ? error.code : "UNAVAILABLE";
 	// Parser errors can include fragments from the malformed body. IPC/logs must never carry them.
@@ -164,7 +173,11 @@ function prune(previousSources?: string[]): void {
 			store!.deleteDocuments(source.id);
 			store!.run("DELETE FROM entries WHERE source_id=?", source.id); store!.run("DELETE FROM sources WHERE id=?", source.id); removed = true;
 		}
-		if (removed) store!.bump();
+		if (removed) {
+			store!.bump();
+			// A later admission of the same path can recreate source generation 1.
+			queries?.sourcesRemoved();
+		}
 	});
 }
 function admit(run: OwnedRun): void {
@@ -201,23 +214,25 @@ function pump(): void {
 	try {
 		if (dirtyRuns.size) {
 			const id = dirtyRuns.values().next().value!; dirtyRuns.delete(id);
+			const failed = runErrors.has(id);
 			installWatches(id);
 			const previousSources = store.all("SELECT source_id FROM children WHERE run_id=? AND source_id IS NOT NULL", id).map((child) => child.source_id);
 			try { store.operations.runProjections++; const view = projection(runs.get(id)!); store.putView(compactView(view), view); runErrors.delete(id); }
 			catch { const view = unknown(runs.get(id)!, "Canonical owner summary is unavailable. Completion remains unconfirmed."); store.putView(compactView(view), view); runErrors.add(id); }
 			prune(previousSources);
 			for (const child of store.all("SELECT source_id FROM children WHERE run_id=? AND source_id IS NOT NULL", id)) if (child.source_id !== job?.id) dirtySources.set(child.source_id, dirtySources.get(child.source_id) ?? false);
-			installWatches(id); changed();
+			installWatches(id); changed(failed !== runErrors.has(id));
 		} else if (job) {
 			if (job.step()) {
 				const source = store.source(job.id);
 				if (source) watchSources(path.dirname(source.path));
-				job = undefined; changed();
+				job = undefined; changed(source?.state !== sourceObservation?.state || source?.error !== sourceObservation?.error);
+				sourceObservation = undefined;
 			}
 		} else if (dirtySources.size) {
 			const [id, force] = dirtySources.entries().next().value!; dirtySources.delete(id);
 			const source = store.source(id);
-			if (source) { activeSource = id; job = new SourceIngest(store, source, force); }
+			if (source) { activeSource = id; sourceObservation = source; job = new SourceIngest(store, source, force); }
 		}
 	} catch (error) {
 		const id = job?.id ?? activeSource;
@@ -230,7 +245,11 @@ function pump(): void {
 			else if ((error as NodeJS.ErrnoException).code === "ENOENT") store.resetSource(id, "missing", "Linked native conversation is missing.");
 			else store.run("UPDATE sources SET state='error',error=?,checked_at=? WHERE id=?", "Linked native conversation could not be indexed.", Date.now(), id);
 		}
-		if (!(error instanceof HistoryIndexError && error.code === "INDEX_BUSY")) changed();
+		if (!(error instanceof HistoryIndexError && error.code === "INDEX_BUSY")) {
+			const source = id ? store.source(id) : undefined;
+			changed(Boolean(source && (source.state !== sourceObservation?.state || source.error !== sourceObservation?.error)));
+		}
+		sourceObservation = undefined;
 	}
 	activeSource = undefined;
 	finishBarriers();
@@ -247,6 +266,7 @@ const timer = setInterval(census, 30_000); timer.unref();
 function clear(): void {
 	clearTimeout(retryTimer); retryTimer = undefined;
 	job?.close(); job = undefined;
+	sourceObservation = undefined; notifiedVersion = undefined;
 	for (const watcher of watchers.values()) watcher.close(); watchers.clear(); watchedSources.clear();
 	for (const watcher of sourceWatchers.values()) watcher.close(); sourceWatchers.clear();
 	dirtyRuns.clear(); dirtySources.clear(); runs.clear(); foreground.clear(); runErrors = new Set();