cortex-engine 0.1.0

package/dist/engines/cognition.d.ts

@@ -0,0 +1,76 @@
+/**
+ * Cognition engine — 7-phase dream consolidation cycle.
+ *
+ * Implements the full dream cycle as pure functions: storage-agnostic,
+ * provider-injected. Each phase is isolated so a single phase failure
+ * does not abort the whole cycle.
+ *
+ * Phases:
+ *   1. Cluster   — route unprocessed observations to nearest memories
+ *   2. Refine    — update memory definitions from new observations
+ *   3. Create    — promote unclustered observations to new memories
+ *   4. Connect   — discover edges between recently active memories
+ *   5. Score     — FSRS passive review for memories in review/learning
+ *   6. Abstract  — REM cross-domain pattern synthesis
+ *   7. Report    — narrative summary of the full cycle
+ */
+import type { CortexStore } from '../core/store.js';
+import type { EmbedProvider } from '../core/embed.js';
+import type { LLMProvider } from '../core/llm.js';
+export interface DreamResult {
+    phases: {
+        cluster: {
+            clustered: number;
+            unclustered: number;
+        };
+        refine: {
+            refined: number;
+        };
+        create: {
+            created: number;
+        };
+        connect: {
+            edges_discovered: number;
+        };
+        score: {
+            scored: number;
+        };
+        report: {
+            text: string;
+        };
+        abstract: {
+            abstractions: number;
+        };
+    };
+    total_processed: number;
+    duration_ms: number;
+    /** clustered / (clustered + unclustered) */
+    integration_rate: number;
+}
+export interface DreamOptions {
+    /** Max observations to process in cluster phase (default: 50) */
+    observation_limit?: number;
+    /** Max unclustered to create as memories (default: 10) */
+    create_limit?: number;
+    /** Max abstraction attempts in REM phase (default: 5) */
+    abstraction_attempts?: number;
+    /** Similarity threshold for clustering (default: 0.70) */
+    cluster_threshold?: number;
+    /** Similarity threshold for detecting duplicate abstractions (default: 0.88) */
+    abstraction_novelty_threshold?: number;
+    /** Namespace config merge threshold */
+    similarity_merge?: number;
+    /** Namespace config link threshold */
+    similarity_link?: number;
+}
+/**
+ * Run the full 7-phase dream consolidation cycle.
+ *
+ * Phase ordering:
+ *   1 Cluster → 2 Refine → 3 Create → 4 Connect → 5 Score → 6 Abstract → 7 Report
+ *
+ * Report runs last so it can include abstraction stats.
+ * A phase error is caught internally — the cycle continues with degraded output.
+ */
+export declare function dreamConsolidate(store: CortexStore, embed: EmbedProvider, llm: LLMProvider, options?: DreamOptions): Promise<DreamResult>;
+//# sourceMappingURL=cognition.d.ts.map

package/dist/engines/cognition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cognition.d.ts","sourceRoot":"","sources":["../../src/engines/cognition.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACtD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAOlD,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE;QACN,OAAO,EAAE;YAAE,SAAS,EAAE,MAAM,CAAC;YAAC,WAAW,EAAE,MAAM,CAAA;SAAE,CAAC;QACpD,MAAM,EAAE;YAAE,OAAO,EAAE,MAAM,CAAA;SAAE,CAAC;QAC5B,MAAM,EAAE;YAAE,OAAO,EAAE,MAAM,CAAA;SAAE,CAAC;QAC5B,OAAO,EAAE;YAAE,gBAAgB,EAAE,MAAM,CAAA;SAAE,CAAC;QACtC,KAAK,EAAE;YAAE,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC;QAC1B,MAAM,EAAE;YAAE,IAAI,EAAE,MAAM,CAAA;SAAE,CAAC;QACzB,QAAQ,EAAE;YAAE,YAAY,EAAE,MAAM,CAAA;SAAE,CAAC;KACpC,CAAC;IACF,eAAe,EAAE,MAAM,CAAC;IACxB,WAAW,EAAE,MAAM,CAAC;IACpB,4CAA4C;IAC5C,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,YAAY;IAC3B,iEAAiE;IACjE,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,0DAA0D;IAC1D,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,yDAAyD;IACzD,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,0DAA0D;IAC1D,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,gFAAgF;IAChF,6BAA6B,CAAC,EAAE,MAAM,CAAC;IACvC,uCAAuC;IACvC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,sCAAsC;IACtC,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAkhBD;;;;;;;;GAQG;AACH,wBAAsB,gBAAgB,CACpC,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,aAAa,EACpB,GAAG,EAAE,WAAW,EAChB,OAAO,GAAE,YAAiB,GACzB,OAAO,CAAC,WAAW,CAAC,CAwDtB"}

package/dist/engines/cognition.js

