@quolu/lattice 0.63.0 → 0.63.2

package/sensor/dist/db/schema.sql

@@ -1,205 +1,205 @@
--- LatticeSensor SQLite Schema
--- Version 1
-
--- Schema version tracking
-CREATE TABLE IF NOT EXISTS schema_versions (
-    version INTEGER PRIMARY KEY,
-    applied_at INTEGER NOT NULL,
-    description TEXT
-);
-
--- Insert initial version
-INSERT INTO schema_versions (version, applied_at, description)
-VALUES (1, strftime('%s', 'now') * 1000, 'Initial schema');
-
--- =============================================================================
--- Core Tables
--- =============================================================================
-
--- Nodes: Code symbols (functions, classes, variables, etc.)
-CREATE TABLE IF NOT EXISTS nodes (
-    id TEXT PRIMARY KEY,
-    kind TEXT NOT NULL,
-    name TEXT NOT NULL,
-    qualified_name TEXT NOT NULL,
-    file_path TEXT NOT NULL,
-    language TEXT NOT NULL,
-    start_line INTEGER NOT NULL,
-    end_line INTEGER NOT NULL,
-    start_column INTEGER NOT NULL,
-    end_column INTEGER NOT NULL,
-    docstring TEXT,
-    signature TEXT,
-    visibility TEXT,
-    is_exported INTEGER DEFAULT 0,
-    is_async INTEGER DEFAULT 0,
-    is_static INTEGER DEFAULT 0,
-    is_abstract INTEGER DEFAULT 0,
-    decorators TEXT, -- JSON array
-    type_parameters TEXT, -- JSON array
-    return_type TEXT,
-  -- v11: first line including preceding decorators/attributes (NULL = none).
-  extent_start_line INTEGER, -- normalized return/result type name (e.g. C++ method return, for receiver-type inference)
-    updated_at INTEGER NOT NULL
-);
-
--- Edges: Relationships between nodes
-CREATE TABLE IF NOT EXISTS edges (
-    id INTEGER PRIMARY KEY AUTOINCREMENT,
-    source TEXT NOT NULL,
-    target TEXT NOT NULL,
-    kind TEXT NOT NULL,
-    metadata TEXT, -- JSON object
-    line INTEGER,
-    col INTEGER,
-    provenance TEXT DEFAULT NULL,
-    confidence REAL, -- resolution confidence (0.0-1.0), mirrors metadata.confidence — v9
-    resolved_by TEXT, -- resolution strategy name, mirrors metadata.resolvedBy — v9
-    FOREIGN KEY (source) REFERENCES nodes(id) ON DELETE CASCADE,
-    FOREIGN KEY (target) REFERENCES nodes(id) ON DELETE CASCADE
-);
-
--- Files: Tracked source files
-CREATE TABLE IF NOT EXISTS files (
-    path TEXT PRIMARY KEY,
-    content_hash TEXT NOT NULL,
-    language TEXT NOT NULL,
-    size INTEGER NOT NULL,
-    modified_at INTEGER NOT NULL,
-    indexed_at INTEGER NOT NULL,
-    node_count INTEGER DEFAULT 0,
-    -- EXTRACTION_VERSION of the engine that wrote this row. 0 = written before
-    -- the stamp existed; sync treats any mismatch with the running engine as a
-    -- pending change so extractor upgrades heal incrementally (v12).
-    extraction_version INTEGER NOT NULL DEFAULT 0,
-    errors TEXT -- JSON array
-);
-
--- Unresolved References: References that need resolution after full indexing.
--- status lifecycle: rows are inserted 'pending' by extraction; a completed
--- resolution pass either deletes a row (resolved) or marks it 'failed'
--- (attempted, no match — kept so a later sync can retry it when a changed
--- file introduces a symbol that could satisfy it, #1240). name_tail is the
--- last segment of reference_name ('util.greet' → 'greet'), written when a
--- row is marked failed, so the retry lookup matches new node names against
--- dotted refs too. Rows follow their from_node via ON DELETE CASCADE, so
--- re-extracting or deleting a file clears its stale rows in any status.
-CREATE TABLE IF NOT EXISTS unresolved_refs (
-    id INTEGER PRIMARY KEY AUTOINCREMENT,
-    from_node_id TEXT NOT NULL,
-    reference_name TEXT NOT NULL,
-    reference_kind TEXT NOT NULL,
-    line INTEGER NOT NULL,
-    col INTEGER NOT NULL,
-    candidates TEXT, -- JSON array
-    file_path TEXT NOT NULL DEFAULT '',
-    language TEXT NOT NULL DEFAULT 'unknown',
-    status TEXT NOT NULL DEFAULT 'pending',
-    name_tail TEXT NOT NULL DEFAULT '',
-    -- Import binding shape (v10): default/named/namespace + source-side name.
-    binding_form TEXT,
-    imported_name TEXT,
-    FOREIGN KEY (from_node_id) REFERENCES nodes(id) ON DELETE CASCADE
-);
-
--- =============================================================================
--- Indexes for Query Performance
--- =============================================================================
-
--- Node indexes
-CREATE INDEX IF NOT EXISTS idx_nodes_kind ON nodes(kind);
-CREATE INDEX IF NOT EXISTS idx_nodes_name ON nodes(name);
-CREATE INDEX IF NOT EXISTS idx_nodes_qualified_name ON nodes(qualified_name);
-CREATE INDEX IF NOT EXISTS idx_nodes_file_path ON nodes(file_path);
-CREATE INDEX IF NOT EXISTS idx_nodes_language ON nodes(language);
-CREATE INDEX IF NOT EXISTS idx_nodes_file_line ON nodes(file_path, start_line);
-CREATE INDEX IF NOT EXISTS idx_nodes_lower_name ON nodes(lower(name));
-
--- Full-text search index on node names, docstrings, and signatures
-CREATE VIRTUAL TABLE IF NOT EXISTS nodes_fts USING fts5(
-    id,
-    name,
-    qualified_name,
-    docstring,
-    signature,
-    content='nodes',
-    content_rowid='rowid'
-);
-
--- Triggers to keep FTS index in sync
-CREATE TRIGGER IF NOT EXISTS nodes_ai AFTER INSERT ON nodes BEGIN
-    INSERT INTO nodes_fts(rowid, id, name, qualified_name, docstring, signature)
-    VALUES (NEW.rowid, NEW.id, NEW.name, NEW.qualified_name, NEW.docstring, NEW.signature);
-END;
-
-CREATE TRIGGER IF NOT EXISTS nodes_ad AFTER DELETE ON nodes BEGIN
-    INSERT INTO nodes_fts(nodes_fts, rowid, id, name, qualified_name, docstring, signature)
-    VALUES ('delete', OLD.rowid, OLD.id, OLD.name, OLD.qualified_name, OLD.docstring, OLD.signature);
-END;
-
-CREATE TRIGGER IF NOT EXISTS nodes_au AFTER UPDATE ON nodes BEGIN
-    INSERT INTO nodes_fts(nodes_fts, rowid, id, name, qualified_name, docstring, signature)
-    VALUES ('delete', OLD.rowid, OLD.id, OLD.name, OLD.qualified_name, OLD.docstring, OLD.signature);
-    INSERT INTO nodes_fts(rowid, id, name, qualified_name, docstring, signature)
-    VALUES (NEW.rowid, NEW.id, NEW.name, NEW.qualified_name, NEW.docstring, NEW.signature);
-END;
-
--- Prose-word → symbol-name lookup for the prompt hook's graph-derived gate.
--- One row per (segment, name): segment is a lowercased word of a symbol name
--- ("OrderStateMachine" → order, state, machine — see identifier-segments.ts),
--- which lets natural-language prompt words be verified against the graph in
--- any language whose technical nouns are Latin script. File nodes are
--- excluded — a file's basename duplicates the symbols inside it and skews the
--- singleton-vs-cluster rarity statistics. FTS can't serve this lookup (its
--- tokenizer keeps camelCase names as single tokens), so segments are
--- materialized on the node write path.
--- Deletions leave orphan rows ON PURPOSE: rows are PROPOSALS, always
--- re-verified against nodes before being surfaced (LatticeSensor.getSegmentMatches),
--- and a full index clears the table at its start. Populated lazily on old
--- databases (empty until the next index/sync heals it).
-CREATE TABLE IF NOT EXISTS name_segment_vocab (
-    segment TEXT NOT NULL,
-    name TEXT NOT NULL,
-    PRIMARY KEY (segment, name)
-) WITHOUT ROWID;
-
--- Edge indexes.
--- idx_edges_source / idx_edges_target are intentionally omitted —
--- the (source, kind) and (target, kind) composites below cover the
--- corresponding source-only / target-only lookups via SQLite's
--- left-prefix scan, so the narrow indexes are dead weight on writes.
--- Migration v4 drops them on existing databases.
-CREATE INDEX IF NOT EXISTS idx_edges_kind ON edges(kind);
-CREATE INDEX IF NOT EXISTS idx_edges_source_kind ON edges(source, kind);
-CREATE INDEX IF NOT EXISTS idx_edges_target_kind ON edges(target, kind);
-
--- Edge identity uniqueness. An edge IS uniquely (source, target, kind, line,
--- col); insertEdge uses `INSERT OR IGNORE`, but without something UNIQUE to
--- conflict on it behaved like a plain INSERT, so two passes emitting the same
--- edge produced byte-identical duplicate rows that inflated counts and flowed
--- into callers/impact (#1034). IFNULL folds the nullable line/col so
--- coordinate-less edges (synthesized / file-level) dedup too — SQLite treats
--- each NULL as distinct otherwise. Migration v6 dedups existing rows + adds
--- this on older databases.
-CREATE UNIQUE INDEX IF NOT EXISTS idx_edges_identity
-  ON edges(source, target, kind, IFNULL(line, -1), IFNULL(col, -1));
-
--- File indexes
-CREATE INDEX IF NOT EXISTS idx_files_language ON files(language);
-CREATE INDEX IF NOT EXISTS idx_files_modified_at ON files(modified_at);
-
--- Unresolved refs indexes
-CREATE INDEX IF NOT EXISTS idx_unresolved_from_node ON unresolved_refs(from_node_id);
-CREATE INDEX IF NOT EXISTS idx_unresolved_name ON unresolved_refs(reference_name);
-CREATE INDEX IF NOT EXISTS idx_unresolved_file_path ON unresolved_refs(file_path);
-CREATE INDEX IF NOT EXISTS idx_unresolved_from_name ON unresolved_refs(from_node_id, reference_name);
-CREATE INDEX IF NOT EXISTS idx_unresolved_status ON unresolved_refs(status);
-CREATE INDEX IF NOT EXISTS idx_unresolved_failed_tail ON unresolved_refs(name_tail) WHERE status = 'failed';
-CREATE INDEX IF NOT EXISTS idx_edges_provenance ON edges(provenance);
-
--- Project metadata for version/provenance tracking
-CREATE TABLE IF NOT EXISTS project_metadata (
-    key TEXT PRIMARY KEY,
-    value TEXT NOT NULL,
-    updated_at INTEGER NOT NULL
-);
+-- LatticeSensor SQLite Schema
+-- Version 1
+
+-- Schema version tracking
+CREATE TABLE IF NOT EXISTS schema_versions (
+    version INTEGER PRIMARY KEY,
+    applied_at INTEGER NOT NULL,
+    description TEXT
+);
+
+-- Insert initial version
+INSERT INTO schema_versions (version, applied_at, description)
+VALUES (1, strftime('%s', 'now') * 1000, 'Initial schema');
+
+-- =============================================================================
+-- Core Tables
+-- =============================================================================
+
+-- Nodes: Code symbols (functions, classes, variables, etc.)
+CREATE TABLE IF NOT EXISTS nodes (
+    id TEXT PRIMARY KEY,
+    kind TEXT NOT NULL,
+    name TEXT NOT NULL,
+    qualified_name TEXT NOT NULL,
+    file_path TEXT NOT NULL,
+    language TEXT NOT NULL,
+    start_line INTEGER NOT NULL,
+    end_line INTEGER NOT NULL,
+    start_column INTEGER NOT NULL,
+    end_column INTEGER NOT NULL,
+    docstring TEXT,
+    signature TEXT,
+    visibility TEXT,
+    is_exported INTEGER DEFAULT 0,
+    is_async INTEGER DEFAULT 0,
+    is_static INTEGER DEFAULT 0,
+    is_abstract INTEGER DEFAULT 0,
+    decorators TEXT, -- JSON array
+    type_parameters TEXT, -- JSON array
+    return_type TEXT,
+  -- v11: first line including preceding decorators/attributes (NULL = none).
+  extent_start_line INTEGER, -- normalized return/result type name (e.g. C++ method return, for receiver-type inference)
+    updated_at INTEGER NOT NULL
+);
+
+-- Edges: Relationships between nodes
+CREATE TABLE IF NOT EXISTS edges (
+    id INTEGER PRIMARY KEY AUTOINCREMENT,
+    source TEXT NOT NULL,
+    target TEXT NOT NULL,
+    kind TEXT NOT NULL,
+    metadata TEXT, -- JSON object
+    line INTEGER,
+    col INTEGER,
+    provenance TEXT DEFAULT NULL,
+    confidence REAL, -- resolution confidence (0.0-1.0), mirrors metadata.confidence — v9
+    resolved_by TEXT, -- resolution strategy name, mirrors metadata.resolvedBy — v9
+    FOREIGN KEY (source) REFERENCES nodes(id) ON DELETE CASCADE,
+    FOREIGN KEY (target) REFERENCES nodes(id) ON DELETE CASCADE
+);
+
+-- Files: Tracked source files
+CREATE TABLE IF NOT EXISTS files (
+    path TEXT PRIMARY KEY,
+    content_hash TEXT NOT NULL,
+    language TEXT NOT NULL,
+    size INTEGER NOT NULL,
+    modified_at INTEGER NOT NULL,
+    indexed_at INTEGER NOT NULL,
+    node_count INTEGER DEFAULT 0,
+    -- EXTRACTION_VERSION of the engine that wrote this row. 0 = written before
+    -- the stamp existed; sync treats any mismatch with the running engine as a
+    -- pending change so extractor upgrades heal incrementally (v12).
+    extraction_version INTEGER NOT NULL DEFAULT 0,
+    errors TEXT -- JSON array
+);
+
+-- Unresolved References: References that need resolution after full indexing.
+-- status lifecycle: rows are inserted 'pending' by extraction; a completed
+-- resolution pass either deletes a row (resolved) or marks it 'failed'
+-- (attempted, no match — kept so a later sync can retry it when a changed
+-- file introduces a symbol that could satisfy it, #1240). name_tail is the
+-- last segment of reference_name ('util.greet' → 'greet'), written when a
+-- row is marked failed, so the retry lookup matches new node names against
+-- dotted refs too. Rows follow their from_node via ON DELETE CASCADE, so
+-- re-extracting or deleting a file clears its stale rows in any status.
+CREATE TABLE IF NOT EXISTS unresolved_refs (
+    id INTEGER PRIMARY KEY AUTOINCREMENT,
+    from_node_id TEXT NOT NULL,
+    reference_name TEXT NOT NULL,
+    reference_kind TEXT NOT NULL,
+    line INTEGER NOT NULL,
+    col INTEGER NOT NULL,
+    candidates TEXT, -- JSON array
+    file_path TEXT NOT NULL DEFAULT '',
+    language TEXT NOT NULL DEFAULT 'unknown',
+    status TEXT NOT NULL DEFAULT 'pending',
+    name_tail TEXT NOT NULL DEFAULT '',
+    -- Import binding shape (v10): default/named/namespace + source-side name.
+    binding_form TEXT,
+    imported_name TEXT,
+    FOREIGN KEY (from_node_id) REFERENCES nodes(id) ON DELETE CASCADE
+);
+
+-- =============================================================================
+-- Indexes for Query Performance
+-- =============================================================================
+
+-- Node indexes
+CREATE INDEX IF NOT EXISTS idx_nodes_kind ON nodes(kind);
+CREATE INDEX IF NOT EXISTS idx_nodes_name ON nodes(name);
+CREATE INDEX IF NOT EXISTS idx_nodes_qualified_name ON nodes(qualified_name);
+CREATE INDEX IF NOT EXISTS idx_nodes_file_path ON nodes(file_path);
+CREATE INDEX IF NOT EXISTS idx_nodes_language ON nodes(language);
+CREATE INDEX IF NOT EXISTS idx_nodes_file_line ON nodes(file_path, start_line);
+CREATE INDEX IF NOT EXISTS idx_nodes_lower_name ON nodes(lower(name));
+
+-- Full-text search index on node names, docstrings, and signatures
+CREATE VIRTUAL TABLE IF NOT EXISTS nodes_fts USING fts5(
+    id,
+    name,
+    qualified_name,
+    docstring,
+    signature,
+    content='nodes',
+    content_rowid='rowid'
+);
+
+-- Triggers to keep FTS index in sync
+CREATE TRIGGER IF NOT EXISTS nodes_ai AFTER INSERT ON nodes BEGIN
+    INSERT INTO nodes_fts(rowid, id, name, qualified_name, docstring, signature)
+    VALUES (NEW.rowid, NEW.id, NEW.name, NEW.qualified_name, NEW.docstring, NEW.signature);
+END;
+
+CREATE TRIGGER IF NOT EXISTS nodes_ad AFTER DELETE ON nodes BEGIN
+    INSERT INTO nodes_fts(nodes_fts, rowid, id, name, qualified_name, docstring, signature)
+    VALUES ('delete', OLD.rowid, OLD.id, OLD.name, OLD.qualified_name, OLD.docstring, OLD.signature);
+END;
+
+CREATE TRIGGER IF NOT EXISTS nodes_au AFTER UPDATE ON nodes BEGIN
+    INSERT INTO nodes_fts(nodes_fts, rowid, id, name, qualified_name, docstring, signature)
+    VALUES ('delete', OLD.rowid, OLD.id, OLD.name, OLD.qualified_name, OLD.docstring, OLD.signature);
+    INSERT INTO nodes_fts(rowid, id, name, qualified_name, docstring, signature)
+    VALUES (NEW.rowid, NEW.id, NEW.name, NEW.qualified_name, NEW.docstring, NEW.signature);
+END;
+
+-- Prose-word → symbol-name lookup for the prompt hook's graph-derived gate.
+-- One row per (segment, name): segment is a lowercased word of a symbol name
+-- ("OrderStateMachine" → order, state, machine — see identifier-segments.ts),
+-- which lets natural-language prompt words be verified against the graph in
+-- any language whose technical nouns are Latin script. File nodes are
+-- excluded — a file's basename duplicates the symbols inside it and skews the
+-- singleton-vs-cluster rarity statistics. FTS can't serve this lookup (its
+-- tokenizer keeps camelCase names as single tokens), so segments are
+-- materialized on the node write path.
+-- Deletions leave orphan rows ON PURPOSE: rows are PROPOSALS, always
+-- re-verified against nodes before being surfaced (LatticeSensor.getSegmentMatches),
+-- and a full index clears the table at its start. Populated lazily on old
+-- databases (empty until the next index/sync heals it).
+CREATE TABLE IF NOT EXISTS name_segment_vocab (
+    segment TEXT NOT NULL,
+    name TEXT NOT NULL,
+    PRIMARY KEY (segment, name)
+) WITHOUT ROWID;
+
+-- Edge indexes.
+-- idx_edges_source / idx_edges_target are intentionally omitted —
+-- the (source, kind) and (target, kind) composites below cover the
+-- corresponding source-only / target-only lookups via SQLite's
+-- left-prefix scan, so the narrow indexes are dead weight on writes.
+-- Migration v4 drops them on existing databases.
+CREATE INDEX IF NOT EXISTS idx_edges_kind ON edges(kind);
+CREATE INDEX IF NOT EXISTS idx_edges_source_kind ON edges(source, kind);
+CREATE INDEX IF NOT EXISTS idx_edges_target_kind ON edges(target, kind);
+
+-- Edge identity uniqueness. An edge IS uniquely (source, target, kind, line,
+-- col); insertEdge uses `INSERT OR IGNORE`, but without something UNIQUE to
+-- conflict on it behaved like a plain INSERT, so two passes emitting the same
+-- edge produced byte-identical duplicate rows that inflated counts and flowed
+-- into callers/impact (#1034). IFNULL folds the nullable line/col so
+-- coordinate-less edges (synthesized / file-level) dedup too — SQLite treats
+-- each NULL as distinct otherwise. Migration v6 dedups existing rows + adds
+-- this on older databases.
+CREATE UNIQUE INDEX IF NOT EXISTS idx_edges_identity
+  ON edges(source, target, kind, IFNULL(line, -1), IFNULL(col, -1));
+
+-- File indexes
+CREATE INDEX IF NOT EXISTS idx_files_language ON files(language);
+CREATE INDEX IF NOT EXISTS idx_files_modified_at ON files(modified_at);
+
+-- Unresolved refs indexes
+CREATE INDEX IF NOT EXISTS idx_unresolved_from_node ON unresolved_refs(from_node_id);
+CREATE INDEX IF NOT EXISTS idx_unresolved_name ON unresolved_refs(reference_name);
+CREATE INDEX IF NOT EXISTS idx_unresolved_file_path ON unresolved_refs(file_path);
+CREATE INDEX IF NOT EXISTS idx_unresolved_from_name ON unresolved_refs(from_node_id, reference_name);
+CREATE INDEX IF NOT EXISTS idx_unresolved_status ON unresolved_refs(status);
+CREATE INDEX IF NOT EXISTS idx_unresolved_failed_tail ON unresolved_refs(name_tail) WHERE status = 'failed';
+CREATE INDEX IF NOT EXISTS idx_edges_provenance ON edges(provenance);
+
+-- Project metadata for version/provenance tracking
+CREATE TABLE IF NOT EXISTS project_metadata (
+    key TEXT PRIMARY KEY,
+    value TEXT NOT NULL,
+    updated_at INTEGER NOT NULL
+);

package/sensor/dist/directory.js

@@ -551,11 +551,11 @@ function planFrontload(cwd, prompt) {
  * explicit allowlist that never listed `daemon.pid` or the socket, so those
  * runtime files were silently committed.
  */
-const GITIGNORE_CONTENT = `# LatticeSensor data files — local to each machine, not for committing.
-# Ignore everything in .lattice/sensor/ except this file itself, so transient
-# files (the database, daemon.pid, sockets, logs) never show up in git.
-*
-!.gitignore
+const GITIGNORE_CONTENT = `# LatticeSensor data files — local to each machine, not for committing.
+# Ignore everything in .lattice/sensor/ except this file itself, so transient
+# files (the database, daemon.pid, sockets, logs) never show up in git.
+*
+!.gitignore
 `;
 /** Header line that prefixes every .gitignore LatticeSensor has auto-generated. */
 const GITIGNORE_MARKER = '# LatticeSensor data files';

package/sensor/dist/mcp/liveness-watchdog.js

@@ -134,59 +134,59 @@ function debug(msg) {
  * target pid + timeout from argv; an MSG built once at startup (the child is
  * never wedged, so allocation here is fine).
  */
-const CHILD_SOURCE = `
-const fs = require('fs');
-const parentPid = Number(process.argv[1]);
-const timeoutMs = Number(process.argv[2]);
-const capMs = Number(process.argv[3]);
-const progressPaths = process.argv.slice(4);
-const secs = Math.round(timeoutMs / 1000);
-function kill(extra) {
-  // Timestamped so daemon.log kills can be correlated with anything (#1431) —
-  // computed here at kill time; this child process is never the wedged one.
-  try { fs.writeSync(2, Buffer.from('[' + new Date().toISOString() + '] [LatticeSensor] Main thread unresponsive for ~' + secs + 's' + (extra || '') + ' — killing the wedged process so a fresh one can start (#850). Disable with LATTICE_SENSOR_NO_WATCHDOG=1.\\n')); } catch (e) {}
-  try { process.kill(parentPid, 'SIGKILL'); } catch (e) {}
-  process.exit(0);
-}
-// Fingerprint of the watched files (size + mtime). A change between checks is
-// forward disk progress — a slow synchronous SQLite statement, not a wedge.
-function snap() {
-  let s = '';
-  for (const p of progressPaths) {
-    try { const st = fs.statSync(p); s += st.size + ':' + st.mtimeMs + ';'; } catch (e) { s += 'x;'; }
-  }
-  return s;
-}
-let lastSnap = progressPaths.length ? snap() : '';
-let lastSnapAt = Date.now();
-let silentSince = null; // start of the current continuous-silence episode
-function onTimeout() {
-  if (!progressPaths.length) return kill('');
-  const now = Date.now();
-  if (silentSince === null) silentSince = now - timeoutMs; // silence began ~one timeout ago
-  const cur = snap();
-  if (cur !== lastSnap && now - silentSince < capMs) {
-    // The event loop is blocked but the DB files are advancing: a legitimate
-    // long store on slow storage. Defer, re-baseline, keep watching.
-    lastSnap = cur;
-    timer = setTimeout(onTimeout, timeoutMs);
-    return;
-  }
-  kill(cur !== lastSnap ? ' despite ongoing disk activity (hard cap ' + Math.round(capMs / 1000) + 's reached)' : '');
-}
-let timer = setTimeout(onTimeout, timeoutMs);
-process.stdin.on('data', () => {
-  silentSince = null;
-  // Keep the baseline fresh while healthy (throttled — a stat per second).
-  if (progressPaths.length) {
-    const t = Date.now();
-    if (t - lastSnapAt >= 1000) { lastSnap = snap(); lastSnapAt = t; }
-  }
-  clearTimeout(timer); timer = setTimeout(onTimeout, timeoutMs);
-});
-process.stdin.on('end', () => process.exit(0));   // parent closed the pipe (exited) -> no orphan
-process.stdin.on('error', () => process.exit(0)); // pipe broke -> parent gone
-process.stdin.resume();
+const CHILD_SOURCE = `
+const fs = require('fs');
+const parentPid = Number(process.argv[1]);
+const timeoutMs = Number(process.argv[2]);
+const capMs = Number(process.argv[3]);
+const progressPaths = process.argv.slice(4);
+const secs = Math.round(timeoutMs / 1000);
+function kill(extra) {
+  // Timestamped so daemon.log kills can be correlated with anything (#1431) —
+  // computed here at kill time; this child process is never the wedged one.
+  try { fs.writeSync(2, Buffer.from('[' + new Date().toISOString() + '] [LatticeSensor] Main thread unresponsive for ~' + secs + 's' + (extra || '') + ' — killing the wedged process so a fresh one can start (#850). Disable with LATTICE_SENSOR_NO_WATCHDOG=1.\\n')); } catch (e) {}
+  try { process.kill(parentPid, 'SIGKILL'); } catch (e) {}
+  process.exit(0);
+}
+// Fingerprint of the watched files (size + mtime). A change between checks is
+// forward disk progress — a slow synchronous SQLite statement, not a wedge.
+function snap() {
+  let s = '';
+  for (const p of progressPaths) {
+    try { const st = fs.statSync(p); s += st.size + ':' + st.mtimeMs + ';'; } catch (e) { s += 'x;'; }
+  }
+  return s;
+}
+let lastSnap = progressPaths.length ? snap() : '';
+let lastSnapAt = Date.now();
+let silentSince = null; // start of the current continuous-silence episode
+function onTimeout() {
+  if (!progressPaths.length) return kill('');
+  const now = Date.now();
+  if (silentSince === null) silentSince = now - timeoutMs; // silence began ~one timeout ago
+  const cur = snap();
+  if (cur !== lastSnap && now - silentSince < capMs) {
+    // The event loop is blocked but the DB files are advancing: a legitimate
+    // long store on slow storage. Defer, re-baseline, keep watching.
+    lastSnap = cur;
+    timer = setTimeout(onTimeout, timeoutMs);
+    return;
+  }
+  kill(cur !== lastSnap ? ' despite ongoing disk activity (hard cap ' + Math.round(capMs / 1000) + 's reached)' : '');
+}
+let timer = setTimeout(onTimeout, timeoutMs);
+process.stdin.on('data', () => {
+  silentSince = null;
+  // Keep the baseline fresh while healthy (throttled — a stat per second).
+  if (progressPaths.length) {
+    const t = Date.now();
+    if (t - lastSnapAt >= 1000) { lastSnap = snap(); lastSnapAt = t; }
+  }
+  clearTimeout(timer); timer = setTimeout(onTimeout, timeoutMs);
+});
+process.stdin.on('end', () => process.exit(0));   // parent closed the pipe (exited) -> no orphan
+process.stdin.on('error', () => process.exit(0)); // pipe broke -> parent gone
+process.stdin.resume();
 `;
 /**
  * Install the main-thread liveness watchdog for a long-lived process. Returns a