@ashlr/hub 2.2.0

package/dist/core/genome/consolidate.d.ts

@@ -0,0 +1,38 @@
+/**
+ * consolidate.ts — Genome consolidation for M16.
+ *
+ * Merges near-duplicate hub entries (same project + normalized goal/title +
+ * high token-overlap) into single canonical entries that preserve provenance:
+ *   - mergedCount (how many source entries were folded in)
+ *   - firstTs / lastTs (time span)
+ *   - union of all tags
+ *   - longest/most-informative text retained
+ *
+ * GUARDRAILS:
+ *   - Writes a TIMESTAMPED BACKUP of hub.jsonl FIRST — no mutation before
+ *     the backup succeeds.
+ *   - NEVER drops information silently: merged entries retain their key content
+ *     via longest-text selection + tag union.
+ *   - Bounded: caps the comparison work to prevent O(n²) blow-up on huge stores.
+ *   - Never throws — all I/O is wrapped defensively.
+ *   - Append-only semantics preserved elsewhere; this is the ONE controlled
+ *     rewrite of the hub store, and it is always backup-gated.
+ */
+import type { AshlrConfig, ConsolidationResult } from '../types.js';
+/**
+ * Consolidate near-duplicate entries in hub.jsonl.
+ *
+ * Steps:
+ *   1. Read hub.jsonl entries.
+ *   2. Write a timestamped backup (FIRST — before any mutation).
+ *   3. Group entries: same [project × normalized-title] bucket first (cheap),
+ *      then token-overlap within each bucket (Jaccard ≥ OVERLAP_THRESHOLD).
+ *   4. Merge each group into a single canonical entry (longest text + union
+ *      tags + provenance fields: mergedCount, firstTs, lastTs).
+ *   5. Rewrite hub.jsonl with merged + un-merged entries.
+ *   6. Return { before, after, merged, backupPath }.
+ *
+ * Returns merged:0 / before===after when nothing to merge (backup still written).
+ * Never throws.
+ */
+export declare function consolidateGenome(_cfg: AshlrConfig): Promise<ConsolidationResult>;

package/dist/core/genome/consolidate.js