@@ -0,0 +1,441 @@
+/**
+ * Cognition engine — 7-phase dream consolidation cycle.
+ *
+ * Implements the full dream cycle as pure functions: storage-agnostic,
+ * provider-injected. Each phase is isolated so a single phase failure
+ * does not abort the whole cycle.
+ *
+ * Phases:
+ *   1. Cluster   — route unprocessed observations to nearest memories
+ *   2. Refine    — update memory definitions from new observations
+ *   3. Create    — promote unclustered observations to new memories
+ *   4. Connect   — discover edges between recently active memories
+ *   5. Score     — FSRS passive review for memories in review/learning
+ *   6. Abstract  — REM cross-domain pattern synthesis
+ *   7. Report    — narrative summary of the full cycle
+ */
+import { extractKeywords } from './keywords.js';
+import { scheduleNext, newFSRSState, elapsedDaysSince } from './fsrs.js';
+// ─── Phase 1: Cluster ─────────────────────────────────────────────────────────
+/**
+ * Route unprocessed observations to the nearest existing memory.
+ * Observations above cluster_threshold are linked and marked processed.
+ * The rest are returned as unclustered for later phases.
+ */
+async function clusterObservations(store, _embed, options) {
+    const limit = options.observation_limit ?? 50;
+    const threshold = options.cluster_threshold ?? 0.70;
+    let clustered = 0;
+    const unclusteredObs = [];
+    let observations;
+    try {
+        observations = await store.getUnprocessedObservations(limit);
+    }
+    catch {
+        return { clustered: 0, unclustered: 0, unclusteredObs: [] };
+    }
+    for (const obs of observations) {
+        // Skip observations without embeddings — nothing to cluster on.
+        if (!obs.embedding || obs.embedding.length === 0) {
+            unclusteredObs.push(obs);
+            continue;
+        }
+        try {
+            const nearest = await store.findNearest(obs.embedding, 1);
+            if (nearest.length > 0 && nearest[0].score >= threshold) {
+                const nearestMemoryId = nearest[0].memory.id;
+                // Bump the memory's access count to reflect the clustering.
+                // No edge needed — the observation→memory relationship is implicit
+                // in the processing, and self-referential edges are useless noise.
+                await store.touchMemory(nearestMemoryId, {});
+                await store.markObservationProcessed(obs.id);
+                clustered++;
+            }
+            else {
+                unclusteredObs.push(obs);
+            }
+        }
+        catch {
+            // Don't let a single observation kill the phase.
+            unclusteredObs.push(obs);
+        }
+    }
+    return {
+        clustered,
+        unclustered: unclusteredObs.length,
+        unclusteredObs,
+    };
+}
+// ─── Phase 2: Refine ──────────────────────────────────────────────────────────
+/**
+ * For memories accessed recently that have accumulated new clustered observations,
+ * ask the LLM to rewrite the definition incorporating the new evidence.
+ */
+async function refineMemories(store, embed, llm, _options) {
+    let refined = 0;
+    let allMemories;
+    try {
+        allMemories = await store.getAllMemories();
+    }
+    catch {
+        return { refined: 0 };
+    }
+    const sevenDaysAgo = Date.now() - 7 * 24 * 60 * 60 * 1000;
+    // Find memories accessed in the last 7 days.
+    const recentMemories = allMemories.filter((m) => m.last_accessed.getTime() >= sevenDaysAgo);
+    for (const memory of recentMemories) {
+        try {
+            // Fetch edges with relation 'related' that reference this memory.
+            const edges = await store.getEdgesFrom(memory.id);
+            const relatedEdges = edges.filter((e) => e.relation === 'related');
+            if (relatedEdges.length === 0)
+                continue;
+            // Use edge evidence as the observation content for refinement.
+            const observationSnippets = relatedEdges
+                .slice(0, 10)
+                .map((e) => `- ${e.evidence}`)
+                .join('\n');
+            const prompt = `You are refining a memory concept based on new observations.\n\n` +
+                `Current definition: ${memory.definition}\n\n` +
+                `New observations:\n${observationSnippets}\n\n` +
+                `Write an improved definition that incorporates the new observations. Keep it concise (2-4 sentences). Do not include any preamble.`;
+            const newDefinition = await llm.generate(prompt, {
+                temperature: 0.1,
+                maxTokens: 300,
+            });
+            if (!newDefinition || newDefinition.trim() === memory.definition.trim())
+                continue;
+            // Log the belief change before updating.
+            await store.putBelief({
+                concept_id: memory.id,
+                old_definition: memory.definition,
+                new_definition: newDefinition.trim(),
+                reason: `Dream refinement from ${relatedEdges.length} observations`,
+                changed_at: new Date(),
+            });
+            // Re-embed the refined definition.
+            const newEmbedding = await embed.embed(newDefinition.trim());
+            await store.updateMemory(memory.id, {
+                definition: newDefinition.trim(),
+                embedding: newEmbedding,
+                updated_at: new Date(),
+            });
+            refined++;
+        }
+        catch {
+            // One memory failing to refine should not stop the rest.
+            continue;
+        }
+    }
+    return { refined };
+}
+// ─── Phase 3: Create ──────────────────────────────────────────────────────────
+/**
+ * Promote unclustered observations to first-class memories.
+ * Category is inferred by the LLM; embedding reuses the observation's.
+ */
+async function createFromUnclustered(store, embed, llm, unclusteredObs, options) {
+    const createLimit = options.create_limit ?? 10;
+    let created = 0;
+    const candidates = unclusteredObs.slice(0, createLimit);
+    for (const obs of candidates) {
+        try {
+            const categoryPrompt = `Classify this text into exactly one category: belief, pattern, entity, topic, value, project, insight, observation.\n\n` +
+                `Text: ${obs.content}\n\n` +
+                `Respond with only the category name, nothing else.`;
+            const rawCategory = await llm.generate(categoryPrompt, {
+                temperature: 0,
+                maxTokens: 20,
+            });
+            const validCategories = [
+                'belief', 'pattern', 'entity', 'topic', 'value', 'project', 'insight', 'observation',
+            ];
+            const inferred = rawCategory.trim().toLowerCase();
+            const category = validCategories.includes(inferred) ? inferred : 'observation';
+            // Reuse existing embedding or generate a fresh one.
+            let embedding = obs.embedding;
+            if (!embedding || embedding.length === 0) {
+                embedding = await embed.embed(obs.content);
+            }
+            const name = obs.content.length > 60
+                ? obs.content.slice(0, 60)
+                : obs.content;
+            await store.putMemory({
+                name,
+                definition: obs.content,
+                category,
+                salience: obs.salience,
+                confidence: 0.5,
+                access_count: 0,
+                created_at: new Date(),
+                updated_at: new Date(),
+                last_accessed: new Date(),
+                source_files: obs.source_file ? [obs.source_file] : [],
+                embedding,
+                tags: obs.keywords.length > 0 ? obs.keywords : extractKeywords(obs.content),
+                fsrs: newFSRSState(),
+            });
+            await store.markObservationProcessed(obs.id);
+            created++;
+        }
+        catch {
+            continue;
+        }
+    }
+    return { created };
+}
+/**
+ * For recently updated memories, check each pair and create edges when
+ * the LLM detects a meaningful relationship that does not yet exist.
+ */
+async function discoverEdges(store, llm, _options) {
+    let edges_discovered = 0;
+    let allMemories;
+    try {
+        allMemories = await store.getAllMemories();
+    }
+    catch {
+        return { edges_discovered: 0 };
+    }
+    const sevenDaysAgo = Date.now() - 7 * 24 * 60 * 60 * 1000;
+    const recent = allMemories
+        .filter((m) => m.updated_at.getTime() >= sevenDaysAgo)
+        .slice(0, 15); // cap to avoid O(n²) explosion
+    if (recent.length < 2)
+        return { edges_discovered: 0 };
+    for (let i = 0; i < recent.length; i++) {
+        for (let j = i + 1; j < recent.length; j++) {
+            const memA = recent[i];
+            const memB = recent[j];
+            try {
+                // Check if an edge already exists in either direction.
+                const edgesFromA = await store.getEdgesFrom(memA.id);
+                const alreadyConnected = edgesFromA.some((e) => e.target_id === memB.id || e.source_id === memB.id);
+                if (alreadyConnected)
+                    continue;
+                const prompt = `Do these two concepts have a meaningful relationship?\n\n` +
+                    `Concept A: ${memA.name} — ${memA.definition}\n` +
+                    `Concept B: ${memB.name} — ${memB.definition}\n\n` +
+                    `If yes, respond with JSON: {"relation": "extends|refines|contradicts|tensions-with|questions|supports|exemplifies|caused|related", "evidence": "brief explanation"}\n` +
+                    `If no meaningful relationship, respond with: {"relation": null}`;
+                const result = await llm.generateJSON(prompt, {
+                    temperature: 0.2,
+                });
+                if (result.relation !== null && result.relation !== undefined) {
+                    const validRelations = [
+                        'extends', 'refines', 'contradicts', 'tensions-with',
+                        'questions', 'supports', 'exemplifies', 'caused', 'related',
+                    ];
+                    if (!validRelations.includes(result.relation))
+                        continue;
+                    await store.putEdge({
+                        source_id: memA.id,
+                        target_id: memB.id,
+                        relation: result.relation,
+                        weight: 0.7,
+                        evidence: result.evidence ?? '',
+                        created_at: new Date(),
+                    });
+                    edges_discovered++;
+                }
+            }
+            catch {
+                continue;
+            }
+        }
+    }
+    return { edges_discovered };
+}
+// ─── Phase 5: Score ───────────────────────────────────────────────────────────
+/**
+ * Passive FSRS review for memories currently in 'review' or 'learning' state.
+ * Recent access = rating 3 (Good); otherwise rating 2 (Hard).
+ */
+async function scoreMemories(store, _options) {
+    let scored = 0;
+    let allMemories;
+    try {
+        allMemories = await store.getAllMemories();
+    }
+    catch {
+        return { scored: 0 };
+    }
+    const threeDaysAgo = Date.now() - 3 * 24 * 60 * 60 * 1000;
+    const reviewable = allMemories.filter((m) => m.fsrs.state === 'review' || m.fsrs.state === 'learning');
+    for (const memory of reviewable) {
+        try {
+            const elapsed = elapsedDaysSince(memory.fsrs.last_review);
+            const recentlyAccessed = memory.last_accessed.getTime() >= threeDaysAgo;
+            const rating = recentlyAccessed ? 3 : 2;
+            const scheduled = scheduleNext(memory.fsrs, rating, elapsed);
+            await store.touchMemory(memory.id, {
+                stability: scheduled.stability,
+                difficulty: scheduled.difficulty,
+                reps: memory.fsrs.reps + 1,
+                lapses: memory.fsrs.lapses,
+                state: scheduled.state,
+                last_review: new Date(),
+            });
+            scored++;
+        }
+        catch {
+            continue;
+        }
+    }
+    return { scored };
+}
+// ─── Phase 6: Abstract (REM) ──────────────────────────────────────────────────
+/**
+ * REM sleep phase: sample recent memories across categories and attempt
+ * to synthesize higher-level cross-domain abstractions.
+ */
+async function abstractCrossDomain(store, embed, llm, options) {
+    const attempts = options.abstraction_attempts ?? 5;
+    const noveltyThreshold = options.abstraction_novelty_threshold ?? 0.88;
+    let abstractions = 0;
+    let allMemories;
+    try {
+        allMemories = await store.getAllMemories();
+    }
+    catch {
+        return { abstractions: 0 };
+    }
+    // Work from 60 most recently updated memories.
+    const recent = allMemories
+        .sort((a, b) => b.updated_at.getTime() - a.updated_at.getTime())
+        .slice(0, 60);
+    // Group by category.
+    const byCategory = new Map();
+    for (const m of recent) {
+        const group = byCategory.get(m.category) ?? [];
+        group.push(m);
+        byCategory.set(m.category, group);
+    }
+    const categories = Array.from(byCategory.keys());
+    if (categories.length < 3)
+        return { abstractions: 0 };
+    for (let attempt = 0; attempt < attempts; attempt++) {
+        try {
+            // Pick 4 different random categories (or as many as available, min 3).
+            const shuffled = categories.sort(() => Math.random() - 0.5);
+            const selected = shuffled.slice(0, Math.min(4, shuffled.length));
+            // Pick one random memory from each selected category.
+            const sampledMemories = selected.map((cat) => {
+                const group = byCategory.get(cat);
+                return group[Math.floor(Math.random() * group.length)];
+            });
+            const conceptLines = sampledMemories
+                .map((m) => `[${m.category}] ${m.name}: ${m.definition}`)
+                .join('\n\n');
+            const prompt = `Find a higher-level principle or pattern that connects these diverse concepts:\n\n` +
+                `${conceptLines}\n\n` +
+                `Write a concise abstraction (1-2 sentences) that captures the deeper connection. ` +
+                `If no meaningful connection exists, respond with 'NO_ABSTRACTION'.`;
+            const result = await llm.generate(prompt, {
+                temperature: 0.4,
+                maxTokens: 200,
+            });
+            const trimmed = result.trim();
+            if (!trimmed || trimmed === 'NO_ABSTRACTION')
+                continue;
+            // Check novelty — don't store abstractions too similar to existing memories.
+            const abstEmbedding = await embed.embed(trimmed);
+            const nearest = await store.findNearest(abstEmbedding, 1);
+            if (nearest.length > 0 && nearest[0].score >= noveltyThreshold) {
+                // Too similar to an existing memory — skip.
+                continue;
+            }
+            await store.putMemory({
+                name: trimmed.length > 60 ? trimmed.slice(0, 60) : trimmed,
+                definition: trimmed,
+                category: 'insight',
+                salience: 0.8,
+                confidence: 0.6,
+                access_count: 0,
+                created_at: new Date(),
+                updated_at: new Date(),
+                last_accessed: new Date(),
+                source_files: [],
+                embedding: abstEmbedding,
+                tags: extractKeywords(trimmed),
+                fsrs: newFSRSState(),
+            });
+            abstractions++;
+        }
+        catch {
+            continue;
+        }
+    }
+    return { abstractions };
+}
+// ─── Phase 7: Report ──────────────────────────────────────────────────────────
+/**
+ * Generate a human-readable narrative of what the dream cycle accomplished.
+ * Called last so it can include abstraction count.
+ */
+async function generateReport(llm, cluster, refine, create, connect, score, abstract) {
+    try {
+        const prompt = `Summarize this dream consolidation session in 2-3 sentences.\n\n` +
+            `Stats: ${cluster.clustered} observations clustered, ${refine.refined} memories refined, ` +
+            `${create.created} new memories created, ${connect.edges_discovered} edges discovered, ` +
+            `${score.scored} memories reviewed, ${abstract.abstractions} abstractions formed.\n\n` +
+            `Write a brief, reflective summary of what was learned and consolidated.`;
+        const text = await llm.generate(prompt, {
+            temperature: 0.7,
+            maxTokens: 200,
+        });
+        return { text: text.trim() };
+    }
+    catch {
+        const fallback = `Dream cycle complete. ` +
+            `Clustered ${cluster.clustered} observations, refined ${refine.refined} memories, ` +
+            `created ${create.created} new memories, discovered ${connect.edges_discovered} edges, ` +
+            `reviewed ${score.scored} memories, formed ${abstract.abstractions} abstractions.`;
+        return { text: fallback };
+    }
+}
+// ─── Main: dreamConsolidate ───────────────────────────────────────────────────
+/**
+ * Run the full 7-phase dream consolidation cycle.
+ *
+ * Phase ordering:
+ *   1 Cluster → 2 Refine → 3 Create → 4 Connect → 5 Score → 6 Abstract → 7 Report
+ *
+ * Report runs last so it can include abstraction stats.
+ * A phase error is caught internally — the cycle continues with degraded output.
+ */
+export async function dreamConsolidate(store, embed, llm, options = {}) {
+    const start = Date.now();
+    // Phase 1 — Cluster
+    const clusterResult = await clusterObservations(store, embed, options);
+    // Phase 2 — Refine
+    const refineResult = await refineMemories(store, embed, llm, options);
+    // Phase 3 — Create
+    const createResult = await createFromUnclustered(store, embed, llm, clusterResult.unclusteredObs, options);
+    // Phase 4 — Connect
+    const connectResult = await discoverEdges(store, llm, options);
+    // Phase 5 — Score
+    const scoreResult = await scoreMemories(store, options);
+    // Phase 6 — Abstract (REM)
+    const abstractResult = await abstractCrossDomain(store, embed, llm, options);
+    // Phase 7 — Report (runs after abstract to include abstraction count)
+    const reportResult = await generateReport(llm, clusterResult, refineResult, createResult, connectResult, scoreResult, abstractResult);
+    const duration_ms = Date.now() - start;
+    const total = clusterResult.clustered + clusterResult.unclustered;
+    const integration_rate = total > 0 ? clusterResult.clustered / total : 0;
+    return {
+        phases: {
+            cluster: { clustered: clusterResult.clustered, unclustered: clusterResult.unclustered },
+            refine: { refined: refineResult.refined },
+            create: { created: createResult.created },
+            connect: { edges_discovered: connectResult.edges_discovered },
+            score: { scored: scoreResult.scored },
+            report: { text: reportResult.text },
+            abstract: { abstractions: abstractResult.abstractions },
+        },
+        total_processed: clusterResult.clustered + createResult.created,
+        duration_ms,
+        integration_rate,
+    };
+}
+//# sourceMappingURL=cognition.js.map

