@cleocode/cleo 2026.9.5 → 2026.9.7

package/studio-dist/server/chunks/surprisal-CwTfWQi8.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"surprisal-CwTfWQi8.js","sources":["../../../.svelte-kit/adapter-node/chunks/surprisal.js"],"sourcesContent":["import { o as getBrainNativeDb } from \"./memory-sqlite.js\";\n//#region ../core/dist/memory/surprisal.js\n/**\n* Bayesian Surprisal Scoring — T1146 Wave 6 Dreamer Upgrade\n*\n* Computes a surprisal score for a brain_observation relative to prior\n* context (existing embeddings in the same project/peer scope).\n*\n* Surprisal definition: how much new information does this observation\n* add to the existing memory state?\n*\n*   score = -log(P(observation | prior_context))\n*\n* Implementation:\n*   - High score (novel, >0.7): observation is semantically distant from all\n*     stored embeddings → high priority for consolidation\n*   - Low score (redundant, <0.3): observation is very similar to an existing\n*     embedding → low priority, may be merged/skipped\n*   - Neutral (0.5): returned when embeddings unavailable (graceful degrade)\n*\n* Temporal decay and confidence weighting from BRAIN_SOURCE_CONFIDENCE are\n* applied to adjust the prior similarity.\n*\n* No external library: pure TypeScript cosine similarity + log transform.\n*\n* @task T1146\n* @epic T1146\n*/\n/** Neutral surprisal returned when embeddings are unavailable. */\nvar NEUTRAL_SURPRISAL = .5;\n/** Minimum surprisal score (most redundant). */\nvar MIN_SURPRISAL = 0;\n/** Maximum surprisal score (most novel). */\nvar MAX_SURPRISAL = 1;\n/**\n* Cosine similarity threshold above which two observations are considered\n* semantically identical (very low surprisal).\n*/\nvar HIGH_SIMILARITY_THRESHOLD = .92;\n/**\n* Cosine similarity threshold below which two observations are considered\n* semantically unrelated (high surprisal — novel).\n*/\nvar LOW_SIMILARITY_THRESHOLD = .35;\n/** Max number of prior embeddings to compare against for efficiency. */\nvar MAX_PRIOR_EMBEDDINGS = 50;\n/** Temporal decay half-life in days. Recent observations have more weight. */\nvar DECAY_HALF_LIFE_DAYS = 30;\n/**\n* Compute cosine similarity between two float arrays.\n* Returns 0 if either vector is zero or lengths differ.\n*/\nfunction cosineSimilarity(a, b) {\n\tif (a.length !== b.length || a.length === 0) return 0;\n\tlet dot = 0;\n\tlet normA = 0;\n\tlet normB = 0;\n\tfor (let i = 0; i < a.length; i++) {\n\t\tdot += (a[i] ?? 0) * (b[i] ?? 0);\n\t\tnormA += (a[i] ?? 0) ** 2;\n\t\tnormB += (b[i] ?? 0) ** 2;\n\t}\n\tconst denom = Math.sqrt(normA) * Math.sqrt(normB);\n\treturn denom === 0 ? 0 : dot / denom;\n}\n/**\n* Apply temporal decay to a similarity score.\n* More recent priors have higher weight; old priors decay toward zero.\n*/\nfunction applyTemporalDecay(similarity, priorCreatedAt) {\n\tif (!priorCreatedAt) return similarity;\n\treturn similarity * .5 ** ((Date.now() - new Date(priorCreatedAt).getTime()) / (1e3 * 60 * 60 * 24) / DECAY_HALF_LIFE_DAYS);\n}\n/**\n* Deserialize a Float32 embedding from a SQLite BLOB Buffer.\n*/\nfunction bufferToFloat32Array(buf) {\n\tconst floats = new Float32Array(buf.buffer, buf.byteOffset, buf.byteLength / 4);\n\treturn Array.from(floats);\n}\n/**\n* Fetch prior embeddings from brain_embeddings table for the given scope.\n*/\nfunction fetchPriorEmbeddings(nativeDb, excludeObsId, _project, _peerId) {\n\treturn nativeDb.prepare(`SELECT e.id, e.embedding, o.created_at\n       FROM brain_embeddings e\n       JOIN brain_observations o ON o.id = e.id\n       WHERE e.id != ?\n         AND e.embedding IS NOT NULL\n       ORDER BY o.created_at DESC\n       LIMIT ?`).all(excludeObsId, MAX_PRIOR_EMBEDDINGS).filter((r) => r.embedding !== null && r.embedding.byteLength > 0).map((r) => ({\n\t\tid: r.id,\n\t\tembedding: bufferToFloat32Array(r.embedding),\n\t\tcreatedAt: r.created_at\n\t}));\n}\n/**\n* Compute a Bayesian surprisal score for a single observation.\n*\n* Returns a value in [0.0, 1.0]:\n*   - >0.7 → novel (high surprisal) — high consolidation priority\n*   - <0.3 → redundant (low surprisal) — skip or merge\n*   - 0.5  → neutral (no embeddings available)\n*\n* Degrades gracefully when embeddings are unavailable:\n* returns NEUTRAL_SURPRISAL (0.5) with a console.warn, never throws.\n*\n* @param observation - The observation to score (must include embedding if available).\n* @param options     - Scope, db injection for tests.\n* @returns SurprisalResult with score and diagnostics.\n*\n* @task T1146\n*/\nfunction computeSurprisalScore(observation, options = {}) {\n\tconst { db: injectedDb, project = null, peerId = \"global\" } = options;\n\tconst nativeDb = injectedDb !== void 0 ? injectedDb : getBrainNativeDb();\n\tif (!observation.embedding || observation.embedding.length === 0) {\n\t\tif (!nativeDb) console.warn(\"[surprisal] No database available; returning neutral score.\");\n\t\treturn {\n\t\t\tid: observation.id,\n\t\t\tscore: NEUTRAL_SURPRISAL,\n\t\t\tembeddingAvailable: false\n\t\t};\n\t}\n\tif (!nativeDb) {\n\t\tconsole.warn(\"[surprisal] Database not initialized; returning neutral score.\");\n\t\treturn {\n\t\t\tid: observation.id,\n\t\t\tscore: NEUTRAL_SURPRISAL,\n\t\t\tembeddingAvailable: false\n\t\t};\n\t}\n\ttry {\n\t\tconst priors = fetchPriorEmbeddings(nativeDb, observation.id, project, peerId);\n\t\tif (priors.length === 0) return {\n\t\t\tid: observation.id,\n\t\t\tscore: MAX_SURPRISAL,\n\t\t\tembeddingAvailable: true,\n\t\t\tmaxSimilarity: 0\n\t\t};\n\t\tlet maxDecayedSimilarity = 0;\n\t\tlet mostSimilarId;\n\t\tfor (const prior of priors) {\n\t\t\tconst decayedSim = applyTemporalDecay(cosineSimilarity(observation.embedding, prior.embedding), prior.createdAt);\n\t\t\tif (decayedSim > maxDecayedSimilarity) {\n\t\t\t\tmaxDecayedSimilarity = decayedSim;\n\t\t\t\tmostSimilarId = prior.id;\n\t\t\t}\n\t\t}\n\t\tlet score;\n\t\tif (maxDecayedSimilarity >= HIGH_SIMILARITY_THRESHOLD) score = MIN_SURPRISAL + (1 - maxDecayedSimilarity) * .3;\n\t\telse if (maxDecayedSimilarity <= LOW_SIMILARITY_THRESHOLD) score = .7 + (1 - maxDecayedSimilarity) * .3;\n\t\telse score = .7 - (maxDecayedSimilarity - LOW_SIMILARITY_THRESHOLD) / (HIGH_SIMILARITY_THRESHOLD - LOW_SIMILARITY_THRESHOLD) * .4;\n\t\tscore = Math.max(MIN_SURPRISAL, Math.min(MAX_SURPRISAL, score));\n\t\treturn {\n\t\t\tid: observation.id,\n\t\t\tscore,\n\t\t\tembeddingAvailable: true,\n\t\t\tmostSimilarId,\n\t\t\tmaxSimilarity: maxDecayedSimilarity\n\t\t};\n\t} catch (err) {\n\t\tconsole.warn(\"[surprisal] Error computing score; returning neutral:\", err);\n\t\treturn {\n\t\t\tid: observation.id,\n\t\t\tscore: NEUTRAL_SURPRISAL,\n\t\t\tembeddingAvailable: false\n\t\t};\n\t}\n}\n/**\n* Compute surprisal scores for a batch of observations, sorted descending.\n*\n* High-surprisal observations are returned first — they should be processed\n* by the dreamer first (bypass normal rate limit).\n*\n* @param observations - Batch to score.\n* @param options      - Scope, db injection.\n* @returns Sorted array with highest surprisal first.\n*\n* @task T1146\n*/\nfunction computeSurprisalBatch(observations, options = {}) {\n\treturn observations.map((obs) => computeSurprisalScore(obs, options)).sort((a, b) => b.score - a.score);\n}\n//#endregion\nexport { NEUTRAL_SURPRISAL, computeSurprisalBatch, computeSurprisalScore };\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACG,IAAC,iBAAiB,GAAG;AACxB;AACA,IAAI,aAAa,GAAG,CAAC;AACrB;AACA,IAAI,aAAa,GAAG,CAAC;AACrB;AACA;AACA;AACA;AACA,IAAI,yBAAyB,GAAG,GAAG;AACnC;AACA;AACA;AACA;AACA,IAAI,wBAAwB,GAAG,GAAG;AAClC;AACA,IAAI,oBAAoB,GAAG,EAAE;AAC7B;AACA,IAAI,oBAAoB,GAAG,EAAE;AAC7B;AACA;AACA;AACA;AACA,SAAS,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE;AAChC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,CAAC;AACtD,CAAC,IAAI,GAAG,GAAG,CAAC;AACZ,CAAC,IAAI,KAAK,GAAG,CAAC;AACd,CAAC,IAAI,KAAK,GAAG,CAAC;AACd,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACpC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAClC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;AAC3B,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;AAC3B,CAAC;AACD,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;AAClD,CAAC,OAAO,KAAK,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,KAAK;AACrC;AACA;AACA;AACA;AACA;AACA,SAAS,kBAAkB,CAAC,UAAU,EAAE,cAAc,EAAE;AACxD,CAAC,IAAI,CAAC,cAAc,EAAE,OAAO,UAAU;AACvC,CAAC,OAAO,UAAU,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,OAAO,EAAE,KAAK,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,oBAAoB,CAAC;AAC5H;AACA;AACA;AACA;AACA,SAAS,oBAAoB,CAAC,GAAG,EAAE;AACnC,CAAC,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC;AAChF,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;AAC1B;AACA;AACA;AACA;AACA,SAAS,oBAAoB,CAAC,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE;AACzE,CAAC,OAAO,QAAQ,CAAC,OAAO,CAAC,CAAC;AAC1B;AACA;AACA;AACA;AACA;AACA,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,YAAY,EAAE,oBAAoB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,KAAK,IAAI,IAAI,CAAC,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM;AACvI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE;AACV,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC,CAAC,SAAS,CAAC;AAC9C,EAAE,SAAS,EAAE,CAAC,CAAC;AACf,EAAE,CAAC,CAAC;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,qBAAqB,CAAC,WAAW,EAAE,OAAO,GAAG,EAAE,EAAE;AAC1D,CAAC,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,OAAO,GAAG,IAAI,EAAE,MAAM,GAAG,QAAQ,EAAE,GAAG,OAAO;AACtE,CAAC,MAAM,QAAQ,GAAG,UAAU,KAAK,MAAM,GAAG,UAAU,GAAG,gBAAgB,EAAE;AACzE,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,IAAI,WAAW,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;AACnE,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,CAAC,6DAA6D,CAAC;AAC5F,EAAE,OAAO;AACT,GAAG,EAAE,EAAE,WAAW,CAAC,EAAE;AACrB,GAAG,KAAK,EAAE,iBAAiB;AAC3B,GAAG,kBAAkB,EAAE;AACvB,GAAG;AACH,CAAC;AACD,CAAC,IAAI,CAAC,QAAQ,EAAE;AAChB,EAAE,OAAO,CAAC,IAAI,CAAC,gEAAgE,CAAC;AAChF,EAAE,OAAO;AACT,GAAG,EAAE,EAAE,WAAW,CAAC,EAAE;AACrB,GAAG,KAAK,EAAE,iBAAiB;AAC3B,GAAG,kBAAkB,EAAE;AACvB,GAAG;AACH,CAAC;AACD,CAAC,IAAI;AACL,EAAE,MAAM,MAAM,GAAG,oBAAoB,CAAC,QAAQ,EAAE,WAAW,CAAC,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC;AAChF,EAAE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO;AAClC,GAAG,EAAE,EAAE,WAAW,CAAC,EAAE;AACrB,GAAG,KAAK,EAAE,aAAa;AACvB,GAAG,kBAAkB,EAAE,IAAI;AAC3B,GAAG,aAAa,EAAE;AAClB,GAAG;AACH,EAAE,IAAI,oBAAoB,GAAG,CAAC;AAC9B,EAAE,IAAI,aAAa;AACnB,EAAE,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;AAC9B,GAAG,MAAM,UAAU,GAAG,kBAAkB,CAAC,gBAAgB,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC;AACnH,GAAG,IAAI,UAAU,GAAG,oBAAoB,EAAE;AAC1C,IAAI,oBAAoB,GAAG,UAAU;AACrC,IAAI,aAAa,GAAG,KAAK,CAAC,EAAE;AAC5B,GAAG;AACH,EAAE;AACF,EAAE,IAAI,KAAK;AACX,EAAE,IAAI,oBAAoB,IAAI,yBAAyB,EAAE,KAAK,GAAG,aAAa,GAAG,CAAC,CAAC,GAAG,oBAAoB,IAAI,EAAE;AAChH,OAAO,IAAI,oBAAoB,IAAI,wBAAwB,EAAE,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,oBAAoB,IAAI,EAAE;AACzG,OAAO,KAAK,GAAG,EAAE,GAAG,CAAC,oBAAoB,GAAG,wBAAwB,KAAK,yBAAyB,GAAG,wBAAwB,CAAC,GAAG,EAAE;AACnI,EAAE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;AACjE,EAAE,OAAO;AACT,GAAG,EAAE,EAAE,WAAW,CAAC,EAAE;AACrB,GAAG,KAAK;AACR,GAAG,kBAAkB,EAAE,IAAI;AAC3B,GAAG,aAAa;AAChB,GAAG,aAAa,EAAE;AAClB,GAAG;AACH,CAAC,CAAC,CAAC,OAAO,GAAG,EAAE;AACf,EAAE,OAAO,CAAC,IAAI,CAAC,uDAAuD,EAAE,GAAG,CAAC;AAC5E,EAAE,OAAO;AACT,GAAG,EAAE,EAAE,WAAW,CAAC,EAAE;AACrB,GAAG,KAAK,EAAE,iBAAiB;AAC3B,GAAG,kBAAkB,EAAE;AACvB,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,qBAAqB,CAAC,YAAY,EAAE,OAAO,GAAG,EAAE,EAAE;AAC3D,CAAC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,qBAAqB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;AACxG;;;;"}

