hippo-memory 1.44.0 → 1.46.0

package/dist/src/memory.js

@@ -1,425 +0,0 @@
-/**
- * Core data model for Hippo memory entries.
- * Based on the strength formula from PLAN.md.
- */
-import { randomUUID } from 'crypto';
-import { isDecayAblated, isOutcomeSlowAblated, isRecallBoostAblated, evalNow, } from './ablation.js';
-export var Layer;
-(function (Layer) {
-    Layer["Buffer"] = "buffer";
-    Layer["Episodic"] = "episodic";
-    Layer["Semantic"] = "semantic";
-    Layer["Trace"] = "trace";
-})(Layer || (Layer = {}));
-export const DECISION_HALF_LIFE_DAYS = 90;
-export const INCIDENT_HALF_LIFE_DAYS = 90;
-export const PROCESS_HALF_LIFE_DAYS = 90;
-export const POLICY_HALF_LIFE_DAYS = 90;
-export const SKILL_HALF_LIFE_DAYS = 90;
-export const PROJECT_BRIEF_HALF_LIFE_DAYS = 90;
-export const CUSTOMER_NOTE_HALF_LIFE_DAYS = 90;
-// Emotional multipliers from PLAN.md.
-//
-// v1.13.5 / J5 loss-aversion calibration (Lovallo-Kahneman TFAS empirics:
-// losses ~2x larger than equivalent gains). Defaults rebalanced:
-//   - positive (success-tagged): 1.3 -> 1.0
-//   - negative (error-tagged):   1.5 -> 2.0
-//   - critical stays at 2.0 (literal roadmap reading; J5 silent on critical;
-//     ranking signal in consolidate.ts/salience.ts/ambient.ts unchanged)
-//   - neutral stays at 1.0
-//
-// `negative` is further scaled per-process by HIPPO_LOSS_AVERSION_RATIO
-// (env var, default 1.0; see getLossAversionRatio + applyLossAversionRatio).
-const EMOTIONAL_MULTIPLIERS = {
-    neutral: 1.0,
-    positive: 1.0,
-    negative: 2.0, // error-tagged
-    critical: 2.0,
-};
-/**
- * v1.13.5 / J5 — module-level lazy-cached read of HIPPO_LOSS_AVERSION_RATIO.
- *
- * `calculateStrength` is called per-entry inside hot recall loops
- * (api.ts/consolidate.ts/search.ts), so a per-call `process.env` lookup
- * would multiply N entries by M recalls of lookup cost. Lazy module-cache
- * reads the env ONCE on first call and memoizes for the process lifetime.
- * Test isolation via `_resetLossAversionRatioCacheForTests()` below.
- */
-/**
- * v1.13.5 minimum acceptable ratio. Below this, the negative multiplier
- * (2.0 * ratio) becomes small enough that calculateStrength * decay can fall
- * below `DECAY_THRESHOLD = 0.05` in `src/consolidate.ts:146`, which would
- * permanently delete non-pinned error-tagged memories on the next sleep
- * cycle. 0.5 is chosen as the floor because (a) it recovers the v1.13.4
- * effective multiplier (2.0 * 0.5 = 1.0 + the negative premium, i.e. 1.5x
- * the v1.13.4 default), and (b) below this the user is asking for LESS
- * loss aversion than has ever shipped — that's outside the supported
- * tuning range. See codex-review-critic round 1 P1.
- */
-const LOSS_AVERSION_RATIO_MIN = 0.5;
-/**
- * Validation policy (v1.13.5 + independent-review round-1 HIGH + codex
- * round-1 P1 folds):
- *   - Valid: finite numbers >= 0.5.
- *   - Invalid (silent fallback to 1.0): empty string, non-numeric,
- *     numbers below 0.5 (including 0 and negatives), NaN, +/-Infinity.
- *     Silent because opt-in env vars should not crash production recall
- *     on a typo.
- *
- * Why the 0.5 floor and not 0:
- *   - codex-review-critic round 1 P1: rejecting only `0` (the original
- *     HIGH fold) leaves the same silent data-loss surface for any ratio
- *     below ~0.025 (and worse for aged memories, where even ratio=0.25
- *     can produce strength < DECAY_THRESHOLD = 0.05 in consolidate.ts).
- *     Floor at the v1.13.4-equivalent (0.5) so the env var's tuning
- *     range never crosses into the deletion regime.
- *   - Users wanting LESS loss aversion than v1.13.4's 1.5 multiplier
- *     should reconsider the design intent of J5 (the calibration was
- *     toward MORE loss aversion, not less). If a future use case
- *     genuinely needs ratio < 0.5, the right path is a separate
- *     `HIPPO_NEGATIVE_MULTIPLIER` env override (deferred to J5-v2).
- */
-let _lossAversionRatioCache;
-function getLossAversionRatio() {
-    if (_lossAversionRatioCache !== undefined)
-        return _lossAversionRatioCache;
-    const raw = process.env.HIPPO_LOSS_AVERSION_RATIO;
-    if (raw === undefined || raw === '') {
-        _lossAversionRatioCache = 1.0;
-        return 1.0;
-    }
-    const parsed = Number(raw);
-    // Finite + >= 0.5 floor. Anything below 0.5 silently falls back to 1.0
-    // to avoid the consolidation-deletion vector (see JSDoc above).
-    if (!Number.isFinite(parsed) || parsed < LOSS_AVERSION_RATIO_MIN) {
-        _lossAversionRatioCache = 1.0;
-        return 1.0;
-    }
-    _lossAversionRatioCache = parsed;
-    return parsed;
-}
-/**
- * Test-only helper. Tests that mutate `process.env.HIPPO_LOSS_AVERSION_RATIO`
- * MUST call this in BOTH `beforeEach` AND `afterEach`:
- *   - beforeEach: clear any stale cache from a previous test before setting
- *     the env var for this test.
- *   - afterEach: clear the cache so the next test (which may not set the env
- *     var) reads the clean default instead of this test's value.
- * See `tests/emotional-multipliers-j5.test.ts` for the canonical pattern.
- */
-export function _resetLossAversionRatioCacheForTests() {
-    _lossAversionRatioCache = undefined;
-}
-/**
- * Apply the loss-aversion ratio scalar to the `negative` multiplier ONLY.
- * Other valences (positive, critical, neutral) pass through unchanged.
- * `critical` is deliberately NOT scaled: J5 roadmap is silent on critical;
- * its multiplier is left alone so the calibration only touches the
- * specific empirical claim (TFAS 2x losses-vs-gains).
- */
-function applyLossAversionRatio(valence, baseMultiplier) {
-    if (valence !== 'negative')
-        return baseMultiplier;
-    return baseMultiplier * getLossAversionRatio();
-}
-/**
- * Compute the reward factor from cumulative outcome counts.
- *
- *   reward_ratio  = (positive - negative) / (positive + negative + 1)
- *   reward_factor = 1 + 0.5 * reward_ratio
- *
- * Range: (0.5, 1.5). Neutral (no outcomes) returns 1.0.
- * Modulates effective half-life: memories with consistent positive outcomes
- * decay slower; consistent negative outcomes decay faster.
- */
-export function calculateRewardFactor(entry) {
-    // EVAL-ONLY ablation (see ablation.ts): the slow outcome channel.
-    if (isOutcomeSlowAblated())
-        return 1.0;
-    const pos = entry.outcome_positive ?? 0;
-    const neg = entry.outcome_negative ?? 0;
-    if (pos === 0 && neg === 0)
-        return 1.0;
-    const ratio = (pos - neg) / (pos + neg + 1);
-    return 1 + 0.5 * ratio;
-}
-/**
- * Calculate current strength at a given time.
- * strength(t) = base_strength * decay * retrieval_boost * emotional_multiplier
- *
- * Decay basis modes:
- * - clock: classic wall-clock decay (daysSince / halfLife)
- * - session: decay by sleep cycles instead of days (sessionsSince / halfLife)
- * - adaptive: wall-clock decay with half-life scaled by session frequency
- *
- * Pinned memories always return 1.0 (no decay).
- */
-export function calculateStrength(entry, 
-// evalNow(): the real clock unless HIPPO_FAKE_NOW is set (eval-only,
-// simulated-time protocols; see ablation.ts). Explicit `now` always wins.
-now = evalNow(), options = {}) {
-    if (entry.pinned)
-        return 1.0;
-    // EVAL-ONLY ablation (see ablation.ts): with recall-strengthening ablated,
-    // anchor decay at CREATION, not last_retrieved. A never-strengthened memory
-    // decays from when it was made; using last_retrieved would let clock resets
-    // persisted by PRIOR unflagged runs leak strengthening into an ablated
-    // arm's rankings (codex P2). Identity on fresh stores (created ==
-    // last_retrieved at write). Prior-run half_life increments are NOT
-    // reconstructed - see the ablation.ts caveat (fresh stores per arm).
-    const lastRetrieved = new Date(isRecallBoostAblated() ? entry.created : entry.last_retrieved);
-    const daysSince = (now.getTime() - lastRetrieved.getTime()) / (1000 * 60 * 60 * 24);
-    // Reward-proportional half-life modulation
-    const rewardFactor = calculateRewardFactor(entry);
-    let effectiveHalfLife = entry.half_life_days * rewardFactor;
-    // Guard: zero half-life causes 0/0 = NaN in the exponent
-    if (effectiveHalfLife <= 0)
-        return 0.0;
-    const basis = options.decayBasis ?? 'clock';
-    let decayExponent;
-    if (basis === 'session') {
-        // Decay by session count: each sleep cycle = 1 "day" in the decay formula.
-        // Estimate sessions since last retrieval from wall-clock time and avg interval.
-        const avgInterval = options.avgSessionIntervalDays ?? 1;
-        const sessionsSince = avgInterval > 0 ? Math.max(0, daysSince / avgInterval) : daysSince;
-        decayExponent = sessionsSince / effectiveHalfLife;
-    }
-    else if (basis === 'adaptive') {
-        // Scale half-life by session frequency: infrequent agents get longer half-lives
-        const avgInterval = options.avgSessionIntervalDays ?? 0;
-        if (avgInterval > 1) {
-            effectiveHalfLife *= avgInterval;
-        }
-        decayExponent = daysSince / effectiveHalfLife;
-    }
-    else {
-        // clock: classic wall-clock decay
-        decayExponent = daysSince / effectiveHalfLife;
-    }
-    // EVAL-ONLY ablation (see ablation.ts): decay term := 1. NOTE the [0,1]
-    // clamp below then caps retrievalBoost at baseline - see ablation.ts
-    // formula note.
-    const decay = isDecayAblated() ? 1.0 : Math.pow(0.5, decayExponent);
-    // Retrieval boost: 1 + 0.1 * log2(retrieval_count + 1)
-    // EVAL-ONLY ablation (see ablation.ts): the recall-boost flag neutralizes
-    // the READ side too, so a store with PRIOR retrieval history (counts > 0
-    // written before the flag was set) does not leak strengthening into an
-    // ablated arm's rankings (codex P2).
-    const retrievalBoost = isRecallBoostAblated()
-        ? 1.0
-        : 1 + 0.1 * Math.log2(entry.retrieval_count + 1);
-    // Emotional multiplier
-    // v1.13.5 / J5: apply HIPPO_LOSS_AVERSION_RATIO to the negative multiplier
-    // ONLY (positive/critical/neutral pass through unchanged). Lazy module-cache
-    // means this is a single Map lookup + one numeric multiply, not a per-call
-    // process.env read.
-    const baseMultiplier = EMOTIONAL_MULTIPLIERS[entry.emotional_valence] ?? 1.0;
-    const emotionalMultiplier = applyLossAversionRatio(entry.emotional_valence, baseMultiplier);
-    const raw = decay * retrievalBoost * emotionalMultiplier;
-    // Clamp to [0, 1] with NaN guard
-    const clamped = Math.min(1.0, Math.max(0.0, raw));
-    return Number.isFinite(clamped) ? clamped : 0.0;
-}
-/**
- * Derive half-life based on signals, as per PLAN.md table.
- */
-export function deriveHalfLife(base, entry) {
-    let hl = base;
-    // Error-tagged: 2x half-life
-    if (entry.tags?.includes('error')) {
-        hl *= 2;
-    }
-    // High schema fit: consolidates faster (1.5x)
-    if (entry.schema_fit !== undefined && entry.schema_fit > 0.7) {
-        hl *= 1.5;
-    }
-    // Low schema fit: decay faster (0.5x)
-    if (entry.schema_fit !== undefined && entry.schema_fit < 0.3) {
-        hl *= 0.5;
-    }
-    return hl;
-}
-/**
- * Apply outcome feedback to a memory entry.
- *
- * Increments outcome_positive or outcome_negative counters.
- * The reward factor in calculateStrength() uses these counts to
- * continuously modulate the effective half-life:
- *   reward_ratio  = (pos - neg) / (pos + neg + 1)
- *   reward_factor = 1 + 0.5 * reward_ratio    // range (0.5, 1.5)
- *   effective_hl  = half_life_days * reward_factor
- *
- * No fixed half-life delta. Decay rate adjusts proportionally to
- * cumulative reward signal, inspired by R-STDP in spiking networks.
- */
-export function applyOutcome(entry, good) {
-    const updated = {
-        ...entry,
-        outcome_score: good ? 1 : -1,
-        outcome_positive: (entry.outcome_positive ?? 0) + (good ? 1 : 0),
-        outcome_negative: (entry.outcome_negative ?? 0) + (good ? 0 : 1),
-    };
-    updated.strength = calculateStrength(updated);
-    return updated;
-}
-/**
- * Generate a random memory ID using crypto.randomUUID().
- */
-export function generateId(prefix = 'mem') {
-    return `${prefix}_${randomUUID().replace(/-/g, '').slice(0, 12)}`;
-}
-// Pinned and verified are exempt from ageing by policy, so this reads "aged out
-// for trust purposes", not "old". The 30-day threshold lives here and nowhere else.
-function isAgedOut(entry, now) {
-    if (entry.pinned || entry.confidence === 'verified')
-        return false;
-    const lastRetrieved = new Date(entry.last_retrieved);
-    return (now.getTime() - lastRetrieved.getTime()) / (1000 * 60 * 60 * 24) > 30;
-}
-export function confidenceFacets(entry, now = evalNow()) {
-    return { tier: entry.confidence, agedOut: isAgedOut(entry, now) };
-}
-// `warn` covers exactly the rows the old collapsed-value rule did: an aged-out row
-// used to read 'stale', so warning on it separately keeps the same set.
-export function confidenceLabel(entry, now = evalNow()) {
-    const { tier, agedOut } = confidenceFacets(entry, now);
-    return {
-        text: agedOut ? `${tier}, aged` : tier,
-        warn: agedOut || tier === 'stale' || tier === 'inferred',
-    };
-}
-/**
- * Resolve the effective confidence for a memory entry.
- * If the entry has not been retrieved in 30+ days and is not 'verified',
- * returns 'stale'. Otherwise returns the stored confidence value.
- */
-export function resolveConfidence(entry, now = evalNow()) {
-    return isAgedOut(entry, now) ? 'stale' : entry.confidence;
-}
-/**
- * Create a new memory entry with defaults.
- */
-export function createMemory(content, options = {}) {
-    const trimmed = content.trim();
-    if (trimmed.length < 3) {
-        throw new Error(`Memory content too short (${trimmed.length} chars, minimum 3): "${trimmed}"`);
-    }
-    const validOutcomes = ['success', 'failure', 'partial', null];
-    if (options.trace_outcome !== undefined && !validOutcomes.includes(options.trace_outcome)) {
-        throw new Error(`Invalid trace_outcome: ${options.trace_outcome}. Must be 'success', 'failure', 'partial', or null.`);
-    }
-    const now = evalNow().toISOString(); // honors HIPPO_FAKE_NOW (eval-only)
-    const layer = options.layer ?? Layer.Episodic;
-    const tags = options.tags ?? [];
-    const emotional_valence = options.emotional_valence ?? inferValence(tags);
-    const schema_fit = options.schema_fit ?? 0.5;
-    const partial = { tags, schema_fit };
-    const half_life_days = deriveHalfLife(options.baseHalfLifeDays ?? 7, partial);
-    const entry = {
-        id: generateId(layer === Layer.Semantic ? 'sem' : 'mem'),
-        created: now,
-        last_retrieved: now,
-        retrieval_count: 0,
-        strength: 1.0,
-        half_life_days,
-        layer,
-        tags,
-        emotional_valence,
-        schema_fit,
-        source: options.source ?? 'cli',
-        outcome_score: null,
-        outcome_positive: 0,
-        outcome_negative: 0,
-        conflicts_with: [],
-        pinned: options.pinned ?? false,
-        confidence: options.confidence ?? 'verified',
-        content,
-        parents: [],
-        starred: false,
-        trace_outcome: options.trace_outcome ?? null,
-        source_session_id: options.source_session_id ?? null,
-        valid_from: options.valid_from ?? now,
-        superseded_by: null,
-        extracted_from: options.extracted_from ?? null,
-        dag_level: options.dag_level ?? 0,
-        dag_parent_id: options.dag_parent_id ?? null,
-        kind: options.kind ?? 'distilled',
-        scope: options.scope ?? null,
-        owner: options.owner ?? null,
-        artifact_ref: options.artifact_ref ?? null,
-        tenantId: options.tenantId ?? 'default',
-    };
-    // Recalculate strength with the emotional multiplier applied
-    entry.strength = calculateStrength(entry);
-    return entry;
-}
-/**
- * Compute how well new content fits existing knowledge patterns.
- * Returns 0..1 where:
- *   >0.7 = high fit (consistent with existing knowledge, consolidates faster)
- *   0.3-0.7 = moderate fit
- *   <0.3 = novel (doesn't match existing patterns, decays faster if unused)
- *
- * Uses tag overlap (always available) weighted by how common each tag is.
- * Rare shared tags signal stronger schema fit than common ones.
- */
-export function computeSchemaFit(content, tags, existingEntries) {
-    if (existingEntries.length === 0)
-        return 0.5; // no schema yet, neutral
-    // Build tag frequency map across all existing entries
-    const tagFreq = new Map();
-    for (const entry of existingEntries) {
-        for (const tag of entry.tags) {
-            tagFreq.set(tag, (tagFreq.get(tag) ?? 0) + 1);
-        }
-    }
-    if (tags.length === 0 && tagFreq.size === 0)
-        return 0.5;
-    // Tag overlap: IDF-weighted Jaccard
-    // Shared rare tags matter more than shared common tags
-    let weightedOverlap = 0;
-    let totalWeight = 0;
-    const N = existingEntries.length;
-    for (const tag of tags) {
-        const freq = tagFreq.get(tag) ?? 0;
-        // IDF-weighted: rare shared tags score higher
-        const maxIdf = Math.log(N + 1) + 1;
-        if (freq > 0) {
-            const idf = Math.log(N / freq) + 1;
-            weightedOverlap += idf;
-        }
-        totalWeight += maxIdf;
-    }
-    // Scale so that matching half the tags at average IDF gives ~0.5
-    const tagScore = totalWeight > 0 ? Math.min(1, (weightedOverlap / totalWeight) * 2) : 0;
-    // Content overlap: check how many existing entries share significant tokens
-    const newTokens = new Set(content.toLowerCase().replace(/[^\w\s]/g, ' ').split(/\s+/).filter((t) => t.length > 3));
-    if (newTokens.size === 0)
-        return Math.min(1, Math.max(0, tagScore));
-    let contentMatches = 0;
-    for (const entry of existingEntries) {
-        const entryTokens = new Set(entry.content.toLowerCase().replace(/[^\w\s]/g, ' ').split(/\s+/).filter((t) => t.length > 3));
-        let shared = 0;
-        for (const token of newTokens) {
-            if (entryTokens.has(token))
-                shared++;
-        }
-        const overlap = shared / Math.max(newTokens.size, 1);
-        if (overlap > 0.2)
-            contentMatches++;
-    }
-    const contentScore = Math.min(1, contentMatches / Math.max(5, N * 0.1));
-    // Blend: 60% tag overlap, 40% content overlap
-    const fit = 0.6 * tagScore + 0.4 * contentScore;
-    return Math.min(1, Math.max(0, fit));
-}
-function inferValence(tags) {
-    if (tags.includes('critical'))
-        return 'critical';
-    if (tags.includes('error'))
-        return 'negative';
-    if (tags.includes('success') || tags.includes('win'))
-        return 'positive';
-    return 'neutral';
-}
-//# sourceMappingURL=memory.js.map