package/dist/engines/cognition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cognition.js","sourceRoot":"","sources":["../../src/engines/cognition.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAMH,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAsEzE,iFAAiF;AAEjF;;;;GAIG;AACH,KAAK,UAAU,mBAAmB,CAChC,KAAkB,EAClB,MAAqB,EACrB,OAAqB;IAErB,MAAM,KAAK,GAAG,OAAO,CAAC,iBAAiB,IAAI,EAAE,CAAC;IAC9C,MAAM,SAAS,GAAG,OAAO,CAAC,iBAAiB,IAAI,IAAI,CAAC;IAEpD,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,cAAc,GAAkB,EAAE,CAAC;IAEzC,IAAI,YAA2B,CAAC;IAChC,IAAI,CAAC;QACH,YAAY,GAAG,MAAM,KAAK,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAC;IAC/D,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;IAC9D,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,gEAAgE;QAChE,IAAI,CAAC,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjD,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACzB,SAAS;QACX,CAAC;QAED,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YAE1D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,EAAE,CAAC;gBACxD,MAAM,eAAe,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAE7C,4DAA4D;gBAC5D,mEAAmE;gBACnE,mEAAmE;gBACnE,MAAM,KAAK,CAAC,WAAW,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;gBAE7C,MAAM,KAAK,CAAC,wBAAwB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC7C,SAAS,EAAE,CAAC;YACd,CAAC;iBAAM,CAAC;gBACN,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,iDAAiD;YACjD,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,OAAO;QACL,SAAS;QACT,WAAW,EAAE,cAAc,CAAC,MAAM;QAClC,cAAc;KACf,CAAC;AACJ,CAAC;AAED,iFAAiF;AAEjF;;;GAGG;AACH,KAAK,UAAU,cAAc,CAC3B,KAAkB,EAClB,KAAoB,EACpB,GAAgB,EAChB,QAAsB;IAEtB,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,IAAI,WAAqB,CAAC;IAC1B,IAAI,CAAC;QACH,WAAW,GAAG,MAAM,KAAK,CAAC,cAAc,EAAE,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IACxB,CAAC;IAED,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAE1D,6CAA6C;IAC7C,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,CACvC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,EAAE,IAAI,YAAY,CACjD,CAAC;IAEF,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;QACpC,IAAI,CAAC;YACH,kEAAkE;YAClE,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAClD,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC;YAEnE,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAExC,+DAA+D;YAC/D,MAAM,mBAAmB,GAAG,YAAY;iBACrC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;iBACZ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;iBAC7B,IAAI,CAAC,IAAI,CAAC,CAAC;YAEd,MAAM,MAAM,GACV,kEAAkE;gBAClE,uBAAuB,MAAM,CAAC,UAAU,MAAM;gBAC9C,sBAAsB,mBAAmB,MAAM;gBAC/C,oIAAoI,CAAC;YAEvI,MAAM,aAAa,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE;gBAC/C,WAAW,EAAE,GAAG;gBAChB,SAAS,EAAE,GAAG;aACf,CAAC,CAAC;YAEH,IAAI,CAAC,aAAa,IAAI,aAAa,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE;gBAAE,SAAS;YAElF,yCAAyC;YACzC,MAAM,KAAK,CAAC,SAAS,CAAC;gBACpB,UAAU,EAAE,MAAM,CAAC,EAAE;gBACrB,cAAc,EAAE,MAAM,CAAC,UAAU;gBACjC,cAAc,EAAE,aAAa,CAAC,IAAI,EAAE;gBACpC,MAAM,EAAE,yBAAyB,YAAY,CAAC,MAAM,eAAe;gBACnE,UAAU,EAAE,IAAI,IAAI,EAAE;aACvB,CAAC,CAAC;YAEH,mCAAmC;YACnC,MAAM,YAAY,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAE7D,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE;gBAClC,UAAU,EAAE,aAAa,CAAC,IAAI,EAAE;gBAChC,SAAS,EAAE,YAAY;gBACvB,UAAU,EAAE,IAAI,IAAI,EAAE;aACvB,CAAC,CAAC;YAEH,OAAO,EAAE,CAAC;QACZ,CAAC;QAAC,MAAM,CAAC;YACP,yDAAyD;YACzD,SAAS;QACX,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,CAAC;AACrB,CAAC;AAED,iFAAiF;AAEjF;;;GAGG;AACH,KAAK,UAAU,qBAAqB,CAClC,KAAkB,EAClB,KAAoB,EACpB,GAAgB,EAChB,cAA6B,EAC7B,OAAqB;IAErB,MAAM,WAAW,GAAG,OAAO,CAAC,YAAY,IAAI,EAAE,CAAC;IAC/C,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAExD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,CAAC;YACH,MAAM,cAAc,GAClB,yHAAyH;gBACzH,SAAS,GAAG,CAAC,OAAO,MAAM;gBAC1B,oDAAoD,CAAC;YAEvD,MAAM,WAAW,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,cAAc,EAAE;gBACrD,WAAW,EAAE,CAAC;gBACd,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;YAEH,MAAM,eAAe,GAAqB;gBACxC,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,aAAa;aACrF,CAAC;YACF,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,WAAW,EAAoB,CAAC;YACpE,MAAM,QAAQ,GAAmB,eAAe,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC;YAE/F,oDAAoD;YACpD,IAAI,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;YAC9B,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzC,SAAS,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC7C,CAAC;YAED,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,EAAE;gBAClC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;gBAC1B,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC;YAEhB,MAAM,KAAK,CAAC,SAAS,CAAC;gBACpB,IAAI;gBACJ,UAAU,EAAE,GAAG,CAAC,OAAO;gBACvB,QAAQ;gBACR,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,UAAU,EAAE,GAAG;gBACf,YAAY,EAAE,CAAC;gBACf,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,aAAa,EAAE,IAAI,IAAI,EAAE;gBACzB,YAAY,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE;gBACtD,SAAS;gBACT,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC;gBAC3E,IAAI,EAAE,YAAY,EAAE;aACrB,CAAC,CAAC;YAEH,MAAM,KAAK,CAAC,wBAAwB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7C,OAAO,EAAE,CAAC;QACZ,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,CAAC;AACrB,CAAC;AASD;;;GAGG;AACH,KAAK,UAAU,aAAa,CAC1B,KAAkB,EAClB,GAAgB,EAChB,QAAsB;IAEtB,IAAI,gBAAgB,GAAG,CAAC,CAAC;IAEzB,IAAI,WAAqB,CAAC;IAC1B,IAAI,CAAC;QACH,WAAW,GAAG,MAAM,KAAK,CAAC,cAAc,EAAE,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,gBAAgB,EAAE,CAAC,EAAE,CAAC;IACjC,CAAC;IAED,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAE1D,MAAM,MAAM,GAAG,WAAW;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,YAAY,CAAC;SACrD,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,+BAA+B;IAEhD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC,EAAE,CAAC;IAEtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAEvB,IAAI,CAAC;gBACH,uDAAuD;gBACvD,MAAM,UAAU,GAAG,MAAM,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrD,MAAM,gBAAgB,GAAG,UAAU,CAAC,IAAI,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC,EAAE,CAC1D,CAAC;gBACF,IAAI,gBAAgB;oBAAE,SAAS;gBAE/B,MAAM,MAAM,GACV,2DAA2D;oBAC3D,cAAc,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,UAAU,IAAI;oBAChD,cAAc,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,UAAU,MAAM;oBAClD,uKAAuK;oBACvK,iEAAiE,CAAC;gBAEpE,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,YAAY,CAAwB,MAAM,EAAE;oBACnE,WAAW,EAAE,GAAG;iBACjB,CAAC,CAAC;gBAEH,IAAI,MAAM,CAAC,QAAQ,KAAK,IAAI,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC9D,MAAM,cAAc,GAAmB;wBACrC,SAAS,EAAE,SAAS,EAAE,aAAa,EAAE,eAAe;wBACpD,WAAW,EAAE,UAAU,EAAE,aAAa,EAAE,QAAQ,EAAE,SAAS;qBAC5D,CAAC;oBACF,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC;wBAAE,SAAS;oBAExD,MAAM,KAAK,CAAC,OAAO,CAAC;wBAClB,SAAS,EAAE,IAAI,CAAC,EAAE;wBAClB,SAAS,EAAE,IAAI,CAAC,EAAE;wBAClB,QAAQ,EAAE,MAAM,CAAC,QAAQ;wBACzB,MAAM,EAAE,GAAG;wBACX,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,EAAE;wBAC/B,UAAU,EAAE,IAAI,IAAI,EAAE;qBACvB,CAAC,CAAC;oBAEH,gBAAgB,EAAE,CAAC;gBACrB,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAC9B,CAAC;AAED,iFAAiF;AAEjF;;;GAGG;AACH,KAAK,UAAU,aAAa,CAC1B,KAAkB,EAClB,QAAsB;IAEtB,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,IAAI,WAAqB,CAAC;IAC1B,IAAI,CAAC;QACH,WAAW,GAAG,MAAM,KAAK,CAAC,cAAc,EAAE,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACvB,CAAC;IAED,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAE1D,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CACnC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,UAAU,CAChE,CAAC;IAEF,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;QAChC,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC1D,MAAM,gBAAgB,GAAG,MAAM,CAAC,aAAa,CAAC,OAAO,EAAE,IAAI,YAAY,CAAC;YACxE,MAAM,MAAM,GAAU,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAE/C,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;YAE7D,MAAM,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE;gBACjC,SAAS,EAAE,SAAS,CAAC,SAAS;gBAC9B,UAAU,EAAE,SAAS,CAAC,UAAU;gBAChC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;gBAC1B,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM;gBAC1B,KAAK,EAAE,SAAS,CAAC,KAAK;gBACtB,WAAW,EAAE,IAAI,IAAI,EAAE;aACxB,CAAC,CAAC;YAEH,MAAM,EAAE,CAAC;QACX,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;IACH,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,CAAC;AACpB,CAAC;AAED,iFAAiF;AAEjF;;;GAGG;AACH,KAAK,UAAU,mBAAmB,CAChC,KAAkB,EAClB,KAAoB,EACpB,GAAgB,EAChB,OAAqB;IAErB,MAAM,QAAQ,GAAG,OAAO,CAAC,oBAAoB,IAAI,CAAC,CAAC;IACnD,MAAM,gBAAgB,GAAG,OAAO,CAAC,6BAA6B,IAAI,IAAI,CAAC;IACvE,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,IAAI,WAAqB,CAAC;IAC1B,IAAI,CAAC;QACH,WAAW,GAAG,MAAM,KAAK,CAAC,cAAc,EAAE,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IAC7B,CAAC;IAED,+CAA+C;IAC/C,MAAM,MAAM,GAAG,WAAW;SACvB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;SAC/D,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEhB,qBAAqB;IACrB,MAAM,UAAU,GAAG,IAAI,GAAG,EAA4B,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC/C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IACjD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IAEtD,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,QAAQ,EAAE,OAAO,EAAE,EAAE,CAAC;QACpD,IAAI,CAAC;YACH,uEAAuE;YACvE,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;YAC5D,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;YAEjE,sDAAsD;YACtD,MAAM,eAAe,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;gBAC3C,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;gBACnC,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;YAEH,MAAM,YAAY,GAAG,eAAe;iBACjC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,UAAU,EAAE,CAAC;iBACxD,IAAI,CAAC,MAAM,CAAC,CAAC;YAEhB,MAAM,MAAM,GACV,oFAAoF;gBACpF,GAAG,YAAY,MAAM;gBACrB,mFAAmF;gBACnF,oEAAoE,CAAC;YAEvE,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE;gBACxC,WAAW,EAAE,GAAG;gBAChB,SAAS,EAAE,GAAG;aACf,CAAC,CAAC;YAEH,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;YAC9B,IAAI,CAAC,OAAO,IAAI,OAAO,KAAK,gBAAgB;gBAAE,SAAS;YAEvD,6EAA6E;YAC7E,MAAM,aAAa,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACjD,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;YAE1D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,gBAAgB,EAAE,CAAC;gBAC/D,4CAA4C;gBAC5C,SAAS;YACX,CAAC;YAED,MAAM,KAAK,CAAC,SAAS,CAAC;gBACpB,IAAI,EAAE,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO;gBAC1D,UAAU,EAAE,OAAO;gBACnB,QAAQ,EAAE,SAAS;gBACnB,QAAQ,EAAE,GAAG;gBACb,UAAU,EAAE,GAAG;gBACf,YAAY,EAAE,CAAC;gBACf,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,UAAU,EAAE,IAAI,IAAI,EAAE;gBACtB,aAAa,EAAE,IAAI,IAAI,EAAE;gBACzB,YAAY,EAAE,EAAE;gBAChB,SAAS,EAAE,aAAa;gBACxB,IAAI,EAAE,eAAe,CAAC,OAAO,CAAC;gBAC9B,IAAI,EAAE,YAAY,EAAE;aACrB,CAAC,CAAC;YAEH,YAAY,EAAE,CAAC;QACjB,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;IACH,CAAC;IAED,OAAO,EAAE,YAAY,EAAE,CAAC;AAC1B,CAAC;AAED,iFAAiF;AAEjF;;;GAGG;AACH,KAAK,UAAU,cAAc,CAC3B,GAAgB,EAChB,OAA2B,EAC3B,MAAyB,EACzB,MAAyB,EACzB,OAA2B,EAC3B,KAAuB,EACvB,QAA6B;IAE7B,IAAI,CAAC;QACH,MAAM,MAAM,GACV,kEAAkE;YAClE,UAAU,OAAO,CAAC,SAAS,4BAA4B,MAAM,CAAC,OAAO,qBAAqB;YAC1F,GAAG,MAAM,CAAC,OAAO,0BAA0B,OAAO,CAAC,gBAAgB,qBAAqB;YACxF,GAAG,KAAK,CAAC,MAAM,uBAAuB,QAAQ,CAAC,YAAY,2BAA2B;YACtF,yEAAyE,CAAC;QAE5E,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE;YACtC,WAAW,EAAE,GAAG;YAChB,SAAS,EAAE,GAAG;SACf,CAAC,CAAC;QAEH,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,QAAQ,GACZ,wBAAwB;YACxB,aAAa,OAAO,CAAC,SAAS,0BAA0B,MAAM,CAAC,OAAO,aAAa;YACnF,WAAW,MAAM,CAAC,OAAO,6BAA6B,OAAO,CAAC,gBAAgB,UAAU;YACxF,YAAY,KAAK,CAAC,MAAM,qBAAqB,QAAQ,CAAC,YAAY,gBAAgB,CAAC;QACrF,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;IAC5B,CAAC;AACH,CAAC;AAED,iFAAiF;AAEjF;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,KAAkB,EAClB,KAAoB,EACpB,GAAgB,EAChB,UAAwB,EAAE;IAE1B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEzB,oBAAoB;IACpB,MAAM,aAAa,GAAG,MAAM,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAEvE,mBAAmB;IACnB,MAAM,YAAY,GAAG,MAAM,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAEtE,mBAAmB;IACnB,MAAM,YAAY,GAAG,MAAM,qBAAqB,CAC9C,KAAK,EACL,KAAK,EACL,GAAG,EACH,aAAa,CAAC,cAAc,EAC5B,OAAO,CACR,CAAC;IAEF,oBAAoB;IACpB,MAAM,aAAa,GAAG,MAAM,aAAa,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAE/D,kBAAkB;IAClB,MAAM,WAAW,GAAG,MAAM,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAExD,2BAA2B;IAC3B,MAAM,cAAc,GAAG,MAAM,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAE7E,sEAAsE;IACtE,MAAM,YAAY,GAAG,MAAM,cAAc,CACvC,GAAG,EACH,aAAa,EACb,YAAY,EACZ,YAAY,EACZ,aAAa,EACb,WAAW,EACX,cAAc,CACf,CAAC;IAEF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;IACvC,MAAM,KAAK,GAAG,aAAa,CAAC,SAAS,GAAG,aAAa,CAAC,WAAW,CAAC;IAClE,MAAM,gBAAgB,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzE,OAAO;QACL,MAAM,EAAE;YACN,OAAO,EAAE,EAAE,SAAS,EAAE,aAAa,CAAC,SAAS,EAAE,WAAW,EAAE,aAAa,CAAC,WAAW,EAAE;YACvF,MAAM,EAAE,EAAE,OAAO,EAAE,YAAY,CAAC,OAAO,EAAE;YACzC,MAAM,EAAE,EAAE,OAAO,EAAE,YAAY,CAAC,OAAO,EAAE;YACzC,OAAO,EAAE,EAAE,gBAAgB,EAAE,aAAa,CAAC,gBAAgB,EAAE;YAC7D,KAAK,EAAE,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE;YACrC,MAAM,EAAE,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;YACnC,QAAQ,EAAE,EAAE,YAAY,EAAE,cAAc,CAAC,YAAY,EAAE;SACxD;QACD,eAAe,EAAE,aAAa,CAAC,SAAS,GAAG,YAAY,CAAC,OAAO;QAC/D,WAAW;QACX,gBAAgB;KACjB,CAAC;AACJ,CAAC"}