package/studio-dist/server/chunks/surprisal-tree-7dfHsuw1.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"surprisal-tree-7dfHsuw1.js","sources":["../../../.svelte-kit/adapter-node/chunks/surprisal-tree.js"],"sourcesContent":["import { o as getBrainNativeDb } from \"./memory-sqlite.js\";\n//#region ../core/dist/memory/surprisal-tree.js\n/**\n* RPTree — Random Projection Tree for hierarchical memory clustering\n*\n* Implements a simplified Random Projection Tree (RPTree) that partitions\n* a set of observation embeddings into a hierarchical cluster structure.\n* Each leaf node contains a group of semantically-similar observations.\n*\n* Algorithm:\n*   1. Generate a random projection vector\n*   2. Compute dot products of all embeddings with the projection\n*   3. Split at the median (left = below, right = above)\n*   4. Recurse until min_leaf_size or max_depth is reached\n*\n* Trees are rebuilt each dream cycle (brain_memory_trees table is truncated\n* and repopulated). This is intentional — trees are a cache, not a source\n* of truth.\n*\n* Persistence: tree nodes are written to brain_memory_trees. The leaf node\n* id is written back to brain_observations.tree_id.\n*\n* @task T1146\n* @epic T1146\n*/\n/** Maximum tree depth. Prevents infinite recursion on tiny datasets. */\nvar MAX_DEPTH = 8;\n/** Minimum leaf size: stop splitting when a node has this many obs or fewer. */\nvar MIN_LEAF_SIZE = 3;\n/** Embedding dimension. Matches CLEO brain embeddings (OpenAI/Anthropic = 1536 or 768). */\nvar DEFAULT_EMBEDDING_DIM = 1536;\n/**\n* Generate a random unit vector of dimension `dim` using Box-Muller transform.\n*\n* Uses Math.random() (uniform [0,1)) rather than raw randomBytes Float32 bit\n* patterns — the previous implementation interpreted crypto byte sequences as\n* Float32 values, which can produce NaN/Infinity components that propagate\n* through dot products and corrupt the median split (T-spec-flake fix).\n*/\nfunction randomProjectionVector(dim) {\n\tconst result = [];\n\tlet norm = 0;\n\tfor (let i = 0; i < dim; i += 2) {\n\t\tconst u1 = Math.random() || 1e-300;\n\t\tconst u2 = Math.random();\n\t\tconst r = Math.sqrt(-2 * Math.log(u1));\n\t\tconst theta = 2 * Math.PI * u2;\n\t\tconst z0 = r * Math.cos(theta);\n\t\tconst z1 = r * Math.sin(theta);\n\t\tresult.push(z0);\n\t\tnorm += z0 * z0;\n\t\tif (i + 1 < dim) {\n\t\t\tresult.push(z1);\n\t\t\tnorm += z1 * z1;\n\t\t}\n\t}\n\tconst normSqrt = Math.sqrt(norm) || 1;\n\treturn result.map((v) => v / normSqrt);\n}\n/** Dot product of two equal-length arrays. */\nfunction dotProduct(a, b) {\n\tlet sum = 0;\n\tconst len = Math.min(a.length, b.length);\n\tfor (let i = 0; i < len; i++) sum += (a[i] ?? 0) * (b[i] ?? 0);\n\treturn sum;\n}\n/** Compute centroid (mean) of a set of embeddings. */\nfunction computeCentroid(embeddings) {\n\tif (embeddings.length === 0) return null;\n\tconst dim = embeddings[0]?.length ?? 0;\n\tconst centroid = new Array(dim).fill(0);\n\tfor (const emb of embeddings) for (let i = 0; i < dim; i++) centroid[i] = (centroid[i] ?? 0) + (emb[i] ?? 0);\n\treturn centroid.map((v) => v / embeddings.length);\n}\n/**\n* Recursively build an RPTree node for the given subset of observations.\n*/\nfunction buildNode(observations, depth, parentDbId, maxDepth, minLeafSize) {\n\tconst embeddings = observations.map((o) => o.embedding);\n\tconst centroid = computeCentroid(embeddings);\n\tif (observations.length <= minLeafSize || depth >= maxDepth) return {\n\t\tdepth,\n\t\tleafIds: observations.map((o) => o.id),\n\t\tcentroid,\n\t\tparentDbId,\n\t\tchildren: []\n\t};\n\tconst projVector = randomProjectionVector(embeddings[0]?.length ?? DEFAULT_EMBEDDING_DIM);\n\tconst projected = observations.map((obs) => ({\n\t\tobs,\n\t\tproj: dotProduct(obs.embedding, projVector)\n\t}));\n\tconst projValues = projected.map((p) => p.proj).sort((a, b) => a - b);\n\tconst median = projValues[Math.floor(projValues.length / 2)] ?? 0;\n\tconst left = projected.filter((p) => p.proj <= median).map((p) => p.obs);\n\tconst right = projected.filter((p) => p.proj > median).map((p) => p.obs);\n\tif (left.length === 0 || right.length === 0) return {\n\t\tdepth,\n\t\tleafIds: observations.map((o) => o.id),\n\t\tcentroid,\n\t\tparentDbId,\n\t\tchildren: []\n\t};\n\treturn {\n\t\tdepth,\n\t\tleafIds: [],\n\t\tcentroid,\n\t\tparentDbId,\n\t\tchildren: [buildNode(left, depth + 1, null, maxDepth, minLeafSize), buildNode(right, depth + 1, null, maxDepth, minLeafSize)]\n\t};\n}\n/**\n* Persist a tree node to the database and return its assigned id.\n* Recursively persists children, updating their parentDbId.\n*/\nfunction persistNode(node, nativeDb, parentDbId) {\n\tconst centroidJson = node.centroid ? JSON.stringify(node.centroid) : null;\n\tconst leafIdsJson = JSON.stringify(node.leafIds);\n\tconst now = (/* @__PURE__ */ new Date()).toISOString();\n\tconst result = nativeDb.prepare(`INSERT INTO brain_memory_trees (depth, leaf_ids, centroid, parent_id, created_at)\n       VALUES (?, ?, ?, ?, ?)`).run(node.depth, leafIdsJson, centroidJson, parentDbId, now);\n\tconst nodeId = Number(result.lastInsertRowid);\n\tfor (const child of node.children) persistNode(child, nativeDb, nodeId);\n\treturn nodeId;\n}\n/**\n* Collect all leaf nodes and their observation IDs for brain_observations update.\n*/\nfunction collectLeafAssignments(node, nodeId, nativeDb, assignments) {\n\tif (node.leafIds.length > 0) for (const obsId of node.leafIds) assignments.set(obsId, nodeId);\n\tif (node.children.length > 0) {\n\t\tconst children = nativeDb.prepare(`SELECT id, leaf_ids FROM brain_memory_trees WHERE parent_id = ?`).all(nodeId);\n\t\tfor (const childRow of children) {\n\t\t\tconst childLeafIds = JSON.parse(childRow.leaf_ids);\n\t\t\tif (childLeafIds.length > 0) for (const obsId of childLeafIds) assignments.set(obsId, childRow.id);\n\t\t}\n\t}\n}\n/**\n* Build a Random Projection Tree from a set of observations and persist it\n* to brain_memory_trees. Updates brain_observations.tree_id for all leaf members.\n*\n* Truncates existing brain_memory_trees rows before writing (trees are\n* rebuilt each dream cycle from scratch).\n*\n* Requires at least 2 observations. Returns early with zero counts if fewer\n* are provided.\n*\n* @param observations - Set of observations with embeddings to cluster.\n* @param options      - Depth/leaf config, db injection for tests.\n* @returns Build result with node/assignment counts.\n*\n* @task T1146\n*/\nfunction buildSurprisalTree(observations, options = {}) {\n\tconst { maxDepth = MAX_DEPTH, minLeafSize = MIN_LEAF_SIZE, db: injectedDb } = options;\n\tconst result = {\n\t\tnodesWritten: 0,\n\t\tobsAssigned: 0,\n\t\tactualMaxDepth: 0\n\t};\n\tconst eligible = observations.filter((o) => o.embedding.length > 0);\n\tif (eligible.length < 2) return result;\n\tconst nativeDb = injectedDb !== void 0 ? injectedDb : getBrainNativeDb();\n\tif (!nativeDb) {\n\t\tconsole.warn(\"[surprisal-tree] No database available; skipping tree build.\");\n\t\treturn result;\n\t}\n\ttry {\n\t\tnativeDb.exec(\"DELETE FROM brain_memory_trees\");\n\t\tconst rootNode = buildNode(eligible, 0, null, maxDepth, minLeafSize);\n\t\tconst rootId = persistNode(rootNode, nativeDb, null);\n\t\tresult.nodesWritten = nativeDb.prepare(\"SELECT COUNT(*) AS cnt FROM brain_memory_trees\").get()?.cnt ?? 0;\n\t\tresult.actualMaxDepth = nativeDb.prepare(\"SELECT MAX(depth) AS maxd FROM brain_memory_trees\").get()?.maxd ?? 0;\n\t\tconst assignments = /* @__PURE__ */ new Map();\n\t\tcollectLeafAssignments(rootNode, rootId, nativeDb, assignments);\n\t\tconst leafRows = nativeDb.prepare(`SELECT id, leaf_ids FROM brain_memory_trees WHERE leaf_ids != '[]'`).all();\n\t\tfor (const leafRow of leafRows) {\n\t\t\tconst leafIds = JSON.parse(leafRow.leaf_ids);\n\t\t\tfor (const obsId of leafIds) assignments.set(obsId, leafRow.id);\n\t\t}\n\t\tfor (const [obsId, treeNodeId] of assignments) {\n\t\t\tnativeDb.prepare(\"UPDATE brain_observations SET tree_id = ? WHERE id = ?\").run(treeNodeId, obsId);\n\t\t\tresult.obsAssigned++;\n\t\t}\n\t\treturn result;\n\t} catch (err) {\n\t\tconsole.warn(\"[surprisal-tree] Error building tree:\", err);\n\t\treturn result;\n\t}\n}\n//#endregion\nexport { buildSurprisalTree };\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,SAAS,GAAG,CAAC;AACjB;AACA,IAAI,aAAa,GAAG,CAAC;AACrB;AACA,IAAI,qBAAqB,GAAG,IAAI;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,sBAAsB,CAAC,GAAG,EAAE;AACrC,CAAC,MAAM,MAAM,GAAG,EAAE;AAClB,CAAC,IAAI,IAAI,GAAG,CAAC;AACb,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;AAClC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,MAAM;AACpC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE;AAC1B,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AACxC,EAAE,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE;AAChC,EAAE,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;AAChC,EAAE,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;AAChC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;AACjB,EAAE,IAAI,IAAI,EAAE,GAAG,EAAE;AACjB,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE;AACnB,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;AAClB,GAAG,IAAI,IAAI,EAAE,GAAG,EAAE;AAClB,EAAE;AACF,CAAC;AACD,CAAC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AACtC,CAAC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC;AACvC;AACA;AACA,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B,CAAC,IAAI,GAAG,GAAG,CAAC;AACZ,CAAC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;AACzC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC/D,CAAC,OAAO,GAAG;AACX;AACA;AACA,SAAS,eAAe,CAAC,UAAU,EAAE;AACrC,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI;AACzC,CAAC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC;AACvC,CAAC,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxC,CAAC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC7G,CAAC,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;AAClD;AACA;AACA;AACA;AACA,SAAS,SAAS,CAAC,YAAY,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE;AAC3E,CAAC,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC;AACxD,CAAC,MAAM,QAAQ,GAAG,eAAe,CAAC,UAAU,CAAC;AAC7C,CAAC,IAAI,YAAY,CAAC,MAAM,IAAI,WAAW,IAAI,KAAK,IAAI,QAAQ,EAAE,OAAO;AACrE,EAAE,KAAK;AACP,EAAE,OAAO,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AACxC,EAAE,QAAQ;AACV,EAAE,UAAU;AACZ,EAAE,QAAQ,EAAE;AACZ,EAAE;AACF,CAAC,MAAM,UAAU,GAAG,sBAAsB,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,qBAAqB,CAAC;AAC1F,CAAC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM;AAC9C,EAAE,GAAG;AACL,EAAE,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,UAAU;AAC5C,EAAE,CAAC,CAAC;AACJ,CAAC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AACtE,CAAC,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAClE,CAAC,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;AACzE,CAAC,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;AACzE,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO;AACrD,EAAE,KAAK;AACP,EAAE,OAAO,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;AACxC,EAAE,QAAQ;AACV,EAAE,UAAU;AACZ,EAAE,QAAQ,EAAE;AACZ,EAAE;AACF,CAAC,OAAO;AACR,EAAE,KAAK;AACP,EAAE,OAAO,EAAE,EAAE;AACb,EAAE,QAAQ;AACV,EAAE,UAAU;AACZ,EAAE,QAAQ,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,CAAC,EAAE,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,CAAC;AAC9H,EAAE;AACF;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE;AACjD,CAAC,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI;AAC1E,CAAC,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC;AACjD,CAAC,MAAM,GAAG,GAAG,iBAAiB,IAAI,IAAI,EAAE,EAAE,WAAW,EAAE;AACvD,CAAC,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;AAClC,6BAA6B,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,CAAC;AAC3F,CAAC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC;AAC9C,CAAC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC;AACxE,CAAC,OAAO,MAAM;AACd;AACA;AACA;AACA;AACA,SAAS,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE;AACrE,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC;AAC9F,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;AAC/B,EAAE,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,+DAA+D,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;AAClH,EAAE,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE;AACnC,GAAG,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;AACrD,GAAG,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;AACrG,EAAE;AACF,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,kBAAkB,CAAC,YAAY,EAAE,OAAO,GAAG,EAAE,EAAE;AACxD,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,WAAW,GAAG,aAAa,EAAE,EAAE,EAAE,UAAU,EAAE,GAAG,OAAO;AACtF,CAAC,MAAM,MAAM,GAAG;AAChB,EAAE,YAAY,EAAE,CAAC;AACjB,EAAE,WAAW,EAAE,CAAC;AAChB,EAAE,cAAc,EAAE;AAClB,EAAE;AACF,CAAC,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;AACpE,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,OAAO,MAAM;AACvC,CAAC,MAAM,QAAQ,GAAG,UAAU,KAAK,MAAM,GAAG,UAAU,GAAG,gBAAgB,EAAE;AACzE,CAAC,IAAI,CAAC,QAAQ,EAAE;AAChB,EAAE,OAAO,CAAC,IAAI,CAAC,8DAA8D,CAAC;AAC9E,EAAE,OAAO,MAAM;AACf,CAAC;AACD,CAAC,IAAI;AACL,EAAE,QAAQ,CAAC,IAAI,CAAC,gCAAgC,CAAC;AACjD,EAAE,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,CAAC;AACtE,EAAE,MAAM,MAAM,GAAG,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC;AACtD,EAAE,MAAM,CAAC,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,gDAAgD,CAAC,CAAC,GAAG,EAAE,EAAE,GAAG,IAAI,CAAC;AAC1G,EAAE,MAAM,CAAC,cAAc,GAAG,QAAQ,CAAC,OAAO,CAAC,mDAAmD,CAAC,CAAC,GAAG,EAAE,EAAE,IAAI,IAAI,CAAC;AAChH,EAAE,MAAM,WAAW,mBAAmB,IAAI,GAAG,EAAE;AAC/C,EAAE,sBAAsB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,CAAC;AACjE,EAAE,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,kEAAkE,CAAC,CAAC,CAAC,GAAG,EAAE;AAC/G,EAAE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;AAClC,GAAG,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;AAC/C,GAAG,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;AAClE,EAAE;AACF,EAAE,KAAK,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,WAAW,EAAE;AACjD,GAAG,QAAQ,CAAC,OAAO,CAAC,wDAAwD,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC;AACpG,GAAG,MAAM,CAAC,WAAW,EAAE;AACvB,EAAE;AACF,EAAE,OAAO,MAAM;AACf,CAAC,CAAC,CAAC,OAAO,GAAG,EAAE;AACf,EAAE,OAAO,CAAC,IAAI,CAAC,uCAAuC,EAAE,GAAG,CAAC;AAC5D,EAAE,OAAO,MAAM;AACf,CAAC;AACD;;;;"}

package/studio-dist/server/chunks/system-resolver2-Bzhue_zQ.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"system-resolver2-Bzhue_zQ.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}