package/dist/src/memory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory.js","sourceRoot":"","sources":["../../src/memory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AACpC,OAAO,EACL,cAAc,EACd,oBAAoB,EACpB,oBAAoB,EACpB,OAAO,GACR,MAAM,eAAe,CAAC;AAEvB,MAAM,CAAN,IAAY,KAKX;AALD,WAAY,KAAK;IACf,0BAAiB,CAAA;IACjB,8BAAqB,CAAA;IACrB,8BAAqB,CAAA;IACrB,wBAAe,CAAA;AACjB,CAAC,EALW,KAAK,KAAL,KAAK,QAKhB;AAuHD,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAE1C,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAE1C,MAAM,CAAC,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAEzC,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAExC,MAAM,CAAC,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAEvC,MAAM,CAAC,MAAM,4BAA4B,GAAG,EAAE,CAAC;AAE/C,MAAM,CAAC,MAAM,4BAA4B,GAAG,EAAE,CAAC;AAE/C,sCAAsC;AACtC,EAAE;AACF,0EAA0E;AAC1E,iEAAiE;AACjE,4CAA4C;AAC5C,4CAA4C;AAC5C,6EAA6E;AAC7E,yEAAyE;AACzE,2BAA2B;AAC3B,EAAE;AACF,wEAAwE;AACxE,6EAA6E;AAC7E,MAAM,qBAAqB,GAAG;IAC5B,OAAO,EAAE,GAAG;IACZ,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,GAAG,EAAG,eAAe;IAC/B,QAAQ,EAAE,GAAG;CAC6B,CAAC;AAE7C;;;;;;;;GAQG;AAEH;;;;;;;;;;GAUG;AACH,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAEpC;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,IAAI,uBAA2C,CAAC;AAEhD,SAAS,oBAAoB;IAC3B,IAAI,uBAAuB,KAAK,SAAS;QAAE,OAAO,uBAAuB,CAAC;IAC1E,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,yBAAyB,CAAC;IAClD,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;QACpC,uBAAuB,GAAG,GAAG,CAAC;QAC9B,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,uEAAuE;IACvE,gEAAgE;IAChE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,uBAAuB,EAAE,CAAC;QACjE,uBAAuB,GAAG,GAAG,CAAC;QAC9B,OAAO,GAAG,CAAC;IACb,CAAC;IACD,uBAAuB,GAAG,MAAM,CAAC;IACjC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,oCAAoC;IAClD,uBAAuB,GAAG,SAAS,CAAC;AACtC,CAAC;AAED;;;;;;GAMG;AACH,SAAS,sBAAsB,CAC7B,OAAyB,EACzB,cAAsB;IAEtB,IAAI,OAAO,KAAK,UAAU;QAAE,OAAO,cAAc,CAAC;IAClD,OAAO,cAAc,GAAG,oBAAoB,EAAE,CAAC;AACjD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAkB;IACtD,kEAAkE;IAClE,IAAI,oBAAoB,EAAE;QAAE,OAAO,GAAG,CAAC;IACvC,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,IAAI,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,IAAI,CAAC,CAAC;IACxC,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACvC,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IAC5C,OAAO,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC;AACzB,CAAC;AAgBD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAkB;AAClB,qEAAqE;AACrE,0EAA0E;AAC1E,MAAY,OAAO,EAAE,EACrB,UAAwB,EAAE;IAE1B,IAAI,KAAK,CAAC,MAAM;QAAE,OAAO,GAAG,CAAC;IAE7B,2EAA2E;IAC3E,4EAA4E;IAC5E,4EAA4E;IAC5E,uEAAuE;IACvE,kEAAkE;IAClE,mEAAmE;IACnE,qEAAqE;IACrE,MAAM,aAAa,GAAG,IAAI,IAAI,CAC5B,oBAAoB,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,cAAc,CAC9D,CAAC;IACF,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAEpF,2CAA2C;IAC3C,MAAM,YAAY,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,iBAAiB,GAAG,KAAK,CAAC,cAAc,GAAG,YAAY,CAAC;IAE5D,yDAAyD;IACzD,IAAI,iBAAiB,IAAI,CAAC;QAAE,OAAO,GAAG,CAAC;IAEvC,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC;IAC5C,IAAI,aAAqB,CAAC;IAE1B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,2EAA2E;QAC3E,gFAAgF;QAChF,MAAM,WAAW,GAAG,OAAO,CAAC,sBAAsB,IAAI,CAAC,CAAC;QACxD,MAAM,aAAa,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACzF,aAAa,GAAG,aAAa,GAAG,iBAAiB,CAAC;IACpD,CAAC;SAAM,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;QAChC,gFAAgF;QAChF,MAAM,WAAW,GAAG,OAAO,CAAC,sBAAsB,IAAI,CAAC,CAAC;QACxD,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,iBAAiB,IAAI,WAAW,CAAC;QACnC,CAAC;QACD,aAAa,GAAG,SAAS,GAAG,iBAAiB,CAAC;IAChD,CAAC;SAAM,CAAC;QACN,kCAAkC;QAClC,aAAa,GAAG,SAAS,GAAG,iBAAiB,CAAC;IAChD,CAAC;IAED,wEAAwE;IACxE,qEAAqE;IACrE,gBAAgB;IAChB,MAAM,KAAK,GAAG,cAAc,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IAEpE,uDAAuD;IACvD,0EAA0E;IAC1E,yEAAyE;IACzE,uEAAuE;IACvE,qCAAqC;IACrC,MAAM,cAAc,GAAG,oBAAoB,EAAE;QAC3C,CAAC,CAAC,GAAG;QACL,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;IAEnD,uBAAuB;IACvB,2EAA2E;IAC3E,6EAA6E;IAC7E,2EAA2E;IAC3E,oBAAoB;IACpB,MAAM,cAAc,GAAG,qBAAqB,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC;IAC7E,MAAM,mBAAmB,GAAG,sBAAsB,CAAC,KAAK,CAAC,iBAAiB,EAAE,cAAc,CAAC,CAAC;IAE5F,MAAM,GAAG,GAAG,KAAK,GAAG,cAAc,GAAG,mBAAmB,CAAC;IAEzD,iCAAiC;IACjC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY,EAAE,KAA2B;IACtE,IAAI,EAAE,GAAG,IAAI,CAAC;IAEd,6BAA6B;IAC7B,IAAI,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAClC,EAAE,IAAI,CAAC,CAAC;IACV,CAAC;IAED,8CAA8C;IAC9C,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,IAAI,KAAK,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;QAC7D,EAAE,IAAI,GAAG,CAAC;IACZ,CAAC;IAED,sCAAsC;IACtC,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,IAAI,KAAK,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;QAC7D,EAAE,IAAI,GAAG,CAAC;IACZ,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,YAAY,CAAC,KAAkB,EAAE,IAAa;IAC5D,MAAM,OAAO,GAAgB;QAC3B,GAAG,KAAK;QACR,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,gBAAgB,EAAE,CAAC,KAAK,CAAC,gBAAgB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,gBAAgB,EAAE,CAAC,KAAK,CAAC,gBAAgB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACjE,CAAC;IACF,OAAO,CAAC,QAAQ,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;IAC9C,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,SAAiB,KAAK;IAC/C,OAAO,GAAG,MAAM,IAAI,UAAU,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;AACpE,CAAC;AAED,gFAAgF;AAChF,oFAAoF;AACpF,SAAS,SAAS,CAAC,KAAkB,EAAE,GAAS;IAC9C,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,UAAU,KAAK,UAAU;QAAE,OAAO,KAAK,CAAC;IAClE,MAAM,aAAa,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IACrD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;AAChF,CAAC;AAQD,MAAM,UAAU,gBAAgB,CAAC,KAAkB,EAAE,MAAY,OAAO,EAAE;IACxE,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;AACpE,CAAC;AAED,mFAAmF;AACnF,wEAAwE;AACxE,MAAM,UAAU,eAAe,CAAC,KAAkB,EAAE,MAAY,OAAO,EAAE;IACvE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACvD,OAAO;QACL,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI;QACtC,IAAI,EAAE,OAAO,IAAI,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,UAAU;KACzD,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAkB,EAAE,MAAY,OAAO,EAAE;IACzE,OAAO,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC;AAC5D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAC1B,OAAe,EACf,UAoBI,EAAE;IAEN,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAC/B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,6BAA6B,OAAO,CAAC,MAAM,wBAAwB,OAAO,GAAG,CAAC,CAAC;IACjG,CAAC;IAED,MAAM,aAAa,GAAsB,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IACjF,IAAI,OAAO,CAAC,aAAa,KAAK,SAAS,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;QAC1F,MAAM,IAAI,KAAK,CAAC,0BAA0B,OAAO,CAAC,aAAa,qDAAqD,CAAC,CAAC;IACxH,CAAC;IAED,MAAM,GAAG,GAAG,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,oCAAoC;IACzE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC;IAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;IAChC,MAAM,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;IAC1E,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;IAE7C,MAAM,OAAO,GAAyB,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;IAC3D,MAAM,cAAc,GAAG,cAAc,CAAC,OAAO,CAAC,gBAAgB,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;IAE9E,MAAM,KAAK,GAAgB;QACzB,EAAE,EAAE,UAAU,CAAC,KAAK,KAAK,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QACxD,OAAO,EAAE,GAAG;QACZ,cAAc,EAAE,GAAG;QACnB,eAAe,EAAE,CAAC;QAClB,QAAQ,EAAE,GAAG;QACb,cAAc;QACd,KAAK;QACL,IAAI;QACJ,iBAAiB;QACjB,UAAU;QACV,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,KAAK;QAC/B,aAAa,EAAE,IAAI;QACnB,gBAAgB,EAAE,CAAC;QACnB,gBAAgB,EAAE,CAAC;QACnB,cAAc,EAAE,EAAE;QAClB,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,KAAK;QAC/B,UAAU,EAAE,OAAO,CAAC,UAAU,IAAI,UAAU;QAC5C,OAAO;QACP,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,KAAK;QACd,aAAa,EAAE,OAAO,CAAC,aAAa,IAAI,IAAI;QAC5C,iBAAiB,EAAE,OAAO,CAAC,iBAAiB,IAAI,IAAI;QACpD,UAAU,EAAE,OAAO,CAAC,UAAU,IAAI,GAAG;QACrC,aAAa,EAAE,IAAI;QACnB,cAAc,EAAE,OAAO,CAAC,cAAc,IAAI,IAAI;QAC9C,SAAS,EAAE,OAAO,CAAC,SAAS,IAAI,CAAC;QACjC,aAAa,EAAE,OAAO,CAAC,aAAa,IAAI,IAAI;QAC5C,IAAI,EAAE,OAAO,CAAC,IAAI,IAAI,WAAW;QACjC,KAAK,EAAE,OAAO,CAAC,KAAK,IAAI,IAAI;QAC5B,KAAK,EAAE,OAAO,CAAC,KAAK,IAAI,IAAI;QAC5B,YAAY,EAAE,OAAO,CAAC,YAAY,IAAI,IAAI;QAC1C,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,SAAS;KACxC,CAAC;IAEF,6DAA6D;IAC7D,KAAK,CAAC,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC1C,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAC9B,OAAe,EACf,IAAc,EACd,eAA8B;IAE9B,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,CAAC,yBAAyB;IAEvE,sDAAsD;IACtD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAExD,oCAAoC;IACpC,uDAAuD;IACvD,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC;IAEjC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,8CAA8C;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAEnC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACnC,eAAe,IAAI,GAAG,CAAC;QACzB,CAAC;QACD,WAAW,IAAI,MAAM,CAAC;IACxB,CAAC;IAED,iEAAiE;IACjE,MAAM,QAAQ,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,eAAe,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAExF,4EAA4E;IAC5E,MAAM,SAAS,GAAG,IAAI,GAAG,CACvB,OAAO,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CACxF,CAAC;IAEF,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IAEpE,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,IAAI,GAAG,CACzB,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC9F,CAAC;QACF,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,MAAM,EAAE,CAAC;QACvC,CAAC;QACD,MAAM,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACrD,IAAI,OAAO,GAAG,GAAG;YAAE,cAAc,EAAE,CAAC;IACtC,CAAC;IAED,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAExE,8CAA8C;IAC9C,MAAM,GAAG,GAAG,GAAG,GAAG,QAAQ,GAAG,GAAG,GAAG,YAAY,CAAC;IAChD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,YAAY,CAAC,IAAc;IAClC,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;QAAE,OAAO,UAAU,CAAC;IACjD,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,UAAU,CAAC;IAC9C,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,UAAU,CAAC;IACxE,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/src/multihop.js

