crbro-memory 2.4.0 → 2.5.1

package/dist/engine/dates.js

@@ -0,0 +1,121 @@
+"use strict";
+// ─── Dates an entry states about itself (2.5) ────────────────────
+//
+// Patterns, preferences, errors and debts only carry a date since 1.13. On the
+// reference brain that left 249 of 457 without one, and recall answered
+// `matched_added: ""` for them, so "prefer the more recent" had nothing to
+// stand on in exactly the ledgers where it matters.
+//
+// Most of those entries say when they happened — "Hallazgo (2026-08-30): …",
+// "el 14-sep-2026 …". This module reads that and nothing else. The tempting
+// fallback, the neuron's `created`, was measured and thrown away: for the
+// entries with no date in their text the window between `created` and the day
+// dating began had a median of 117 days. A date that loose is not a date, it
+// is a guess with a timestamp's authority. What cannot be dated from its own
+// words stays undated and is counted as such.
+//
+// A recovered date is written as a DAY ("2026-08-30"), never an instant.
+// `cortex.learn` stamps full ISO instants, so the value itself says how it
+// was obtained, the sidecar needs no second field, and every reader — string
+// comparison, `new Date()`, the sync `at` — takes it as it is.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.datesInText = datesInText;
+exports.inferEntryDay = inferEntryDay;
+exports.isDayPrecision = isDayPrecision;
+const MONTHS = {};
+const add = (n, ...names) => { for (const s of names)
+    MONTHS[s] = n; };
+// Full names and the abbreviations people actually write, es/en/fr/de/it/pt.
+// "out" (pt) and "mar"-like collisions are avoided by listing forms, not prefixes.
+add(1, 'enero', 'ene', 'january', 'jan', 'janvier', 'janv', 'januar', 'gennaio', 'gen', 'janeiro');
+add(2, 'febrero', 'feb', 'february', 'fevrier', 'fev', 'februar', 'febbraio', 'fevereiro');
+add(3, 'marzo', 'mar', 'march', 'mars', 'marz', 'maerz', 'marco');
+add(4, 'abril', 'abr', 'april', 'apr', 'avril', 'avr', 'aprile');
+add(5, 'mayo', 'may', 'mai', 'maggio', 'mag', 'maio');
+add(6, 'junio', 'jun', 'june', 'juin', 'juni', 'giugno', 'giu', 'junho');
+add(7, 'julio', 'jul', 'july', 'juillet', 'juil', 'juli', 'luglio', 'lug', 'julho');
+add(8, 'agosto', 'ago', 'august', 'aug', 'aout', 'aou');
+add(9, 'septiembre', 'setiembre', 'sep', 'sept', 'september', 'septembre', 'settembre', 'set', 'setembro');
+add(10, 'octubre', 'oct', 'october', 'octobre', 'oktober', 'okt', 'ottobre', 'ott', 'outubro');
+add(11, 'noviembre', 'nov', 'november', 'novembre', 'novembro');
+add(12, 'diciembre', 'dic', 'december', 'dec', 'decembre', 'dezember', 'dez', 'dicembre', 'dezembro');
+const plain = (s) => s.normalize('NFD').replace(/\p{M}/gu, '').toLowerCase().replace(/\.$/, '');
+/** "2026-08-30" if y-m-d is a real calendar day, else ''. */
+function day(y, m, d) {
+    if (!(y >= 2000 && y <= 2099) || !(m >= 1 && m <= 12) || !(d >= 1 && d <= 31))
+        return '';
+    const t = new Date(Date.UTC(y, m - 1, d));
+    if (t.getUTCFullYear() !== y || t.getUTCMonth() !== m - 1 || t.getUTCDate() !== d)
+        return '';
+    return `${y}-${String(m).padStart(2, '0')}-${String(d).padStart(2, '0')}`;
+}
+/**
+ * Every calendar date a text states, in order of appearance. Four shapes:
+ * 2026-08-30 · 30/08/2026 (or - and .) · 30 de agosto de 2026 / 14-sep-2026 ·
+ * August 30, 2026. Two-digit years and bare "en agosto" are not dates.
+ */
+function datesInText(text) {
+    const found = [];
+    let m;
+    const iso = /(?<![\d\-])(20\d{2})[-/](\d{1,2})[-/](\d{1,2})(?![\d])/g;
+    while ((m = iso.exec(text))) {
+        const d = day(+m[1], +m[2], +m[3]);
+        if (d)
+            found.push({ at: m.index, day: d });
+    }
+    const numeric = /(?<![\d\-/.])(\d{1,2})([-/.])(\d{1,2})\2(20\d{2})(?![\d])/g;
+    while ((m = numeric.exec(text))) {
+        const dayFirst = day(+m[4], +m[3], +m[1]);
+        const monthFirst = day(+m[4], +m[1], +m[3]);
+        if (dayFirst && monthFirst && dayFirst !== monthFirst)
+            found.push({ at: m.index, day: dayFirst, alt: monthFirst });
+        else if (dayFirst || monthFirst)
+            found.push({ at: m.index, day: dayFirst || monthFirst });
+    }
+    const named = /(?<![\d])(\d{1,2})(?:º|\.)?[-\s]+(?:de\s+|of\s+)?([A-Za-zÀ-ÿ]{3,10})\.?,?[-\s]+(?:de\s+|del\s+)?(20\d{2})(?![\d])/g;
+    while ((m = named.exec(text))) {
+        const mes = MONTHS[plain(m[2])];
+        const d = mes ? day(+m[3], mes, +m[1]) : '';
+        if (d)
+            found.push({ at: m.index, day: d });
+    }
+    const english = /\b([A-Za-z]{3,9})\.?\s+(\d{1,2})(?:st|nd|rd|th)?,?\s+(20\d{2})(?![\d])/g;
+    while ((m = english.exec(text))) {
+        const mes = MONTHS[plain(m[1])];
+        const d = mes ? day(+m[3], mes, +m[2]) : '';
+        if (d)
+            found.push({ at: m.index, day: d });
+    }
+    return found.sort((a, b) => a.at - b.at).map(({ day: d, alt }) => (alt ? { day: d, alt } : { day: d }));
+}
+/**
+ * The day an undated entry was written, as far as its own text proves it.
+ *
+ * An entry cannot predate the latest past day it mentions, and entries are
+ * overwhelmingly written the day the thing happened — so the answer is the
+ * LATEST stated date inside [floor, ceiling]. `floor` is the neuron's
+ * `created`; `ceiling` is the day dating began on this brain (an entry
+ * written after that would carry a stamp), or today. Dates outside the window
+ * are deadlines, history or typos, not the day of writing. A numeric date
+ * that reads both ways counts only if exactly one reading fits the window.
+ * '' when the text proves nothing.
+ */
+function inferEntryDay(text, floor, ceiling) {
+    const lo = (floor || '').slice(0, 10);
+    const hi = (ceiling || '').slice(0, 10);
+    const fits = (d) => (!lo || d >= lo) && (!hi || d <= hi);
+    let best = '';
+    for (const f of datesInText(text)) {
+        const readings = [f.day, ...(f.alt ? [f.alt] : [])].filter(fits);
+        if (readings.length !== 1)
+            continue;
+        if (readings[0] > best)
+            best = readings[0];
+    }
+    return best;
+}
+/** True for a value written by the backfill (a day), false for a learn() stamp (an instant). */
+function isDayPrecision(value) {
+    return !!value && /^\d{4}-\d{2}-\d{2}$/.test(value);
+}
+//# sourceMappingURL=dates.js.map