package/dist/engines/digest.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Digest engine — document ingestion pipeline for cortex.
+ *
+ * Takes raw document content (markdown with optional YAML frontmatter) and
+ * runs it through a configurable pipeline of cognitive steps. Each step is
+ * isolated in a try/catch so a single failure does not abort the pipeline.
+ *
+ * Pipeline steps:
+ *   observe  — embed and store content as observations (with prediction error gating)
+ *   reflect  — generate LLM insights connecting content to existing memories
+ *   predict  — extract forward-looking claims and store as prediction observations
+ */
+import type { CortexStore } from '../core/store.js';
+import type { EmbedProvider } from '../core/embed.js';
+import type { LLMProvider } from '../core/llm.js';
+export interface DigestOptions {
+    /** Pipeline of cognitive steps. Default: ['observe', 'reflect'] */
+    pipeline?: string[];
+    /** Target namespace (default: 'default') */
+    namespace?: string;
+    /** Source file path for provenance */
+    source_file?: string;
+    /** Salience override (default: auto-detect from content) */
+    salience?: number;
+}
+export interface DigestResult {
+    /** IDs of observations created */
+    observation_ids: string[];
+    /** Memories that were linked or created */
+    memories_linked: string[];
+    /** Insights generated during reflect step */
+    insights: string[];
+    /** Pipeline steps that ran */
+    pipeline_executed: string[];
+    /** Timestamp of processing */
+    processed_at: Date;
+    /** Duration in ms */
+    duration_ms: number;
+}
+/**
+ * Process a document through the cortex ingestion pipeline.
+ *
+ * Parses frontmatter, detects salience, then runs each requested pipeline step
+ * in sequence. Steps are isolated — a single step failure does not abort the
+ * pipeline; it is logged as skipped.
+ *
+ * Supported steps: 'observe', 'reflect', 'predict'
+ * Unknown steps are silently skipped and recorded in pipeline_executed as
+ * 'skipped:<name>'.
+ */
+export declare function digestDocument(content: string, store: CortexStore, embed: EmbedProvider, llm: LLMProvider, options?: DigestOptions): Promise<DigestResult>;
+//# sourceMappingURL=digest.d.ts.map

package/dist/engines/digest.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"digest.d.ts","sourceRoot":"","sources":["../../src/engines/digest.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACtD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAMlD,MAAM,WAAW,aAAa;IAC5B,mEAAmE;IACnE,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,4CAA4C;IAC5C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sCAAsC;IACtC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,4DAA4D;IAC5D,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,YAAY;IAC3B,kCAAkC;IAClC,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,2CAA2C;IAC3C,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,6CAA6C;IAC7C,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,8BAA8B;IAC9B,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,8BAA8B;IAC9B,YAAY,EAAE,IAAI,CAAC;IACnB,qBAAqB;IACrB,WAAW,EAAE,MAAM,CAAC;CACrB;AAiVD;;;;;;;;;;GAUG;AACH,wBAAsB,cAAc,CAClC,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,aAAa,EACpB,GAAG,EAAE,WAAW,EAChB,OAAO,CAAC,EAAE,aAAa,GACtB,OAAO,CAAC,YAAY,CAAC,CAqFvB"}