@@ -1,35 +0,0 @@
-import { search } from './search.js';
-export function multihopSearch(query, entries, options = {}) {
-    const pass1 = search(query, entries, { ...options, budget: (options.budget ?? 4000) * 2 });
-    const topK = pass1.slice(0, 10);
-    if (topK.length === 0)
-        return [];
-    const entityTags = new Set();
-    for (const r of topK) {
-        for (const tag of r.entry.tags) {
-            if (tag.startsWith('speaker:') || tag.startsWith('topic:')) {
-                entityTags.add(tag);
-            }
-        }
-    }
-    const queryLower = query.toLowerCase();
-    const newEntities = [...entityTags]
-        .map((t) => t.split(':')[1])
-        .filter((e) => !queryLower.includes(e.toLowerCase()));
-    if (newEntities.length === 0)
-        return pass1;
-    const followUpQuery = newEntities.join(' ') + ' ' + query;
-    const pass2 = search(followUpQuery, entries, options);
-    const merged = new Map();
-    for (const r of [...pass1, ...pass2]) {
-        const existing = merged.get(r.entry.id);
-        if (!existing || r.score > existing.score) {
-            merged.set(r.entry.id, r);
-        }
-    }
-    // T2 note: PLAIN stable score sort on purpose -- pass1/pass2 inputs are
-    // deterministically ordered (search() carries the content tail), stability
-    // inherits that, and ties keep pass-1 results ahead of pass-2 follow-ups.
-    return [...merged.values()].sort((a, b) => b.score - a.score);
-}
-//# sourceMappingURL=multihop.js.map