@@ -0,0 +1,426 @@
+/**
+ * consolidate.ts — Genome consolidation for M16.
+ *
+ * Merges near-duplicate hub entries (same project + normalized goal/title +
+ * high token-overlap) into single canonical entries that preserve provenance:
+ *   - mergedCount (how many source entries were folded in)
+ *   - firstTs / lastTs (time span)
+ *   - union of all tags
+ *   - longest/most-informative text retained
+ *
+ * GUARDRAILS:
+ *   - Writes a TIMESTAMPED BACKUP of hub.jsonl FIRST — no mutation before
+ *     the backup succeeds.
+ *   - NEVER drops information silently: merged entries retain their key content
+ *     via longest-text selection + tag union.
+ *   - Bounded: caps the comparison work to prevent O(n²) blow-up on huge stores.
+ *   - Never throws — all I/O is wrapped defensively.
+ *   - Append-only semantics preserved elsewhere; this is the ONE controlled
+ *     rewrite of the hub store, and it is always backup-gated.
+ */
+import fs from 'node:fs';
+import { hubStorePath } from './store.js';
+// ---------------------------------------------------------------------------
+// Constants
+// ---------------------------------------------------------------------------
+/** Maximum number of entries to load from hub.jsonl for consolidation. */
+const CONSOLIDATE_MAX_ENTRIES = 2000;
+/**
+ * Token-overlap (Jaccard) ratio threshold above which two entries are
+ * considered near-duplicates. 0.5 = 50% shared tokens.
+ */
+const OVERLAP_THRESHOLD = 0.5;
+/**
+ * Maximum number of pairwise comparisons to cap O(n²) work.
+ * At 2000 entries, naïve pairs = 2M; we short-circuit at this budget.
+ */
+const MAX_COMPARISONS = 200_000;
+// ---------------------------------------------------------------------------
+// Tokenization (reuse the same approach as recall.ts for consistency)
+// ---------------------------------------------------------------------------
+/** Tokenize text: lowercase, split on non-alphanumeric, drop empties. */
+function tokenize(text) {
+    return text
+        .toLowerCase()
+        .split(/[^a-z0-9]+/)
+        .filter((t) => t.length > 1); // drop single-char tokens to reduce noise
+}
+/** Build a Set of tokens from concatenated title + text for an entry. */
+function entryTokenSet(entry) {
+    return new Set(tokenize(`${entry.title} ${entry.text}`));
+}
+/**
+ * Jaccard similarity between two token sets.
+ * Returns 0..1 (0 = disjoint, 1 = identical token sets).
+ */
+function jaccardSimilarity(a, b) {
+    if (a.size === 0 && b.size === 0)
+        return 1; // both empty = identical
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let intersectionSize = 0;
+    // Iterate smaller set for efficiency
+    const [smaller, larger] = a.size <= b.size ? [a, b] : [b, a];
+    for (const token of smaller) {
+        if (larger.has(token))
+            intersectionSize++;
+    }
+    const unionSize = a.size + b.size - intersectionSize;
+    return unionSize === 0 ? 0 : intersectionSize / unionSize;
+}
+// ---------------------------------------------------------------------------
+// Normalization helpers
+// ---------------------------------------------------------------------------
+/**
+ * Normalize a title/goal string for grouping:
+ * lowercase, collapse whitespace, strip common filler words.
+ */
+function normalizeTitle(title) {
+    return title
+        .toLowerCase()
+        .replace(/[^a-z0-9\s]+/g, ' ')
+        .replace(/\s+/g, ' ')
+        .trim();
+}
+/** Normalize project key (null → '' for grouping). */
+function projectKey(project) {
+    return (project ?? '').toLowerCase().trim();
+}
+// ---------------------------------------------------------------------------
+// Hub JSONL I/O helpers
+// ---------------------------------------------------------------------------
+/** JSON.parse that returns null on any error. */
+function safeParseJson(text) {
+    try {
+        return JSON.parse(text);
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Load hub entries directly from hub.jsonl.
+ *
+ * Parses and field-validates up to CONSOLIDATE_MAX_ENTRIES objects for merging.
+ * Every other non-empty line (parse failures, missing-field lines, and any
+ * lines beyond the merge cap) is captured verbatim in `preservedLines` so the
+ * caller can round-trip them back into the rewritten store without loss.
+ */
+function loadHubRaw(storePath) {
+    const entries = [];
+    const preservedLines = [];
+    try {
+        if (!fs.existsSync(storePath))
+            return { entries, preservedLines };
+        const raw = fs.readFileSync(storePath, 'utf8');
+        for (const line of raw.split('\n')) {
+            const trimmed = line.trim();
+            if (!trimmed)
+                continue;
+            // Beyond the merge cap: preserve verbatim, do NOT parse/merge.
+            if (entries.length >= CONSOLIDATE_MAX_ENTRIES) {
+                preservedLines.push(trimmed);
+                continue;
+            }
+            const parsed = safeParseJson(trimmed);
+            if (typeof parsed !== 'object' || parsed === null) {
+                // Unparseable (or non-object) line — preserve verbatim.
+                preservedLines.push(trimmed);
+                continue;
+            }
+            const obj = parsed;
+            // Must have minimum required fields to take part in merging.
+            if (typeof obj['id'] !== 'string' ||
+                typeof obj['title'] !== 'string' ||
+                typeof obj['text'] !== 'string' ||
+                typeof obj['ts'] !== 'string') {
+                // Valid JSON but unknown/partial schema — preserve verbatim.
+                preservedLines.push(trimmed);
+                continue;
+            }
+            entries.push(obj);
+        }
+    }
+    catch {
+        // Return whatever was accumulated so far.
+    }
+    return { entries, preservedLines };
+}
+/** Cast a raw hub object to GenomeEntry (defensively). */
+function rawToEntry(obj) {
+    return {
+        id: obj['id'],
+        project: typeof obj['project'] === 'string' ? obj['project'] : null,
+        source: 'hub',
+        title: obj['title'],
+        text: obj['text'],
+        tags: Array.isArray(obj['tags'])
+            ? obj['tags'].filter((t) => typeof t === 'string')
+            : [],
+        ts: obj['ts'],
+    };
+}
+/**
+ * Merge a group of raw hub objects into one canonical MergedHubEntry.
+ *
+ * Strategy:
+ *   - Canonical entry = member with the LONGEST text (most informative).
+ *   - tags = union of all member tags, sorted and deduped.
+ *   - firstTs = earliest ts across members.
+ *   - lastTs = latest ts across members.
+ *   - mergedCount = total members in this group.
+ *   - id, title, project, source carried from the canonical member.
+ */
+function mergeGroup(group) {
+    // Pick the longest-text member as the canonical base.
+    let canonical = group[0];
+    let maxLen = typeof canonical['text'] === 'string' ? canonical['text'].length : 0;
+    for (let i = 1; i < group.length; i++) {
+        const len = typeof group[i]['text'] === 'string' ? group[i]['text'].length : 0;
+        if (len > maxLen) {
+            maxLen = len;
+            canonical = group[i];
+        }
+    }
+    // Collect union tags
+    const tagSet = new Set();
+    for (const member of group) {
+        if (Array.isArray(member['tags'])) {
+            for (const t of member['tags']) {
+                if (typeof t === 'string' && t.trim())
+                    tagSet.add(t.trim());
+            }
+        }
+    }
+    // Collect timestamps
+    const timestamps = group
+        .map((m) => (typeof m['ts'] === 'string' ? m['ts'] : ''))
+        .filter(Boolean)
+        .sort();
+    const firstTs = timestamps[0] ?? canonical['ts'];
+    const lastTs = timestamps[timestamps.length - 1] ?? canonical['ts'];
+    const tags = Array.from(tagSet).sort();
+    return {
+        // Spread all fields from canonical first so no extended fields are lost.
+        ...canonical,
+        // Then overwrite with our computed/merged values.
+        id: canonical['id'],
+        project: typeof canonical['project'] === 'string' ? canonical['project'] : null,
+        source: 'hub',
+        title: canonical['title'],
+        text: canonical['text'],
+        tags,
+        ts: lastTs, // canonical ts = most recent (for sort/display purposes)
+        mergedCount: group.length,
+        firstTs,
+        lastTs,
+    };
+}
+// ---------------------------------------------------------------------------
+// Union-Find for grouping
+// ---------------------------------------------------------------------------
+/** Simple Union-Find to cluster near-duplicate entries. */
+class UnionFind {
+    parent;
+    rank;
+    constructor(n) {
+        this.parent = Array.from({ length: n }, (_, i) => i);
+        this.rank = new Array(n).fill(0);
+    }
+    find(x) {
+        while (this.parent[x] !== x) {
+            this.parent[x] = this.parent[this.parent[x]]; // path compression
+            x = this.parent[x];
+        }
+        return x;
+    }
+    union(x, y) {
+        const rx = this.find(x);
+        const ry = this.find(y);
+        if (rx === ry)
+            return;
+        if (this.rank[rx] < this.rank[ry]) {
+            this.parent[rx] = ry;
+        }
+        else if (this.rank[rx] > this.rank[ry]) {
+            this.parent[ry] = rx;
+        }
+        else {
+            this.parent[ry] = rx;
+            this.rank[rx]++;
+        }
+    }
+}
+// ---------------------------------------------------------------------------
+// Main export
+// ---------------------------------------------------------------------------
+/**
+ * Consolidate near-duplicate entries in hub.jsonl.
+ *
+ * Steps:
+ *   1. Read hub.jsonl entries.
+ *   2. Write a timestamped backup (FIRST — before any mutation).
+ *   3. Group entries: same [project × normalized-title] bucket first (cheap),
+ *      then token-overlap within each bucket (Jaccard ≥ OVERLAP_THRESHOLD).
+ *   4. Merge each group into a single canonical entry (longest text + union
+ *      tags + provenance fields: mergedCount, firstTs, lastTs).
+ *   5. Rewrite hub.jsonl with merged + un-merged entries.
+ *   6. Return { before, after, merged, backupPath }.
+ *
+ * Returns merged:0 / before===after when nothing to merge (backup still written).
+ * Never throws.
+ */
+export async function consolidateGenome(_cfg) {
+    const storePath = hubStorePath();
+    // ISO-safe timestamp for the backup suffix (colons replaced with dashes)
+    const tsSuffix = new Date().toISOString().replace(/[:.]/g, '-');
+    const backupPath = `${storePath}.bak-${tsSuffix}`;
+    // Fallback result in case of early error
+    const fallback = (before) => ({
+        before,
+        after: before,
+        merged: 0,
+        backupPath,
+    });
+    let rawEntries = [];
+    let preservedLines = [];
+    try {
+        const loaded = loadHubRaw(storePath);
+        rawEntries = loaded.entries;
+        preservedLines = loaded.preservedLines;
+    }
+    catch {
+        return fallback(0);
+    }
+    // `before` counts EVERY non-empty line in the store (mergeable entries plus
+    // preserved lines), so the rewrite can never report fewer lines than existed.
+    const before = rawEntries.length + preservedLines.length;
+    // Step 2: Write backup FIRST before any mutation.
+    // If the store doesn't exist yet, there is nothing to back up or consolidate.
+    if (before === 0) {
+        return { before: 0, after: 0, merged: 0, backupPath };
+    }
+    try {
+        // Read raw bytes to preserve any lines we skipped during parsing (malformed, etc.)
+        const rawBytes = fs.existsSync(storePath) ? fs.readFileSync(storePath) : Buffer.alloc(0);
+        fs.writeFileSync(backupPath, rawBytes);
+    }
+    catch {
+        // Cannot write backup — abort to protect NO DATA LOSS guarantee.
+        return fallback(before);
+    }
+    // Step 3: Build groups via Union-Find.
+    // Phase A: cheap bucket by [projectKey × normalizedTitle]
+    const buckets = new Map();
+    for (let i = 0; i < rawEntries.length; i++) {
+        const entry = rawEntries[i];
+        const proj = projectKey(typeof entry['project'] === 'string' ? entry['project'] : null);
+        const title = normalizeTitle(typeof entry['title'] === 'string' ? entry['title'] : '');
+        const bucketKey = `${proj}\x00${title}`;
+        const bucket = buckets.get(bucketKey);
+        if (bucket) {
+            bucket.push(i);
+        }
+        else {
+            buckets.set(bucketKey, [i]);
+        }
+    }
+    // Phase B: token-overlap within each bucket (bounded comparisons)
+    const uf = new UnionFind(rawEntries.length);
+    // Pre-compute token sets once
+    const tokenSets = rawEntries.map((obj) => {
+        try {
+            return entryTokenSet(rawToEntry(obj));
+        }
+        catch {
+            return null;
+        }
+    });
+    let comparisons = 0;
+    for (const indices of buckets.values()) {
+        if (indices.length < 2)
+            continue; // singleton bucket — nothing to compare
+        for (let a = 0; a < indices.length - 1; a++) {
+            for (let b = a + 1; b < indices.length; b++) {
+                if (comparisons >= MAX_COMPARISONS)
+                    break;
+                comparisons++;
+                const ia = indices[a];
+                const ib = indices[b];
+                const sa = tokenSets[ia];
+                const sb = tokenSets[ib];
+                if (!sa || !sb)
+                    continue;
+                const sim = jaccardSimilarity(sa, sb);
+                if (sim >= OVERLAP_THRESHOLD) {
+                    uf.union(ia, ib);
+                }
+            }
+            if (comparisons >= MAX_COMPARISONS)
+                break;
+        }
+    }
+    // Step 4: Collect groups by their Union-Find root.
+    const groups = new Map();
+    for (let i = 0; i < rawEntries.length; i++) {
+        const root = uf.find(i);
+        const group = groups.get(root);
+        if (group) {
+            group.push(i);
+        }
+        else {
+            groups.set(root, [i]);
+        }
+    }
+    // Step 5: Build output entries.
+    const outputEntries = [];
+    let mergedCount = 0;
+    for (const [, memberIndices] of groups) {
+        if (memberIndices.length === 1) {
+            // No merge needed — preserve as-is (do NOT overwrite with MergedHubEntry shape).
+            outputEntries.push(rawEntries[memberIndices[0]]);
+        }
+        else {
+            // Multiple entries in this group — merge them.
+            const group = memberIndices.map((i) => rawEntries[i]);
+            const merged = mergeGroup(group);
+            outputEntries.push(merged);
+            // mergedCount tracks how many entries were folded AWAY (group.length - 1 survivals = 1).
+            mergedCount += group.length - 1;
+        }
+    }
+    // `after` counts the merged/unmerged entries PLUS every preserved line that
+    // was carried through untouched — so the rewritten store never has fewer
+    // lines than `before` minus the entries actually folded away by merging.
+    const after = outputEntries.length + preservedLines.length;
+    // Step 6: Rewrite hub.jsonl with merged entries.
+    // Preserve insertion order (sort by ts ascending so the file is chronological).
+    outputEntries.sort((a, b) => {
+        const ta = typeof a['ts'] === 'string' ? a['ts'] : '';
+        const tb = typeof b['ts'] === 'string' ? b['ts'] : '';
+        if (ta < tb)
+            return -1;
+        if (ta > tb)
+            return 1;
+        return 0;
+    });
+    try {
+        // Re-emit preserved (un-parseable / unknown-schema / over-cap) lines
+        // verbatim so consolidation never removes a line it could not merge.
+        const mergedLines = outputEntries.map((e) => JSON.stringify(e));
+        const allLines = [...mergedLines, ...preservedLines];
+        const lines = allLines.join('\n') + '\n';
+        // Write to a temp file first, then atomically rename to avoid partial-write corruption.
+        const tmpPath = `${storePath}.tmp-${tsSuffix}`;
+        fs.writeFileSync(tmpPath, lines, 'utf8');
+        fs.renameSync(tmpPath, storePath);
+    }
+    catch {
+        // Rewrite failed — the backup is intact; hub.jsonl is unchanged (or may
+        // be partially written to the temp path which is separate).
+        // Return a result indicating no change so callers know consolidation didn't apply.
+        return fallback(before);
+    }
+    return { before, after, merged: mergedCount, backupPath };
+}
+//# sourceMappingURL=consolidate.js.map

package/dist/core/genome/consolidate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidate.js","sourceRoot":"","sources":["../../../src/core/genome/consolidate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,MAAM,SAAS,CAAC;AAEzB,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE1C,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,0EAA0E;AAC1E,MAAM,uBAAuB,GAAG,IAAI,CAAC;AAErC;;;GAGG;AACH,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B;;;GAGG;AACH,MAAM,eAAe,GAAG,OAAO,CAAC;AAEhC,8EAA8E;AAC9E,sEAAsE;AACtE,8EAA8E;AAE9E,yEAAyE;AACzE,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,IAAI;SACR,WAAW,EAAE;SACb,KAAK,CAAC,YAAY,CAAC;SACnB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,0CAA0C;AAC5E,CAAC;AAED,yEAAyE;AACzE,SAAS,aAAa,CAAC,KAAkB;IACvC,OAAO,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,CAAc,EAAE,CAAc;IACvD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC,yBAAyB;IACrE,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE3C,IAAI,gBAAgB,GAAG,CAAC,CAAC;IACzB,qCAAqC;IACrC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7D,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,gBAAgB,EAAE,CAAC;IAC5C,CAAC;IACD,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,gBAAgB,CAAC;IACrD,OAAO,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB,GAAG,SAAS,CAAC;AAC5D,CAAC;AAED,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E;;;GAGG;AACH,SAAS,cAAc,CAAC,KAAa;IACnC,OAAO,KAAK;SACT,WAAW,EAAE;SACb,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC;SAC7B,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED,sDAAsD;AACtD,SAAS,UAAU,CAAC,OAAsB;IACxC,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;AAC9C,CAAC;AAED,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E,iDAAiD;AACjD,SAAS,aAAa,CAAC,IAAY;IACjC,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAY,CAAC;IACrC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAoBD;;;;;;;GAOG;AACH,SAAS,UAAU,CAAC,SAAiB;IACnC,MAAM,OAAO,GAAmC,EAAE,CAAC;IACnD,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,IAAI,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC;YAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC;QAClE,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO;gBAAE,SAAS;YAEvB,+DAA+D;YAC/D,IAAI,OAAO,CAAC,MAAM,IAAI,uBAAuB,EAAE,CAAC;gBAC9C,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC7B,SAAS;YACX,CAAC;YAED,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBAClD,wDAAwD;gBACxD,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC7B,SAAS;YACX,CAAC;YACD,MAAM,GAAG,GAAG,MAAiC,CAAC;YAC9C,6DAA6D;YAC7D,IACE,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,QAAQ;gBAC7B,OAAO,GAAG,CAAC,OAAO,CAAC,KAAK,QAAQ;gBAChC,OAAO,GAAG,CAAC,MAAM,CAAC,KAAK,QAAQ;gBAC/B,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,QAAQ,EAC7B,CAAC;gBACD,6DAA6D;gBAC7D,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC7B,SAAS;YACX,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,0CAA0C;IAC5C,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC;AACrC,CAAC;AAED,0DAA0D;AAC1D,SAAS,UAAU,CAAC,GAA4B;IAC9C,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,IAAI,CAAW;QACvB,OAAO,EAAE,OAAO,GAAG,CAAC,SAAS,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI;QACnE,MAAM,EAAE,KAAK;QACb,KAAK,EAAE,GAAG,CAAC,OAAO,CAAW;QAC7B,IAAI,EAAE,GAAG,CAAC,MAAM,CAAW;QAC3B,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9B,CAAC,CAAE,GAAG,CAAC,MAAM,CAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;YAC9E,CAAC,CAAC,EAAE;QACN,EAAE,EAAE,GAAG,CAAC,IAAI,CAAW;KACxB,CAAC;AACJ,CAAC;AA2BD;;;;;;;;;;GAUG;AACH,SAAS,UAAU,CAAC,KAAqC;IACvD,sDAAsD;IACtD,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,MAAM,GAAG,OAAO,SAAS,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3F,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,GAAG,CAAC;YACb,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YAClC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAc,EAAE,CAAC;gBAC5C,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,EAAE;oBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,MAAM,UAAU,GAAa,KAAK;SAC/B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC,IAAI,CAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACpE,MAAM,CAAC,OAAO,CAAC;SACf,IAAI,EAAE,CAAC;IAEV,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,IAAK,SAAS,CAAC,IAAI,CAAY,CAAC;IAC7D,MAAM,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,IAAK,SAAS,CAAC,IAAI,CAAY,CAAC;IAEhF,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IAEvC,OAAO;QACL,yEAAyE;QACzE,GAAG,SAAS;QACZ,kDAAkD;QAClD,EAAE,EAAE,SAAS,CAAC,IAAI,CAAW;QAC7B,OAAO,EAAE,OAAO,SAAS,CAAC,SAAS,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI;QAC/E,MAAM,EAAE,KAAK;QACb,KAAK,EAAE,SAAS,CAAC,OAAO,CAAW;QACnC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAW;QACjC,IAAI;QACJ,EAAE,EAAE,MAAM,EAAE,yDAAyD;QACrE,WAAW,EAAE,KAAK,CAAC,MAAM;QACzB,OAAO;QACP,MAAM;KACP,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,0BAA0B;AAC1B,8EAA8E;AAE9E,2DAA2D;AAC3D,MAAM,SAAS;IACL,MAAM,CAAW;IACjB,IAAI,CAAW;IAEvB,YAAY,CAAS;QACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAa,CAAC;IAC/C,CAAC;IAED,IAAI,CAAC,CAAS;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB;YACjE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,KAAK,CAAC,CAAS,EAAE,CAAS;QACxB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO;QACtB,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QACvB,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;QAClB,CAAC;IACH,CAAC;CACF;AAED,8EAA8E;AAC9E,cAAc;AACd,8EAA8E;AAE9E;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,IAAiB;IACvD,MAAM,SAAS,GAAG,YAAY,EAAE,CAAC;IACjC,yEAAyE;IACzE,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAChE,MAAM,UAAU,GAAG,GAAG,SAAS,QAAQ,QAAQ,EAAE,CAAC;IAElD,yCAAyC;IACzC,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAuB,EAAE,CAAC,CAAC;QACzD,MAAM;QACN,KAAK,EAAE,MAAM;QACb,MAAM,EAAE,CAAC;QACT,UAAU;KACX,CAAC,CAAC;IAEH,IAAI,UAAU,GAAmC,EAAE,CAAC;IACpD,IAAI,cAAc,GAAa,EAAE,CAAC;IAElC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;QACrC,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC;QAC5B,cAAc,GAAG,MAAM,CAAC,cAAc,CAAC;IACzC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,4EAA4E;IAC5E,8EAA8E;IAC9E,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC;IAEzD,kDAAkD;IAClD,8EAA8E;IAC9E,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;QACjB,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC;IACxD,CAAC;IAED,IAAI,CAAC;QACH,mFAAmF;QACnF,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzF,EAAE,CAAC,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IACzC,CAAC;IAAC,MAAM,CAAC;QACP,iEAAiE;QACjE,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED,uCAAuC;IACvC,0DAA0D;IAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACxF,MAAM,KAAK,GAAG,cAAc,CAAC,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,KAAK,CAAC,OAAO,CAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnG,MAAM,SAAS,GAAG,GAAG,IAAI,OAAO,KAAK,EAAE,CAAC;QACxC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC5C,8BAA8B;IAC9B,MAAM,SAAS,GAA8B,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAClE,IAAI,CAAC;YACH,OAAO,aAAa,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACvC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS,CAAC,wCAAwC;QAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,WAAW,IAAI,eAAe;oBAAE,MAAM;gBAC1C,WAAW,EAAE,CAAC;gBACd,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACtB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACtB,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;gBACzB,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;gBACzB,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;oBAAE,SAAS;gBACzB,MAAM,GAAG,GAAG,iBAAiB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACtC,IAAI,GAAG,IAAI,iBAAiB,EAAE,CAAC;oBAC7B,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;YACD,IAAI,WAAW,IAAI,eAAe;gBAAE,MAAM;QAC5C,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,MAAM,aAAa,GAAmC,EAAE,CAAC;IACzD,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,CAAC,EAAE,aAAa,CAAC,IAAI,MAAM,EAAE,CAAC;QACvC,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,iFAAiF;YACjF,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC;aAAM,CAAC;YACN,+CAA+C;YAC/C,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;YACjC,aAAa,CAAC,IAAI,CAAC,MAA4C,CAAC,CAAC;YACjE,yFAAyF;YACzF,WAAW,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,yEAAyE;IACzE,yEAAyE;IACzE,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC;IAE3D,iDAAiD;IACjD,gFAAgF;IAChF,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC,IAAI,CAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC,IAAI,CAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,IAAI,EAAE,GAAG,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC;QACvB,IAAI,EAAE,GAAG,EAAE;YAAE,OAAO,CAAC,CAAC;QACtB,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC;QACH,qEAAqE;QACrE,qEAAqE;QACrE,MAAM,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,QAAQ,GAAG,CAAC,GAAG,WAAW,EAAE,GAAG,cAAc,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACzC,wFAAwF;QACxF,MAAM,OAAO,GAAG,GAAG,SAAS,QAAQ,QAAQ,EAAE,CAAC;QAC/C,EAAE,CAAC,aAAa,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACzC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IACpC,CAAC;IAAC,MAAM,CAAC;QACP,wEAAwE;QACxE,4DAA4D;QAC5D,mFAAmF;QACnF,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC;AAC5D,CAAC"}

package/dist/core/genome/export.d.ts

@@ -0,0 +1,29 @@
+/**
+ * export.ts — Genome export for M16 (no lock-in).
+ *
+ * Loads the full aggregated genome and writes it to a destination file as
+ * either portable JSON (array of GenomeEntry) or Markdown (one section per
+ * entry). READ-ONLY on the genome — never mutates hub.jsonl or any source.
+ *
+ * GUARDRAILS:
+ *  - Read-only: genome sources are never modified.
+ *  - Never throws: all errors are caught; ok:false returned on failure.
+ *  - No lock-in: JSON output is a plain array; Markdown is human-readable.
+ *  - Local-only: no network calls; no new runtime deps.
+ */
+import type { AshlrConfig } from '../types.js';
+/**
+ * Export the full aggregated genome to `dest` in the requested format.
+ *
+ * - `'json'`: pretty-printed JSON array of GenomeEntry objects.
+ * - `'md'`:   Markdown document with one section per entry.
+ *
+ * Creates the destination directory if it does not exist.
+ * Returns `{ ok: true, count, path }` on success.
+ * Returns `{ ok: false, count: 0, path: dest }` on any error — never throws.
+ */
+export declare function exportGenome(cfg: AshlrConfig, dest: string, format: 'json' | 'md'): {
+    ok: boolean;
+    count: number;
+    path: string;
+};

package/dist/core/genome/export.js

@@ -0,0 +1,102 @@
+/**
+ * export.ts — Genome export for M16 (no lock-in).
+ *
+ * Loads the full aggregated genome and writes it to a destination file as
+ * either portable JSON (array of GenomeEntry) or Markdown (one section per
+ * entry). READ-ONLY on the genome — never mutates hub.jsonl or any source.
+ *
+ * GUARDRAILS:
+ *  - Read-only: genome sources are never modified.
+ *  - Never throws: all errors are caught; ok:false returned on failure.
+ *  - No lock-in: JSON output is a plain array; Markdown is human-readable.
+ *  - Local-only: no network calls; no new runtime deps.
+ */
+import fs from 'node:fs';
+import path from 'node:path';
+import { loadGenome } from './store.js';
+// ---------------------------------------------------------------------------
+// Markdown rendering
+// ---------------------------------------------------------------------------
+/**
+ * Render a single GenomeEntry as a Markdown section.
+ *
+ * Format:
+ *   ## <title>
+ *
+ *   **Project:** <project>  **Tags:** tag1, tag2  **Date:** <ts>
+ *
+ *   <text>
+ *
+ *   ---
+ */
+function entryToMarkdown(entry) {
+    const lines = [];
+    lines.push(`## ${entry.title}`);
+    lines.push('');
+    const meta = [];
+    if (entry.project)
+        meta.push(`**Project:** ${entry.project}`);
+    if (entry.tags.length > 0)
+        meta.push(`**Tags:** ${entry.tags.join(', ')}`);
+    meta.push(`**Date:** ${entry.ts}`);
+    meta.push(`**Source:** ${entry.source}`);
+    lines.push(meta.join('  '));
+    lines.push('');
+    lines.push(entry.text);
+    lines.push('');
+    lines.push('---');
+    lines.push('');
+    return lines.join('\n');
+}
+/**
+ * Render all entries as a Markdown document.
+ */
+function entriesToMarkdown(entries) {
+    const header = [
+        '# Genome Export',
+        '',
+        `Exported ${entries.length} entr${entries.length === 1 ? 'y' : 'ies'} from the ashlr genome.`,
+        '',
+        '---',
+        '',
+    ].join('\n');
+    return header + entries.map(entryToMarkdown).join('');
+}
+// ---------------------------------------------------------------------------
+// Public: exportGenome
+// ---------------------------------------------------------------------------
+/**
+ * Export the full aggregated genome to `dest` in the requested format.
+ *
+ * - `'json'`: pretty-printed JSON array of GenomeEntry objects.
+ * - `'md'`:   Markdown document with one section per entry.
+ *
+ * Creates the destination directory if it does not exist.
+ * Returns `{ ok: true, count, path }` on success.
+ * Returns `{ ok: false, count: 0, path: dest }` on any error — never throws.
+ */
+export function exportGenome(cfg, dest, format) {
+    const absPath = path.resolve(dest);
+    try {
+        // Load the genome (never throws).
+        const entries = loadGenome(cfg);
+        // Ensure destination directory exists.
+        const dir = path.dirname(absPath);
+        fs.mkdirSync(dir, { recursive: true });
+        // Render output.
+        let content;
+        if (format === 'json') {
+            content = JSON.stringify(entries, null, 2) + '\n';
+        }
+        else {
+            content = entriesToMarkdown(entries);
+        }
+        // Write (overwrite if exists — this is an export, not an append).
+        fs.writeFileSync(absPath, content, 'utf8');
+        return { ok: true, count: entries.length, path: absPath };
+    }
+    catch {
+        return { ok: false, count: 0, path: absPath };
+    }
+}
+//# sourceMappingURL=export.js.map

package/dist/core/genome/export.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"export.js","sourceRoot":"","sources":["../../../src/core/genome/export.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAGxC,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,SAAS,eAAe,CAAC,KAAkB;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAChC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,KAAK,CAAC,OAAO;QAAE,IAAI,CAAC,IAAI,CAAC,gBAAgB,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IAC9D,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,aAAa,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3E,IAAI,CAAC,IAAI,CAAC,aAAa,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACvB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,OAAsB;IAC/C,MAAM,MAAM,GAAG;QACb,iBAAiB;QACjB,EAAE;QACF,YAAY,OAAO,CAAC,MAAM,QAAQ,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,yBAAyB;QAC7F,EAAE;QACF,KAAK;QACL,EAAE;KACH,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEb,OAAO,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACxD,CAAC;AAED,8EAA8E;AAC9E,uBAAuB;AACvB,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,YAAY,CAC1B,GAAgB,EAChB,IAAY,EACZ,MAAqB;IAErB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAEnC,IAAI,CAAC;QACH,kCAAkC;QAClC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QAEhC,uCAAuC;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAClC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAEvC,iBAAiB;QACjB,IAAI,OAAe,CAAC;QACpB,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;QACvC,CAAC;QAED,kEAAkE;QAClE,EAAE,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QAE3C,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAC5D,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAChD,CAAC;AACH,CAAC"}

package/dist/core/genome/playbook.d.ts

@@ -0,0 +1,33 @@
+/**
+ * playbook.ts — Genome playbook synthesis (M16).
+ *
+ * Recalls similar past genome entries for a goal and synthesizes a concise
+ * "how we've approached this before — what worked / what failed / cost"
+ * string using the LOCAL provider. Falls back to a concatenated-recall
+ * synthesis on any failure, over-budget condition, or absent provider.
+ *
+ * Guardrails:
+ *  - LOCAL-ONLY: no cloud calls; synthesis uses local provider best-effort.
+ *  - Never throws; always returns a Playbook.
+ *  - Bounded: synthesis prompt and output are capped; playbookText hard-truncates.
+ *  - PRIVACY: works only from already-sanitised recall entries (genome never
+ *    stores secrets/raw payloads per M7/M16 privacy discipline).
+ */
+import type { AshlrConfig, Playbook } from '../types.js';
+/**
+ * Build a playbook for `goal` by recalling similar past entries and
+ * synthesizing a concise guidance string via the LOCAL provider.
+ *
+ * Falls back to a concatenated-recall synthesis on any failure, over-budget
+ * condition, or when no local provider is reachable.
+ *
+ * Never throws. Returns `{ goal, entries, synthesis }`.
+ */
+export declare function buildPlaybook(goal: string, cfg: AshlrConfig, opts?: {
+    limit?: number;
+}): Promise<Playbook>;
+/**
+ * Render a playbook to an injection-ready string capped at `maxChars`.
+ * Appends an elision marker when truncated. Pure; never throws.
+ */
+export declare function playbookText(p: Playbook, maxChars: number): string;