package/dist/engine/dates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dates.js","sourceRoot":"","sources":["../../src/engine/dates.ts"],"names":[],"mappings":";AAAA,oEAAoE;AACpE,EAAE;AACF,+EAA+E;AAC/E,wEAAwE;AACxE,2EAA2E;AAC3E,oDAAoD;AACpD,EAAE;AACF,6EAA6E;AAC7E,4EAA4E;AAC5E,0EAA0E;AAC1E,8EAA8E;AAC9E,6EAA6E;AAC7E,6EAA6E;AAC7E,8CAA8C;AAC9C,EAAE;AACF,yEAAyE;AACzE,2EAA2E;AAC3E,6EAA6E;AAC7E,+DAA+D;;AAyC/D,kCAiCC;AAcD,sCAWC;AAGD,wCAEC;AAtGD,MAAM,MAAM,GAA2B,EAAE,CAAC;AAC1C,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,GAAG,KAAe,EAAE,EAAE,GAAG,KAAK,MAAM,CAAC,IAAI,KAAK;IAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACzF,6EAA6E;AAC7E,mFAAmF;AACnF,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;AACnG,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;AAC3F,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAClE,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;AACjE,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;AACtD,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AACzE,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AACpF,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AACxD,GAAG,CAAC,CAAC,EAAE,YAAY,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;AAC3G,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;AAC/F,GAAG,CAAC,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAChE,GAAG,CAAC,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAEtG,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AAExG,6DAA6D;AAC7D,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IAC1C,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAAE,OAAO,EAAE,CAAC;IACzF,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1C,IAAI,CAAC,CAAC,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC7F,OAAO,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;AAC5E,CAAC;AASD;;;;GAIG;AACH,SAAgB,WAAW,CAAC,IAAY;IACtC,MAAM,KAAK,GAAqC,EAAE,CAAC;IACnD,IAAI,CAAyB,CAAC;IAE9B,MAAM,GAAG,GAAG,yDAAyD,CAAC;IACtE,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,OAAO,GAAG,4DAA4D,CAAC;IAC7E,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,QAAQ,IAAI,UAAU,IAAI,QAAQ,KAAK,UAAU;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,CAAC;aAC9G,IAAI,QAAQ,IAAI,UAAU;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,IAAI,UAAU,EAAE,CAAC,CAAC;IAC5F,CAAC;IAED,MAAM,KAAK,GAAG,oHAAoH,CAAC;IACnI,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,OAAO,GAAG,yEAAyE,CAAC;IAC1F,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1G,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,aAAa,CAAC,IAAY,EAAE,KAAa,EAAE,OAAe;IACxE,MAAM,EAAE,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACtC,MAAM,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IACjE,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACpC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gGAAgG;AAChG,SAAgB,cAAc,CAAC,KAAyB;IACtD,OAAO,CAAC,CAAC,KAAK,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACtD,CAAC"}

package/dist/engine/maintenance.d.ts