package/dist/src/multihop.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"multihop.js","sourceRoot":"","sources":["../../src/multihop.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAqB,MAAM,aAAa,CAAC;AAExD,MAAM,UAAU,cAAc,CAC5B,KAAa,EACb,OAAsB,EACtB,UAAgI,EAAE;IAElI,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC3F,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEhC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC/B,IAAI,GAAG,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3D,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IACvC,MAAM,WAAW,GAAG,CAAC,GAAG,UAAU,CAAC;SAChC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAExD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAE3C,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC;IAC1D,MAAM,KAAK,GAAG,MAAM,CAAC,aAAa,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAEtD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,wEAAwE;IACxE,2EAA2E;IAC3E,0EAA0E;IAC1E,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAChE,CAAC"}

package/dist/src/owner-validation.js

@@ -1,56 +0,0 @@
-/**
- * --owner format validation (B2 v1.12.6).
- *
- * Documented MEMORY_ENVELOPE.md contract: owner = `user:<id>` | `agent:<id>`
- * with id ∈ `[A-Za-z0-9_-]+`. Pre-v1.12.6 any string was accepted, leaving
- * the documented contract unenforced.
- *
- * Default: WARN-ONLY (log + accept) to preserve back-compat with existing
- * scripted callers passing legacy owner strings. Set `HIPPO_STRICT_OWNER=1`
- * to reject + exit. Strict mode will become the default once A5 v2 lands
- * (see `TODOS.md` A3 follow-ups for the migration path).
- */
-export const OWNER_RE = /^(user|agent):[A-Za-z0-9_-]+$/;
-export const OWNER_CONTRACT_HINT = 'Must match ^(user|agent):[A-Za-z0-9_-]+$ (e.g. user:alice, agent:capture-bot).';
-/**
- * Pure validator. Returns `{ ok, value, message }`. Does NOT print or
- * `process.exit`. The CLI wrapper below handles side effects so this is
- * unit-testable.
- *
- * Behaviour:
- *   - owner undefined → ok=true, value=undefined, no message.
- *   - owner matches OWNER_RE → ok=true, value=owner.
- *   - owner doesn't match + strict=false → ok=true, value=owner (accept),
- *     message contains the warning text.
- *   - owner doesn't match + strict=true → ok=false, value=owner (echoed),
- *     message contains the error text.
- */
-export function validateOwner(owner, opts = {}) {
-    if (owner === undefined || owner === null || owner === '') {
-        return { ok: true, value: undefined, message: '' };
-    }
-    if (OWNER_RE.test(owner)) {
-        return { ok: true, value: owner, message: '' };
-    }
-    if (opts.strict) {
-        return {
-            ok: false,
-            value: owner,
-            message: `Invalid --owner "${owner}". ${OWNER_CONTRACT_HINT}`,
-        };
-    }
-    return {
-        ok: true,
-        value: owner,
-        message: `[warn] --owner "${owner}" does not match the contract. ${OWNER_CONTRACT_HINT} ` +
-            `Accepting for back-compat; set HIPPO_STRICT_OWNER=1 to reject.`,
-    };
-}
-/**
- * Returns true when strict-owner enforcement is enabled via env var.
- * Centralised here so any future bump to default-strict is one edit.
- */
-export function isStrictOwnerEnv(env = process.env) {
-    return env.HIPPO_STRICT_OWNER === '1';
-}
-//# sourceMappingURL=owner-validation.js.map

package/dist/src/owner-validation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"owner-validation.js","sourceRoot":"","sources":["../../src/owner-validation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,MAAM,CAAC,MAAM,QAAQ,GAAG,+BAA+B,CAAC;AACxD,MAAM,CAAC,MAAM,mBAAmB,GAC9B,gFAAgF,CAAC;AAUnF;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAgC,EAChC,OAA6B,EAAE;IAE/B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE,EAAE,CAAC;QAC1D,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACrD,CAAC;IACD,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACjD,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,KAAK;YACZ,OAAO,EAAE,oBAAoB,KAAK,MAAM,mBAAmB,EAAE;SAC9D,CAAC;IACJ,CAAC;IACD,OAAO;QACL,EAAE,EAAE,IAAI;QACR,KAAK,EAAE,KAAK;QACZ,OAAO,EACL,mBAAmB,KAAK,kCAAkC,mBAAmB,GAAG;YAChF,gEAAgE;KACnE,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAyB,OAAO,CAAC,GAAG;IACnE,OAAO,GAAG,CAAC,kBAAkB,KAAK,GAAG,CAAC;AACxC,CAAC"}

package/dist/src/path-context.js

@@ -1,48 +0,0 @@
-/**
- * Extract meaningful path segments from a directory path.
- * Returns tags like ['path:src', 'path:api', 'path:my-project'].
- * Filters out noise (node_modules, .git, Users, home dirs, drive letters).
- */
-export function extractPathTags(dirPath) {
-    const normalized = dirPath.replace(/\\/g, '/');
-    const segments = normalized.split('/').filter(Boolean);
-    const noise = new Set([
-        'users', 'home', 'documents', 'desktop', 'downloads',
-        'node_modules', '.git', '.hippo', 'dist', 'build',
-        'c:', 'd:', 'tmp', 'temp', 'var', 'usr', 'opt', 'etc',
-        'appdata', 'local', 'roaming', 'program files', 'program files (x86)',
-    ]);
-    return segments
-        .filter(s => s.length >= 2 && !noise.has(s.toLowerCase()))
-        .slice(-4) // keep last 4 meaningful segments (most specific)
-        .map(s => `path:${s.toLowerCase()}`);
-}
-/**
- * Compute path overlap score between two sets of path tags.
- * Returns 0..1 where 1 = perfect match.
- * Normalizes by the MORE SPECIFIC side (the larger of the two tag sets),
- * so a memory carrying only a bare/generic path tag can no longer score a
- * full 1.0 against a deeply-nested cwd just because its own tiny tag set
- * is fully contained in the query's — genericity is no longer rewarded.
- */
-export function pathOverlapScore(memoryPathTags, currentPathTags) {
-    if (memoryPathTags.length === 0 || currentPathTags.length === 0)
-        return 0;
-    const memSet = new Set(memoryPathTags);
-    const matches = currentPathTags.filter(t => memSet.has(t)).length;
-    // Normalize by the more specific side (the larger tag set) — kills the
-    // genericity reward a memory-count-only normalization gave bare path tags.
-    return matches / Math.max(memoryPathTags.length, currentPathTags.length);
-}
-/** Weight applied to path overlap score when computing the recall boost multiplier. */
-export const PATH_BOOST_WEIGHT = 0.3;
-/**
- * Multiplier applied to a composite recall score for path locality.
- * Filters the memory's tags to path:* itself so call sites cannot drift.
- * Returns 1.0..1.3.
- */
-export function pathBoostMultiplier(memoryTags, currentPathTags) {
-    const memPathTags = memoryTags.filter(t => t.startsWith('path:'));
-    return 1.0 + pathOverlapScore(memPathTags, currentPathTags) * PATH_BOOST_WEIGHT;
-}
-//# sourceMappingURL=path-context.js.map