@@ -32,8 +32,56 @@ export interface MaintenanceReport {
     repaired: number;
     /** One line per fix applied. */
     repairs: string[];
+    /** Patterns, preferences, errors and debts with no date: written before 1.13 stamped them. */
+    undated_entries: number;
+    /** How many of those state a date in their own text — what backfill_dates recovers. */
+    datable_entries: number;
+    /** Dates written by this run (0 unless backfill_dates:true and not a dry run). */
+    dates_backfilled: number;
+    /** Live entries that named a day still ahead of them when written, and that day has passed. */
+    expired_entries: number;
+    /** The longest-expired of them, to review: keep, crbro_revise, or crbro_learn supersedes. Never touched by maintenance. */
+    expired_sample: ExpiredEntry[];
+    /** Neurons past SPLIT_MIN_ENTRIES live entries, each with the groups its own words suggest. */
+    split_candidates: SplitCandidate[];
+    /** One-line neurons left by a bulk import, by the day they were created. compact:true folds each group into one digest neuron. */
+    compact_groups: CompactGroup[];
+    /** How many neurons those groups add up to. */
+    compactable_neurons: number;
+    /** Neurons folded by this run (0 unless compact:true and not a dry run). */
+    compacted_neurons: number;
     notes: string[];
 }
+export interface ExpiredEntry {
+    neuron_id: string;
+    entry_id: string;
+    kind: string;
+    /** When the entry was written. */
+    added: string;
+    /** The day it looked forward to, now behind us. */
+    due: string;
+    preview: string;
+}
+export interface SplitCandidate {
+    neuron_id: string;
+    name: string;
+    entries: number;
+    /** Words that gather a sizeable share of the entries without gathering all of them. */
+    groups: Array<{
+        term: string;
+        entries: number;
+    }>;
+}
+export interface CompactGroup {
+    day: string;
+    domain: string;
+    neurons: number;
+    /** Distinct texts among them: the rest are the same line under another name. */
+    unique_entries: number;
+    /** The digest neuron they fold into. */
+    digest: string;
+    sample: string[];
+}
 export declare class Maintenance {
     private brain;
     private cortex;
@@ -51,6 +99,9 @@ export declare class Maintenance {
         purgeBoilerplate?: boolean;
         repair?: boolean;
         unarchive?: string[] | 'all';
+        backfillDates?: boolean;
+        compact?: boolean;
+        sharedIds?: ReadonlySet<string>;
     }): Promise<MaintenanceReport>;
     /**
      * Consolidate session — called at end of session.
@@ -101,6 +152,40 @@ export declare class Maintenance {
      * fix blindly.
      */
     private checkIntegrity;