package/dist/src/path-context.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"path-context.js","sourceRoot":"","sources":["../../src/path-context.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,OAAe;IAC7C,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAEvD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC;QACpB,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW;QACpD,cAAc,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO;QACjD,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;QACrD,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,qBAAqB;KACtE,CAAC,CAAC;IAEH,OAAO,QAAQ;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;SACzD,KAAK,CAAC,CAAC,CAAC,CAAC,CAAE,kDAAkD;SAC7D,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,cAAwB,EAAE,eAAyB;IAClF,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE1E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,CAAC;IACvC,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAElE,uEAAuE;IACvE,2EAA2E;IAC3E,OAAO,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,MAAM,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC;AAC3E,CAAC;AAED,uFAAuF;AACvF,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAErC;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,UAAoB,EAAE,eAAyB;IACjF,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;IAClE,OAAO,GAAG,GAAG,gBAAgB,CAAC,WAAW,EAAE,eAAe,CAAC,GAAG,iBAAiB,CAAC;AAClF,CAAC"}

package/dist/src/physics-config.js

@@ -1,26 +0,0 @@
-/**
- * Physics engine configuration for Hippo memory-as-physics.
- * All constants are tunable; defaults calibrated for ~500 memory corpus.
- */
-export const DEFAULT_PHYSICS_CONFIG = {
-    enabled: 'auto',
-    G_query: 2.0,
-    G_memory: 0.01,
-    K_repulsion: 0.5,
-    drag: 0.3,
-    interference_gain: 0.3,
-    momentum_weight: 0.1,
-    max_velocity: 0.1,
-    dt: 0.1,
-    substeps: 5,
-    feedback_alpha: 0.01,
-    temperature_decay: 1.0,
-    cluster_threshold: 0.7,
-    cluster_top_k: 20,
-};
-export function mergePhysicsConfig(partial) {
-    if (!partial)
-        return { ...DEFAULT_PHYSICS_CONFIG };
-    return { ...DEFAULT_PHYSICS_CONFIG, ...partial };
-}
-//# sourceMappingURL=physics-config.js.map

package/dist/src/physics-config.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"physics-config.js","sourceRoot":"","sources":["../../src/physics-config.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAiCH,MAAM,CAAC,MAAM,sBAAsB,GAA4B;IAC7D,OAAO,EAAE,MAAM;IACf,OAAO,EAAE,GAAG;IACZ,QAAQ,EAAE,IAAI;IACd,WAAW,EAAE,GAAG;IAChB,IAAI,EAAE,GAAG;IACT,iBAAiB,EAAE,GAAG;IACtB,eAAe,EAAE,GAAG;IACpB,YAAY,EAAE,GAAG;IACjB,EAAE,EAAE,GAAG;IACP,QAAQ,EAAE,CAAC;IACX,cAAc,EAAE,IAAI;IACpB,iBAAiB,EAAE,GAAG;IACtB,iBAAiB,EAAE,GAAG;IACtB,aAAa,EAAE,EAAE;CAClB,CAAC;AAEF,MAAM,UAAU,kBAAkB,CAAC,OAAgC;IACjE,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,GAAG,sBAAsB,EAAE,CAAC;IACnD,OAAO,EAAE,GAAG,sBAAsB,EAAE,GAAG,OAAO,EAAE,CAAC;AACnD,CAAC"}