+    /**
+     * The signature of a bulk import, all of it required: exactly one live
+     * entry and nothing else (no map, no summary, no tags, no connections),
+     * not a protocol, not shared, older than COMPACT_MIN_AGE_DAYS, and born
+     * the same day in the same domain as at least COMPACT_MIN_GROUP others
+     * like it. A lone one-fact neuron is somebody's note and is never touched.
+     */
+    private findCompactGroups;
+    /**
+     * Two read-only reviews in one pass over the cortex.
+     *
+     * Expired: a live, dated entry whose text states a day LATER than the day
+     * it was written — so it was looking forward — and that day is now behind
+     * us. Language-independent on purpose: no list of "hasta / until / vence"
+     * to maintain, just two dates and today. An entry that only mentions past
+     * days is history, not a promise, and is never flagged. Undated entries
+     * cannot be judged and are skipped (backfill_dates first).
+     *
+     * Split: a neuron with SPLIT_MIN_ENTRIES+ live entries, with the words
+     * that gather between 8% and 45% of them — frequent enough to be a
+     * subtopic, not so frequent that they are just the neuron's own name.
+     */
+    private reviewEntries;
+    /**
+     * Count the undated patterns, preferences, errors and debts, and — when
+     * `write` — date the ones whose own text says when they happened.
+     *
+     * The ceiling is the first instant learn() ever stamped on this brain: an
+     * entry written after that would carry a stamp, so a later date in an
+     * undated entry is a deadline, not the day it was written. Day-precision
+     * values are skipped when looking for it — they are earlier backfills, and
+     * counting them would drag the ceiling back on every run.
+     */
+    private backfillDates;
     /**
      * Fix what checkIntegrity() reports: dangling connection ids, synapse files
      * with a missing end, stale entry_dates / entry_status keys, manifest

package/dist/engine/maintenance.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"maintenance.d.ts","sourceRoot":"","sources":["../../src/engine/maintenance.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAGvD,MAAM,WAAW,iBAAiB;IAChC,gBAAgB,EAAE,MAAM,CAAC;IACzB,+DAA+D;IAC/D,iBAAiB,EAAE,MAAM,CAAC;IAC1B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,wDAAwD;IACxD,iBAAiB,EAAE,MAAM,CAAC;IAC1B,kFAAkF;IAClF,kBAAkB,EAAE,MAAM,CAAC;IAC3B,eAAe,EAAE,MAAM,CAAC;IACxB,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,aAAa,EAAE,OAAO,CAAC;IACvB,iBAAiB,EAAE,OAAO,CAAC;IAC3B,mIAAmI;IACnI,WAAW,EAAE,MAAM,CAAC;IACpB,qBAAqB,EAAE,MAAM,CAAC;IAC9B,iDAAiD;IACjD,cAAc,EAAE,MAAM,CAAC;IACvB,kEAAkE;IAClE,kBAAkB,EAAE,MAAM,CAAC;IAC3B,sFAAsF;IACtF,UAAU,EAAE,MAAM,CAAC;IACnB,0EAA0E;IAC1E,QAAQ,EAAE,MAAM,CAAC;IACjB,gCAAgC;IAChC,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAWD,qBAAa,WAAW;IAEpB,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,MAAM;IACd,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,WAAW;IACnB,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,YAAY;gBANZ,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,QAAQ,EAClB,UAAU,EAAE,UAAU,EACtB,WAAW,EAAE,WAAW,EACxB,UAAU,EAAE,UAAU,EACtB,YAAY,EAAE,YAAY;IAGpC;;OAEG;IACG,GAAG,CACP,MAAM,GAAE,OAAe,EACvB,OAAO,CAAC,EAAE;QAAE,OAAO,CAAC,EAAE,OAAO,CAAC;QAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;QAAC,MAAM,CAAC,EAAE,OAAO,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,EAAE,GAAG,KAAK,CAAA;KAAE,GAC1G,OAAO,CAAC,iBAAiB,CAAC;IAiL7B;;OAEG;IACG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAC3C;;;;;;WAMG;QACH,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;KAC1B,GAAG,OAAO,CAAC;QACV,WAAW,EAAE,MAAM,CAAC;QACpB,eAAe,EAAE,MAAM,CAAC;QACxB,cAAc,EAAE,MAAM,CAAC;QACvB,aAAa,EAAE,MAAM,CAAC;QACtB,+EAA+E;QAC/E,gBAAgB,EAAE,MAAM,CAAC;QACzB,cAAc,EAAE,MAAM,CAAC;QACvB,cAAc,EAAE,OAAO,CAAC;QACxB,UAAU,EAAE,MAAM,CAAC;QACnB,yFAAyF;QACzF,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,kHAAkH;QAClH,aAAa,EAAE,MAAM,EAAE,CAAC;QACxB,8EAA8E;QAC9E,cAAc,EAAE,MAAM,EAAE,CAAC;KAC1B,CAAC;IAgGF,wEAAwE;IACxE,OAAO,CAAC,aAAa;YAIP,gBAAgB;YAUhB,gBAAgB;IAiB9B,iEAAiE;IACjE,OAAO,CAAC,MAAM;YAMA,kBAAkB;YAqBlB,gBAAgB;IAc9B;;;;OAIG;YACW,SAAS;IA8BvB;;;;OAIG;YACW,cAAc;IAoE5B;;;;OAIG;YACW,MAAM;CAkFrB"}
+{"version":3,"file":"maintenance.d.ts","sourceRoot":"","sources":["../../src/engine/maintenance.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAGvD,MAAM,WAAW,iBAAiB;IAChC,gBAAgB,EAAE,MAAM,CAAC;IACzB,+DAA+D;IAC/D,iBAAiB,EAAE,MAAM,CAAC;IAC1B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,wDAAwD;IACxD,iBAAiB,EAAE,MAAM,CAAC;IAC1B,kFAAkF;IAClF,kBAAkB,EAAE,MAAM,CAAC;IAC3B,eAAe,EAAE,MAAM,CAAC;IACxB,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,aAAa,EAAE,OAAO,CAAC;IACvB,iBAAiB,EAAE,OAAO,CAAC;IAC3B,mIAAmI;IACnI,WAAW,EAAE,MAAM,CAAC;IACpB,qBAAqB,EAAE,MAAM,CAAC;IAC9B,iDAAiD;IACjD,cAAc,EAAE,MAAM,CAAC;IACvB,kEAAkE;IAClE,kBAAkB,EAAE,MAAM,CAAC;IAC3B,sFAAsF;IACtF,UAAU,EAAE,MAAM,CAAC;IACnB,0EAA0E;IAC1E,QAAQ,EAAE,MAAM,CAAC;IACjB,gCAAgC;IAChC,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,8FAA8F;IAC9F,eAAe,EAAE,MAAM,CAAC;IACxB,uFAAuF;IACvF,eAAe,EAAE,MAAM,CAAC;IACxB,kFAAkF;IAClF,gBAAgB,EAAE,MAAM,CAAC;IACzB,+FAA+F;IAC/F,eAAe,EAAE,MAAM,CAAC;IACxB,2HAA2H;IAC3H,cAAc,EAAE,YAAY,EAAE,CAAC;IAC/B,+FAA+F;IAC/F,gBAAgB,EAAE,cAAc,EAAE,CAAC;IACnC,kIAAkI;IAClI,cAAc,EAAE,YAAY,EAAE,CAAC;IAC/B,+CAA+C;IAC/C,mBAAmB,EAAE,MAAM,CAAC;IAC5B,4EAA4E;IAC5E,iBAAiB,EAAE,MAAM,CAAC;IAC1B,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,kCAAkC;IAClC,KAAK,EAAE,MAAM,CAAC;IACd,mDAAmD;IACnD,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,uFAAuF;IACvF,MAAM,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAClD;AAED,MAAM,WAAW,YAAY;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,gFAAgF;IAChF,cAAc,EAAE,MAAM,CAAC;IACvB,wCAAwC;IACxC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAiCD,qBAAa,WAAW;IAEpB,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,MAAM;IACd,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,WAAW;IACnB,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,YAAY;gBANZ,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,QAAQ,EAClB,UAAU,EAAE,UAAU,EACtB,WAAW,EAAE,WAAW,EACxB,UAAU,EAAE,UAAU,EACtB,YAAY,EAAE,YAAY;IAGpC;;OAEG;IACG,GAAG,CACP,MAAM,GAAE,OAAe,EACvB,OAAO,CAAC,EAAE;QAAE,OAAO,CAAC,EAAE,OAAO,CAAC;QAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;QAAC,MAAM,CAAC,EAAE,OAAO,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;QAAC,aAAa,CAAC,EAAE,OAAO,CAAC;QAAC,OAAO,CAAC,EAAE,OAAO,CAAC;QAAC,SAAS,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAA;KAAE,GACvL,OAAO,CAAC,iBAAiB,CAAC;IAqP7B;;OAEG;IACG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAC3C;;;;;;WAMG;QACH,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;KAC1B,GAAG,OAAO,CAAC;QACV,WAAW,EAAE,MAAM,CAAC;QACpB,eAAe,EAAE,MAAM,CAAC;QACxB,cAAc,EAAE,MAAM,CAAC;QACvB,aAAa,EAAE,MAAM,CAAC;QACtB,+EAA+E;QAC/E,gBAAgB,EAAE,MAAM,CAAC;QACzB,cAAc,EAAE,MAAM,CAAC;QACvB,cAAc,EAAE,OAAO,CAAC;QACxB,UAAU,EAAE,MAAM,CAAC;QACnB,yFAAyF;QACzF,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,kHAAkH;QAClH,aAAa,EAAE,MAAM,EAAE,CAAC;QACxB,8EAA8E;QAC9E,cAAc,EAAE,MAAM,EAAE,CAAC;KAC1B,CAAC;IAgGF,wEAAwE;IACxE,OAAO,CAAC,aAAa;YAIP,gBAAgB;YAUhB,gBAAgB;IAiB9B,iEAAiE;IACjE,OAAO,CAAC,MAAM;YAMA,kBAAkB;YAqBlB,gBAAgB;IAc9B;;;;OAIG;YACW,SAAS;IA8BvB;;;;OAIG;YACW,cAAc;IAoE5B;;;;;;OAMG;YACW,iBAAiB;IAsC/B;;;;;;;;;;;;;OAaG;YACW,aAAa;IA8G3B;;;;;;;;;OASG;YACW,aAAa;IAkD3B;;;;OAIG;YACW,MAAM;CAkFrB"}

package/dist/engine/maintenance.js

@@ -6,6 +6,29 @@ exports.Maintenance = void 0;
 const fs_js_1 = require("../utils/fs.js");
 const lock_js_1 = require("../utils/lock.js");
 const ops_js_1 = require("../sync/ops.js");
+const dates_js_1 = require("./dates.js");
+const tokenize_js_1 = require("../search/tokenize.js");
+const hash_js_1 = require("../utils/hash.js");
+/**
+ * A bulk import, not a person: this many one-line neurons born the same day
+ * in the same domain. On the reference brain one day holds 766 of them — a
+ * transcript miner that made a neuron out of every checklist line — and 482
+ * repeat a text another one already has. Three of those with identical text
+ * took the top three places of a recall.
+ */
+const COMPACT_MIN_GROUP = 25;
+/** Young neurons are left alone: one entry today may be the start of a topic. */
+const COMPACT_MIN_AGE_DAYS = 30;
+/** A neuron this big no longer fits one read: crbro_inspect pages it, and every recall hit from it competes with 80 siblings. */
+const SPLIT_MIN_ENTRIES = 80;
+const SPLIT_MAX_CANDIDATES = 8;
+const SPLIT_GROUPS = 5;
+const EXPIRED_SAMPLE = 10;
+/** Too common to name a subtopic. Short on purpose: the share bounds below do most of the work. */
+const SPLIT_STOP = new Set(('para como pero este esta estos estas desde hasta entre sobre cuando donde porque tambien todos todas cada '
+    + 'tiene tienen hace hacer puede pueden debe deben usar solo antes despues ahora siempre nunca mismo misma nueva nuevo '
+    + 'with from that this those these when where which while into over under after before there their have does must should '
+    + 'only always never using used more than then also each both were been being').split(' '));
 /** Every text an entry_dates / entry_status key may legitimately point at. */
 function liveEntryKeys(n) {
     return new Set([
@@ -53,6 +76,15 @@ class Maintenance {
             repairable: 0,
             repaired: 0,
             repairs: [],
+            undated_entries: 0,
+            datable_entries: 0,
+            dates_backfilled: 0,
+            expired_entries: 0,
+            expired_sample: [],
+            split_candidates: [],
+            compact_groups: [],
+            compactable_neurons: 0,
+            compacted_neurons: 0,
             notes: [],
         };
         // 0. Bring neurons back from the archive, before anything else could
@@ -147,6 +179,58 @@ class Maintenance {
             report.notes.push(`${report.repairable} integrity issue(s) found. Pass repair:true to fix dangling connections, ` +
                 'orphan synapses, stale sidecar keys and manifest counters.');
         }
+        // 4c. Entries from before 1.13 have no date, so recall cannot say which of
+        // two tellings is the recent one. Counting is free; writing is opt-in, and
+        // only what the entry's own text proves is ever written (see dates.ts).
+        const fechas = await this.backfillDates(!!options?.backfillDates && !dryRun);
+        report.undated_entries = fechas.undated;
+        report.datable_entries = fechas.datable;
+        report.dates_backfilled = fechas.written;
+        if (fechas.written > 0) {
+            report.notes.push(`Dated ${fechas.written} entr${fechas.written === 1 ? 'y' : 'ies'} from the date stated in their own text, ` +
+                `to the day. ${fechas.undated - fechas.written} state none and stay undated: nothing was guessed.`);
+        }
+        else if (fechas.datable > 0) {
+            report.notes.push(`${fechas.undated} pattern/preference/error/debt entr${fechas.undated === 1 ? 'y has' : 'ies have'} no date ` +
+                `(written before 1.13); ${fechas.datable} state one in their own text. Pass backfill_dates:true to record it.`);
+        }
+        // 4e. What a bulk import left behind: hundreds of one-line neurons.
+        // Reported always; folded only when asked, and never in a dry run.
+        const grupos = await this.findCompactGroups(options?.sharedIds);
+        report.compact_groups = grupos.map(({ ids: _ids, type: _type, ...g }) => g);
+        report.compactable_neurons = grupos.reduce((a, g) => a + g.neurons, 0);
+        if (options?.compact && !dryRun) {
+            for (const g of grupos) {
+                const r = await this.cortex.compact(g.ids, g.digest, { type: g.type, domain: g.domain });
+                report.compacted_neurons += r.folded.length;
+            }
+            if (report.compacted_neurons > 0) {
+                report.notes.push(`Folded ${report.compacted_neurons} one-line neuron(s) into ${grupos.length} digest neuron(s) (tag "digest"); each source's name ` +
+                    'travels as the keys of its line, identical lines are kept once, and a copy of every source is in .quarantine ' +
+                    '(crbro_forget restore brings one back).');
+            }
+        }
+        else if (report.compactable_neurons > 0) {
+            report.notes.push(`${report.compactable_neurons} one-line neuron(s) were created in bulk (compact_groups: same day, same domain, no tags, ` +
+                'no links, never written again). They crowd recall — one result per neuron — with near-identical lines. ' +
+                'Pass compact:true to fold each group into one digest neuron; run dry_run first and read the samples.');
+        }
+        // 4d. What the brain still says as current although its own words put a
+        // date on it, and what has outgrown a single read. Read-only, both: what
+        // to do with a line is a judgement, and maintenance does not make it.
+        const revision = await this.reviewEntries();
+        report.expired_entries = revision.expired;
+        report.expired_sample = revision.sample;
+        report.split_candidates = revision.splits;
+        if (revision.expired > 0) {
+            report.notes.push(`${revision.expired} live entr${revision.expired === 1 ? 'y names' : 'ies name'} a day that was still ahead when written and has ` +
+                'since passed — a deadline, a "until", a planned step. expired_sample lists the oldest: confirm each is still true, ' +
+                'or retire it with crbro_revise / replace it with crbro_learn supersedes.');
+        }
+        if (revision.splits.length > 0) {
+            report.notes.push(`${revision.splits.length} neuron(s) hold ${SPLIT_MIN_ENTRIES}+ live entries (split_candidates, with the groups their own words suggest). ` +
+                'To split one: crbro_inspect view=neuron for the entry ids, then crbro_revise move_to — the entries keep their dates.');
+        }
         // The debt ledger: a deferral that never named its revisit condition is
         // on its way to becoming permanent by accident. Count them and say so —
         // "later" without a trigger means "never". Retired debts (entry_status)
@@ -457,6 +541,262 @@ class Maintenance {
         }
         return issues;
     }
+    /**
+     * The signature of a bulk import, all of it required: exactly one live
+     * entry and nothing else (no map, no summary, no tags, no connections),
+     * not a protocol, not shared, older than COMPACT_MIN_AGE_DAYS, and born
+     * the same day in the same domain as at least COMPACT_MIN_GROUP others
+     * like it. A lone one-fact neuron is somebody's note and is never touched.
+     */
+    async findCompactGroups(sharedIds) {
+        const limite = new Date(Date.now() - COMPACT_MIN_AGE_DAYS * 86_400_000).toISOString();
+        const porGrupo = new Map();
+        for (const id of await this.cortex.allIds()) {
+            let n;
+            try {
+                n = await (0, fs_js_1.readJSON)(this.brain.paths.neuron(id));
+            }
+            catch {
+                continue;
+            }
+            if (!n || n.type === 'protocol' || sharedIds?.has(n.id))
+                continue;
+            if (n.map?.text || n.summary || (n.tags || []).length || (n.connections || []).length)
+                continue;
+            if (!n.created || n.created > limite)
+                continue;
+            const entradas = (n.facts || []).length + (n.decisions || []).length + (n.patterns || []).length
+                + (n.preferences || []).length + (n.errors || []).length + (n.debts || []).length;
+            if (entradas !== 1 || (n.facts || []).length !== 1)
+                continue;
+            if (n.facts[0].status && n.facts[0].status !== 'active')
+                continue;
+            const k = `${n.created.slice(0, 10)}|${n.domain || 'general'}`;
+            const lista = porGrupo.get(k);
+            if (lista)
+                lista.push(n);
+            else
+                porGrupo.set(k, [n]);
+        }
+        const out = [];
+        for (const [k, lista] of porGrupo) {
+            if (lista.length < COMPACT_MIN_GROUP)
+                continue;
+            const [day, domain] = k.split('|');
+            lista.sort((a, b) => (a.id < b.id ? -1 : 1));
+            out.push({
+                day, domain, neurons: lista.length,
+                unique_entries: new Set(lista.map(n => n.facts[0].text.trim().toLowerCase())).size,
+                digest: `Imported notes ${day} (${domain})`,
+                sample: [0, Math.floor(lista.length / 2), lista.length - 1].map(i => `${lista[i].name}: ${lista[i].facts[0].text.slice(0, 80)}`),
+                ids: lista.map(n => n.id),
+                type: 'project',
+            });
+        }
+        return out.sort((a, b) => b.neurons - a.neurons);
+    }
+    /**
+     * Two read-only reviews in one pass over the cortex.
+     *
+     * Expired: a live, dated entry whose text states a day LATER than the day
+     * it was written — so it was looking forward — and that day is now behind
+     * us. Language-independent on purpose: no list of "hasta / until / vence"
+     * to maintain, just two dates and today. An entry that only mentions past
+     * days is history, not a promise, and is never flagged. Undated entries
+     * cannot be judged and are skipped (backfill_dates first).
+     *
+     * Split: a neuron with SPLIT_MIN_ENTRIES+ live entries, with the words
+     * that gather between 8% and 45% of them — frequent enough to be a
+     * subtopic, not so frequent that they are just the neuron's own name.
+     */
+    async reviewEntries() {
+        const hoy = (0, fs_js_1.today)();
+        const vencidas = [];
+        const gordas = [];
+        const enNeuronas = new Map();
+        const grandes = [];
+        let total = 0;
+        for (const id of await this.cortex.allIds()) {
+            let n;
+            try {
+                n = await (0, fs_js_1.readJSON)(this.brain.paths.neuron(id));
+            }
+            catch {
+                continue;
+            }
+            if (!n || n.type === 'protocol')
+                continue;
+            const retirada = (t) => !!n.entry_status?.[(0, ops_js_1.entryId)(t)];
+            const vivas = [];
+            for (const f of n.facts || []) {
+                if (!f?.text || (f.status && f.status !== 'active'))
+                    continue;
+                vivas.push({ eid: f.id || (0, hash_js_1.factId)(f.text), kind: 'fact', text: f.text, added: f.added || '' });
+            }
+            for (const d of n.decisions || []) {
+                if (!d?.text || retirada(d.text))
+                    continue;
+                vivas.push({ eid: d.id || (0, ops_js_1.entryId)(d.text), kind: 'decision', text: d.text, added: d.date || '' });
+            }
+            const sueltas = [
+                ['pattern', n.patterns], ['preference', n.preferences], ['error', n.errors], ['debt', n.debts],
+            ];
+            for (const [kind, lista] of sueltas) {
+                for (const t of lista || []) {
+                    if (!t || retirada(t))
+                        continue;
+                    vivas.push({ eid: (0, ops_js_1.entryId)(t), kind, text: t, added: n.entry_dates?.[(0, ops_js_1.entryId)(t)] || '' });
+                }
+            }
+            for (const e of vivas) {
+                const escrita = e.added.slice(0, 10);
+                if (!escrita)
+                    continue;
+                // Two days of margin, not one: stamps are UTC and people write local
+                // dates, so an entry saved at 00:30 on the 13th in Madrid is stamped
+                // the 12th and says "13/06". On the reference brain that alone was
+                // 250 of 277 flags — every one of them a false alarm.
+                const desde = new Date(Date.parse(escrita) + 2 * 86_400_000).toISOString().slice(0, 10);
+                let due = '';
+                for (const f of (0, dates_js_1.datesInText)(e.text)) {
+                    if (f.alt)
+                        continue; // reads two ways: not evidence of anything
+                    if (f.day >= desde && f.day < hoy && f.day > due)
+                        due = f.day;
+                }
+                if (!due)
+                    continue;
+                vencidas.push({
+                    neuron_id: n.id, entry_id: e.eid, kind: e.kind, added: escrita, due,
+                    preview: e.text.length > 160 ? `${e.text.slice(0, 160).trimEnd()}…` : e.text,
+                });
+            }
+            // Words per entry, once: they feed this neuron's groups and the
+            // brain-wide count that tells a subtopic from a habit of speech.
+            const propias = new Set((0, tokenize_js_1.fold)(n.name).split(/[^a-z0-9]+/).filter(Boolean));
+            const palabras = vivas.map(e => new Set((0, tokenize_js_1.fold)(e.text).split(/[^a-z0-9]+/).filter(w => w.length >= 5 && !SPLIT_STOP.has(w) && !/^\d+$/.test(w))));
+            total++;
+            for (const w of new Set(palabras.flatMap(set => [...set])))
+                enNeuronas.set(w, (enNeuronas.get(w) || 0) + 1);
+            if (vivas.length >= SPLIT_MIN_ENTRIES && !(n.tags || []).includes('digest')) {
+                grandes.push({ n, vivas: vivas.length, palabras, propias });
+            }
+        }
+        // A word found in many neurons is how this person writes ("verificado",
+        // "usuario"), not what this neuron is about. Measured on the reference
+        // brain, the top group of its largest neuron was "verificado (180)".
+        const comun = Math.max(10, Math.ceil(total * 0.04));
+        for (const { n, vivas, palabras, propias } of grandes) {
+            {
+                const donde = new Map();
+                palabras.forEach((set, i) => {
+                    for (const w of set) {
+                        if (propias.has(w) || (enNeuronas.get(w) || 0) > comun)
+                            continue;
+                        const d = donde.get(w);
+                        if (d)
+                            d.add(i);
+                        else
+                            donde.set(w, new Set([i]));
+                    }
+                });
+                const min = Math.ceil(vivas * 0.08), max = Math.floor(vivas * 0.45);
+                // Greedy, by size: a word joins only if most of its entries are not
+                // already gathered by a word chosen before it — otherwise the five
+                // groups are five names for the same one ("newsletter", "envio", ...).
+                const cubiertas = new Set();
+                const groups = [];
+                const orden = [...donde.entries()]
+                    .filter(([, set]) => set.size >= min && set.size <= max)
+                    .sort((a, b) => b[1].size - a[1].size || (a[0] < b[0] ? -1 : 1));
+                for (const [term, set] of orden) {
+                    if (groups.length >= SPLIT_GROUPS)
+                        break;
+                    let repetidas = 0;
+                    for (const i of set)
+                        if (cubiertas.has(i))
+                            repetidas++;
+                    if (repetidas > set.size / 2)
+                        continue;
+                    groups.push({ term, entries: set.size });
+                    for (const i of set)
+                        cubiertas.add(i);
+                }
+                gordas.push({ neuron_id: n.id, name: n.name, entries: vivas, groups });
+            }
+        }
+        vencidas.sort((a, b) => (a.due < b.due ? -1 : a.due > b.due ? 1 : a.entry_id < b.entry_id ? -1 : 1));
+        gordas.sort((a, b) => b.entries - a.entries);
+        return { expired: vencidas.length, sample: vencidas.slice(0, EXPIRED_SAMPLE), splits: gordas.slice(0, SPLIT_MAX_CANDIDATES) };
+    }
+    /**
+     * Count the undated patterns, preferences, errors and debts, and — when
+     * `write` — date the ones whose own text says when they happened.
+     *
+     * The ceiling is the first instant learn() ever stamped on this brain: an
+     * entry written after that would carry a stamp, so a later date in an
+     * undated entry is a deadline, not the day it was written. Day-precision
+     * values are skipped when looking for it — they are earlier backfills, and
+     * counting them would drag the ceiling back on every run.
+     */
+    async backfillDates(write) {
+        const KINDS = ['patterns', 'preferences', 'errors', 'debts'];
+        const ids = await this.cortex.allIds();
+        const neuronas = [];
+        let techo = '';
+        for (const id of ids) {
+            let n;
+            try {
+                n = await (0, fs_js_1.readJSON)(this.brain.paths.neuron(id));
+            }
+            catch {
+                continue; // corrupted: the integrity check reports it
+            }
+            if (!n)
+                continue;
+            neuronas.push(n);
+            for (const v of Object.values(n.entry_dates || {})) {
+                if (v && !(0, dates_js_1.isDayPrecision)(v) && (!techo || v < techo))
+                    techo = v;
+            }
+        }
+        if (!techo)
+            techo = (0, fs_js_1.today)();
+        let undated = 0, datable = 0, written = 0;
+        for (const n of neuronas) {
+            const nuevas = {};
+            for (const k of KINDS) {
+                for (const t of n[k] || []) {
+                    if (!t || n.entry_dates?.[(0, ops_js_1.entryId)(t)])
+                        continue;
+                    undated++;
+                    const dia = (0, dates_js_1.inferEntryDay)(t, n.created, techo);
+                    if (!dia)
+                        continue;
+                    datable++;
+                    nuevas[(0, ops_js_1.entryId)(t)] = dia;
+                }
+            }
+            if (!write || Object.keys(nuevas).length === 0)
+                continue;
+            await (0, fs_js_1.updateJSON)(this.brain.paths.neuron(n.id), current => {
+                if (!current)
+                    return null;
+                if (!current.entry_dates)
+                    current.entry_dates = {};
+                let tocado = false;
+                for (const [k, dia] of Object.entries(nuevas)) {
+                    if (current.entry_dates[k])
+                        continue; // stamped by someone else since the scan
+                    current.entry_dates[k] = dia;
+                    tocado = true;
+                    written++;
+                }
+                return tocado ? current : null;
+            });
+        }
+        return { undated, datable, written };
+    }
     /**
      * Fix what checkIntegrity() reports: dangling connection ids, synapse files
      * with a missing end, stale entry_dates / entry_status keys, manifest