causantic 0.2.0 → 0.3.0

package/dist/storage/decay.js

@@ -1,276 +0,0 @@
-/**
- * Decay weight calculation for edges.
- * Supports both time-based decay (legacy) and vector clock-based decay.
- */
-import { hopCount, deserialize } from '../temporal/vector-clock.js';
-/**
- * Backward hop decay: Linear (dies@10)
- * Optimal for retrieving causally-related context 4-20 hops back.
- * MRR=0.688 (+35% vs exponential 0.80)
- */
-export const BACKWARD_HOP_DECAY = {
-    type: 'linear',
-    decayPerHop: 0.1, // weight = max(0, 1 - hops * 0.1), dies at 10 hops
-    minWeight: 0.01,
-};
-/**
- * Forward hop decay: Delayed linear (5-hop hold, dies@20)
- * Optimal for predicting future context 1-20 hops forward.
- * MRR=0.849 (+271% vs exponential 0.80)
- */
-export const FORWARD_HOP_DECAY = {
-    type: 'delayed-linear',
-    holdHops: 5, // Full weight for first 5 hops
-    decayPerHop: 0.067, // Then linear decay, dies at ~20 hops
-    minWeight: 0.01,
-};
-/**
- * Default vector decay configuration (legacy exponential).
- * @deprecated Use BACKWARD_HOP_DECAY or FORWARD_HOP_DECAY instead.
- */
-export const DEFAULT_VECTOR_DECAY = {
-    weightPerHop: 0.80,
-    minWeight: 0.01,
-};
-/**
- * Calculate hop-based decay weight using direction-specific curves.
- *
- * @param hops - Number of hops from reference point
- * @param config - Hop decay configuration
- * @returns Weight value (0 to 1), or 0 if below minWeight
- */
-export function calculateHopDecayWeight(hops, config) {
-    let weight;
-    switch (config.type) {
-        case 'exponential': {
-            const wph = config.weightPerHop ?? 0.80;
-            weight = Math.pow(wph, hops);
-            break;
-        }
-        case 'linear': {
-            const rate = config.decayPerHop ?? 0.1;
-            weight = Math.max(0, 1 - hops * rate);
-            break;
-        }
-        case 'delayed-linear': {
-            const hold = config.holdHops ?? 0;
-            const rate = config.decayPerHop ?? 0.067;
-            if (hops < hold) {
-                weight = 1;
-            }
-            else {
-                weight = Math.max(0, 1 - (hops - hold) * rate);
-            }
-            break;
-        }
-        default:
-            weight = 1;
-    }
-    return weight >= config.minWeight ? weight : 0;
-}
-/**
- * Calculate decay weight for an edge based on direction.
- *
- * @param edgeClock - Vector clock stamped on the edge
- * @param referenceClock - Current reference clock for the project
- * @param direction - Edge direction ('backward' or 'forward')
- * @returns Weight value (0 to 1), or 0 if below minWeight
- */
-export function calculateDirectionalDecayWeight(edgeClock, referenceClock, direction) {
-    const hops = hopCount(edgeClock, referenceClock);
-    const config = direction === 'backward' ? BACKWARD_HOP_DECAY : FORWARD_HOP_DECAY;
-    return calculateHopDecayWeight(hops, config);
-}
-/**
- * Calculate decay weight based on vector clock hop count.
- * @deprecated Use calculateDirectionalDecayWeight for direction-specific curves.
- *
- * @param edgeClock - Vector clock stamped on the edge
- * @param referenceClock - Current reference clock for the project
- * @param config - Vector decay configuration
- * @returns Weight value (0 to 1), or 0 if below minWeight
- */
-export function calculateVectorDecayWeight(edgeClock, referenceClock, config = DEFAULT_VECTOR_DECAY) {
-    const hops = hopCount(edgeClock, referenceClock);
-    const weight = Math.pow(config.weightPerHop, hops);
-    return weight >= config.minWeight ? weight : 0;
-}
-/**
- * Calculate decay weight with fallback for legacy edges.
- * Uses vector clock decay if available, falls back to time-based decay.
- *
- * @param edgeClockJson - JSON serialized vector clock (may be null for legacy edges)
- * @param referenceClock - Current reference clock for the project
- * @param direction - Edge direction for curve selection
- * @param createdAtMs - Edge creation time in milliseconds (for fallback)
- * @param queryTimeMs - Query time in milliseconds (for fallback)
- * @param timeConfig - Time-based decay configuration (for fallback)
- * @returns Computed weight value
- */
-export function calculateDecayWeightWithFallback(edgeClockJson, referenceClock, direction, createdAtMs, queryTimeMs, timeConfig) {
-    // Try vector clock decay first
-    if (edgeClockJson) {
-        const edgeClock = deserialize(edgeClockJson);
-        if (Object.keys(edgeClock).length > 0) {
-            return calculateDirectionalDecayWeight(edgeClock, referenceClock, direction);
-        }
-    }
-    // Fallback to time-based decay
-    return calculateDecayWeight(timeConfig, queryTimeMs - createdAtMs);
-}
-/**
- * @deprecated Use calculateDecayWeightWithFallback with direction parameter.
- */
-export function calculateDecayWeightWithFallbackLegacy(edgeClockJson, referenceClock, vectorConfig, createdAtMs, queryTimeMs, timeConfig) {
-    if (edgeClockJson) {
-        const edgeClock = deserialize(edgeClockJson);
-        if (Object.keys(edgeClock).length > 0) {
-            return calculateVectorDecayWeight(edgeClock, referenceClock, vectorConfig);
-        }
-    }
-    return calculateDecayWeight(timeConfig, queryTimeMs - createdAtMs);
-}
-/**
- * Calculate boosted weight for edges with multiple links.
- * Edges that have been created multiple times (same source/target pair)
- * get a boost to resist decay.
- *
- * @param baseWeight - Base weight after decay
- * @param linkCount - Number of times this edge was created
- * @returns Boosted weight
- */
-export function applyLinkBoost(baseWeight, linkCount) {
-    if (linkCount <= 1)
-        return baseWeight;
-    // Logarithmic boost: 5 links = ~1.16x, 10 links = ~1.23x
-    const boostFactor = 1 + Math.log(linkCount) * 0.1;
-    return baseWeight * boostFactor;
-}
-/**
- * Calculate the decay weight at a given age.
- * @param config - Decay model configuration
- * @param ageMs - Age of the edge in milliseconds
- * @returns Weight value (0 to initialWeight)
- */
-export function calculateDecayWeight(config, ageMs) {
-    if (ageMs < 0) {
-        return config.initialWeight ?? 1.0;
-    }
-    switch (config.type) {
-        case 'linear':
-            return calculateLinear(config, ageMs);
-        case 'delayed-linear':
-            return calculateDelayedLinear(config, ageMs);
-        case 'multi-linear':
-            return calculateMultiLinear(config, ageMs);
-        case 'exponential':
-            return calculateExponential(config, ageMs);
-        case 'power-law':
-            return calculatePowerLaw(config, ageMs);
-        default:
-            return config.initialWeight ?? 1.0;
-    }
-}
-/**
- * Simple linear decay: w(t) = w0 - rate * t
- */
-function calculateLinear(config, ageMs) {
-    const w0 = config.initialWeight ?? 1.0;
-    const rate = config.decayRate ?? 0;
-    const weight = w0 - rate * ageMs;
-    return Math.max(0, weight);
-}
-/**
- * Delayed linear: hold at w0 for holdPeriod, then linear decay.
- * w(t) = w0 if t < hold, else w0 - rate * (t - hold)
- */
-function calculateDelayedLinear(config, ageMs) {
-    const w0 = config.initialWeight ?? 1.0;
-    const hold = config.holdPeriodMs ?? 0;
-    const rate = config.decayRate ?? 0;
-    if (ageMs < hold) {
-        return w0;
-    }
-    const decayTime = ageMs - hold;
-    const weight = w0 - rate * decayTime;
-    return Math.max(0, weight);
-}
-/**
- * Multi-linear: sum of multiple decay tiers.
- * Each tier has its own hold period and decay rate.
- */
-function calculateMultiLinear(config, ageMs) {
-    const tiers = config.tiers ?? [];
-    let totalWeight = 0;
-    for (const tier of tiers) {
-        if (ageMs < tier.holdPeriodMs) {
-            totalWeight += tier.initialWeight;
-        }
-        else {
-            const decayTime = ageMs - tier.holdPeriodMs;
-            const weight = tier.initialWeight - tier.decayRatePerMs * decayTime;
-            totalWeight += Math.max(0, weight);
-        }
-    }
-    return totalWeight;
-}
-/**
- * Exponential decay: w(t) = w0 * e^(-rate * t)
- */
-function calculateExponential(config, ageMs) {
-    const w0 = config.initialWeight ?? 1.0;
-    const rate = config.decayRate ?? 0;
-    return w0 * Math.exp(-rate * ageMs);
-}
-/**
- * Power law decay: w(t) = w0 / (1 + k*t)^alpha
- */
-function calculatePowerLaw(config, ageMs) {
-    const w0 = config.initialWeight ?? 1.0;
-    const k = config.decayRate ?? 0;
-    const alpha = config.powerExponent ?? 1.0;
-    return w0 / Math.pow(1 + k * ageMs, alpha);
-}
-/**
- * Calculate the time when weight reaches zero (or null if asymptotic).
- */
-export function getDeathTime(config) {
-    switch (config.type) {
-        case 'linear': {
-            const w0 = config.initialWeight ?? 1.0;
-            const rate = config.decayRate ?? 0;
-            if (rate <= 0)
-                return null;
-            return w0 / rate;
-        }
-        case 'delayed-linear': {
-            const w0 = config.initialWeight ?? 1.0;
-            const hold = config.holdPeriodMs ?? 0;
-            const rate = config.decayRate ?? 0;
-            if (rate <= 0)
-                return null;
-            return hold + w0 / rate;
-        }
-        case 'multi-linear': {
-            const tiers = config.tiers ?? [];
-            if (tiers.length === 0)
-                return 0;
-            // Find the tier that dies last
-            let maxDeathTime = 0;
-            for (const tier of tiers) {
-                if (tier.decayRatePerMs <= 0)
-                    return null;
-                const deathTime = tier.holdPeriodMs + tier.initialWeight / tier.decayRatePerMs;
-                maxDeathTime = Math.max(maxDeathTime, deathTime);
-            }
-            return maxDeathTime;
-        }
-        case 'exponential':
-        case 'power-law':
-            // Asymptotic - never reaches exactly zero
-            return null;
-        default:
-            return null;
-    }
-}
-//# sourceMappingURL=decay.js.map

package/dist/storage/decay.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"decay.js","sourceRoot":"","sources":["../../src/storage/decay.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAoB,QAAQ,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AA+BtF;;;;GAIG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAmB;IAChD,IAAI,EAAE,QAAQ;IACd,WAAW,EAAE,GAAG,EAAE,mDAAmD;IACrE,SAAS,EAAE,IAAI;CAChB,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAmB;IAC/C,IAAI,EAAE,gBAAgB;IACtB,QAAQ,EAAE,CAAC,EAAE,+BAA+B;IAC5C,WAAW,EAAE,KAAK,EAAE,sCAAsC;IAC1D,SAAS,EAAE,IAAI;CAChB,CAAC;AAaF;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAsB;IACrD,YAAY,EAAE,IAAI;IAClB,SAAS,EAAE,IAAI;CAChB,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAY,EAAE,MAAsB;IAC1E,IAAI,MAAc,CAAC;IAEnB,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,IAAI,IAAI,CAAC;YACxC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC7B,MAAM;QACR,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,IAAI,GAAG,CAAC;YACvC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;YACtC,MAAM;QACR,CAAC;QACD,KAAK,gBAAgB,CAAC,CAAC,CAAC;YACtB,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,IAAI,KAAK,CAAC;YACzC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;gBAChB,MAAM,GAAG,CAAC,CAAC;YACb,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;YACjD,CAAC;YACD,MAAM;QACR,CAAC;QACD;YACE,MAAM,GAAG,CAAC,CAAC;IACf,CAAC;IAED,OAAO,MAAM,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACjD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,+BAA+B,CAC7C,SAAsB,EACtB,cAA2B,EAC3B,SAAwB;IAExB,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,iBAAiB,CAAC;IACjF,OAAO,uBAAuB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAC/C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,0BAA0B,CACxC,SAAsB,EACtB,cAA2B,EAC3B,SAA4B,oBAAoB;IAEhD,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IACnD,OAAO,MAAM,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACjD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gCAAgC,CAC9C,aAA4B,EAC5B,cAA2B,EAC3B,SAAwB,EACxB,WAAmB,EACnB,WAAmB,EACnB,UAA4B;IAE5B,+BAA+B;IAC/B,IAAI,aAAa,EAAE,CAAC;QAClB,MAAM,SAAS,GAAG,WAAW,CAAC,aAAa,CAAC,CAAC;QAC7C,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,OAAO,+BAA+B,CAAC,SAAS,EAAE,cAAc,EAAE,SAAS,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IAED,+BAA+B;IAC/B,OAAO,oBAAoB,CAAC,UAAU,EAAE,WAAW,GAAG,WAAW,CAAC,CAAC;AACrE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sCAAsC,CACpD,aAA4B,EAC5B,cAA2B,EAC3B,YAA+B,EAC/B,WAAmB,EACnB,WAAmB,EACnB,UAA4B;IAE5B,IAAI,aAAa,EAAE,CAAC;QAClB,MAAM,SAAS,GAAG,WAAW,CAAC,aAAa,CAAC,CAAC;QAC7C,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,OAAO,0BAA0B,CAAC,SAAS,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IACD,OAAO,oBAAoB,CAAC,UAAU,EAAE,WAAW,GAAG,WAAW,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,UAAkB,EAAE,SAAiB;IAClE,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,UAAU,CAAC;IACtC,yDAAyD;IACzD,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC;IAClD,OAAO,UAAU,GAAG,WAAW,CAAC;AAClC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAAwB,EAAE,KAAa;IAC1E,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,OAAO,MAAM,CAAC,aAAa,IAAI,GAAG,CAAC;IACrC,CAAC;IAED,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ;YACX,OAAO,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,KAAK,gBAAgB;YACnB,OAAO,sBAAsB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC/C,KAAK,cAAc;YACjB,OAAO,oBAAoB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC7C,KAAK,aAAa;YAChB,OAAO,oBAAoB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC7C,KAAK,WAAW;YACd,OAAO,iBAAiB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1C;YACE,OAAO,MAAM,CAAC,aAAa,IAAI,GAAG,CAAC;IACvC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,MAAwB,EAAE,KAAa;IAC9D,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,IAAI,GAAG,CAAC;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,GAAG,KAAK,CAAC;IACjC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAAC,MAAwB,EAAE,KAAa;IACrE,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,IAAI,GAAG,CAAC;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,IAAI,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;IAEnC,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC;QACjB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,GAAG,IAAI,CAAC;IAC/B,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,GAAG,SAAS,CAAC;IACrC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAAC,MAAwB,EAAE,KAAa;IACnE,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;IACjC,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YAC9B,WAAW,IAAI,IAAI,CAAC,aAAa,CAAC;QACpC,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;YAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;YACpE,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,MAAwB,EAAE,KAAa;IACnE,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,IAAI,GAAG,CAAC;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;IACnC,OAAO,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;AACtC,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,MAAwB,EAAE,KAAa;IAChE,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,IAAI,GAAG,CAAC;IACvC,MAAM,CAAC,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;IAChC,MAAM,KAAK,GAAG,MAAM,CAAC,aAAa,IAAI,GAAG,CAAC;IAC1C,OAAO,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,CAAC;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAAwB;IACnD,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,IAAI,GAAG,CAAC;YACvC,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;YACnC,IAAI,IAAI,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3B,OAAO,EAAE,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,KAAK,gBAAgB,CAAC,CAAC,CAAC;YACtB,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,IAAI,GAAG,CAAC;YACvC,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,IAAI,CAAC,CAAC;YACtC,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;YACnC,IAAI,IAAI,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3B,OAAO,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC;QAC1B,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACjC,+BAA+B;YAC/B,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,cAAc,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;gBAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC;gBAC/E,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;YACnD,CAAC;YACD,OAAO,YAAY,CAAC;QACtB,CAAC;QACD,KAAK,aAAa,CAAC;QACnB,KAAK,WAAW;YACd,0CAA0C;YAC1C,OAAO,IAAI,CAAC;QACd;YACE,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC"}

package/dist/storage/pruner.d.ts

@@ -1,111 +0,0 @@
-/**
- * Lazy pruning system for dead edges.
- * Edges with weight <= 0 at query time are queued for async deletion.
- * Chunks that lose all edges are marked for TTL-based cleanup (not deleted).
- *
- * Two pruning modes:
- * 1. Lazy: Queued during traversal, flushed after debounce
- * 2. Full: Background scan on startup, removes all dead edges
- *
- * Chunks remain in the database after losing edges so they can still be
- * found via vector and keyword search. Their vectors are marked orphaned
- * to start the TTL countdown; the cleanup-vectors task handles eventual
- * deletion of both vector and chunk after TTL expires.
- */
-/**
- * Pruner class for managing lazy deletion of dead edges.
- * Chunks that lose all edges are marked for TTL cleanup, not deleted.
- */
-declare class Pruner {
-    private pendingEdges;
-    private isRunning;
-    private flushTimeout;
-    private flushDelayMs;
-    /**
-     * Queue an edge for pruning.
-     * Called during edge traversal when weight <= 0.
-     */
-    queueEdgePrune(edgeId: string): void;
-    /**
-     * Queue multiple edges for pruning.
-     */
-    queueEdgePruneBatch(edgeIds: string[]): void;
-    /**
-     * Get count of pending edges.
-     */
-    getPendingCount(): number;
-    /**
-     * Force immediate flush (for testing or shutdown).
-     */
-    flushNow(): Promise<PruneResult>;
-    /**
-     * Schedule a debounced flush.
-     */
-    private scheduleFlush;
-    /**
-     * Execute the pruning operation.
-     */
-    private flush;
-    /**
-     * Set flush delay (for testing).
-     */
-    setFlushDelay(ms: number): void;
-    /**
-     * Check if pruner is currently running.
-     */
-    isActive(): boolean;
-    /**
-     * Clear pending queue without flushing (for testing).
-     */
-    clearPending(): void;
-    private fullPruneRunning;
-    private fullPruneProgress;
-    /**
-     * Start a full background prune (non-blocking).
-     * Scans all edges, removes dead ones, marks orphaned chunks for TTL.
-     * Idempotent - if already running, returns existing progress.
-     */
-    startBackgroundPrune(): FullPruneProgress;
-    /**
-     * Get current full prune progress (null if never started).
-     */
-    getFullPruneProgress(): FullPruneProgress | null;
-    /**
-     * Check if full prune is currently running.
-     */
-    isFullPruneRunning(): boolean;
-    /**
-     * Run the full prune operation.
-     * Scans all edges, calculates weights, removes dead edges, and marks
-     * chunks that lose all edges for TTL cleanup.
-     */
-    private runFullPrune;
-}
-/**
- * Result of a prune operation.
- */
-export interface PruneResult {
-    edgesDeleted: number;
-    chunksOrphaned: number;
-}
-/**
- * Progress of a full background prune.
- */
-export interface FullPruneProgress {
-    status: 'running' | 'completed' | 'error';
-    edgesScanned: number;
-    edgesDeleted: number;
-    chunksScanned: number;
-    chunksOrphaned: number;
-    startedAt: number;
-    completedAt: number | null;
-    error: string | null;
-}
-export { Pruner };
-export declare const pruner: Pruner;
-/**
- * Start background pruning on module load if environment variable is set.
- * This allows the MCP server or CLI to trigger startup pruning.
- */
-export declare function initStartupPrune(): FullPruneProgress;
-//# sourceMappingURL=pruner.d.ts.map

package/dist/storage/pruner.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"pruner.d.ts","sourceRoot":"","sources":["../../src/storage/pruner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAWH;;;GAGG;AACH,cAAM,MAAM;IACV,OAAO,CAAC,YAAY,CAA0B;IAC9C,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,YAAY,CAA8C;IAClE,OAAO,CAAC,YAAY,CAAQ;IAE5B;;;OAGG;IACH,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAKpC;;OAEG;IACH,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI;IAO5C;;OAEG;IACH,eAAe,IAAI,MAAM;IAIzB;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC,WAAW,CAAC;IAQtC;;OAEG;IACH,OAAO,CAAC,aAAa;IAarB;;OAEG;YACW,KAAK;IA+CnB;;OAEG;IACH,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAI/B;;OAEG;IACH,QAAQ,IAAI,OAAO;IAInB;;OAEG;IACH,YAAY,IAAI,IAAI;IAUpB,OAAO,CAAC,gBAAgB,CAAS;IACjC,OAAO,CAAC,iBAAiB,CAAkC;IAE3D;;;;OAIG;IACH,oBAAoB,IAAI,iBAAiB;IA6BzC;;OAEG;IACH,oBAAoB,IAAI,iBAAiB,GAAG,IAAI;IAIhD;;OAEG;IACH,kBAAkB,IAAI,OAAO;IAI7B;;;;OAIG;YACW,YAAY;CAwF3B;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,SAAS,GAAG,WAAW,GAAG,OAAO,CAAC;IAC1C,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB;AAGD,OAAO,EAAE,MAAM,EAAE,CAAC;AAGlB,eAAO,MAAM,MAAM,QAAe,CAAC;AAEnC;;;GAGG;AACH,wBAAgB,gBAAgB,IAAI,iBAAiB,CAEpD"}

package/dist/storage/pruner.js

@@ -1,280 +0,0 @@
-/**
- * Lazy pruning system for dead edges.
- * Edges with weight <= 0 at query time are queued for async deletion.
- * Chunks that lose all edges are marked for TTL-based cleanup (not deleted).
- *
- * Two pruning modes:
- * 1. Lazy: Queued during traversal, flushed after debounce
- * 2. Full: Background scan on startup, removes all dead edges
- *
- * Chunks remain in the database after losing edges so they can still be
- * found via vector and keyword search. Their vectors are marked orphaned
- * to start the TTL countdown; the cleanup-vectors task handles eventual
- * deletion of both vector and chunk after TTL expires.
- */
-import { deleteEdge, hasAnyEdges, getAllEdges } from './edge-store.js';
-import { vectorStore } from './vector-store.js';
-import { getReferenceClock } from './clock-store.js';
-import { calculateDirectionalDecayWeight } from './decay.js';
-import { deserialize } from '../temporal/vector-clock.js';
-import { createLogger } from '../utils/logger.js';
-const log = createLogger('pruner');
-/**
- * Pruner class for managing lazy deletion of dead edges.
- * Chunks that lose all edges are marked for TTL cleanup, not deleted.
- */
-class Pruner {
-    pendingEdges = new Set();
-    isRunning = false;
-    flushTimeout = null;
-    flushDelayMs = 1000;
-    /**
-     * Queue an edge for pruning.
-     * Called during edge traversal when weight <= 0.
-     */
-    queueEdgePrune(edgeId) {
-        this.pendingEdges.add(edgeId);
-        this.scheduleFlush();
-    }
-    /**
-     * Queue multiple edges for pruning.
-     */
-    queueEdgePruneBatch(edgeIds) {
-        for (const id of edgeIds) {
-            this.pendingEdges.add(id);
-        }
-        this.scheduleFlush();
-    }
-    /**
-     * Get count of pending edges.
-     */
-    getPendingCount() {
-        return this.pendingEdges.size;
-    }
-    /**
-     * Force immediate flush (for testing or shutdown).
-     */
-    async flushNow() {
-        if (this.flushTimeout) {
-            clearTimeout(this.flushTimeout);
-            this.flushTimeout = null;
-        }
-        return this.flush();
-    }
-    /**
-     * Schedule a debounced flush.
-     */
-    scheduleFlush() {
-        if (this.flushTimeout) {
-            return; // Already scheduled
-        }
-        this.flushTimeout = setTimeout(() => {
-            this.flushTimeout = null;
-            this.flush().catch((err) => {
-                log.error('Pruner flush error', { error: err instanceof Error ? err.message : String(err) });
-            });
-        }, this.flushDelayMs);
-    }
-    /**
-     * Execute the pruning operation.
-     */
-    async flush() {
-        if (this.isRunning || this.pendingEdges.size === 0) {
-            return { edgesDeleted: 0, chunksOrphaned: 0 };
-        }
-        this.isRunning = true;
-        const result = { edgesDeleted: 0, chunksOrphaned: 0 };
-        try {
-            const edgeIds = [...this.pendingEdges];
-            this.pendingEdges.clear();
-            // Track chunks that might lose all edges
-            const chunkIdsToCheck = new Set();
-            for (const edgeId of edgeIds) {
-                // Get edge info before deleting (we need source/target)
-                const { getEdgeById } = await import('./edge-store.js');
-                const edge = getEdgeById(edgeId);
-                if (!edge) {
-                    continue; // Already deleted
-                }
-                // Delete the edge
-                const deleted = deleteEdge(edgeId);
-                if (deleted) {
-                    result.edgesDeleted++;
-                    chunkIdsToCheck.add(edge.sourceChunkId);
-                    chunkIdsToCheck.add(edge.targetChunkId);
-                }
-            }
-            // Mark chunks that lost all edges for TTL cleanup
-            for (const chunkId of chunkIdsToCheck) {
-                if (!hasAnyEdges(chunkId)) {
-                    await vectorStore.markOrphaned(chunkId);
-                    result.chunksOrphaned++;
-                }
-            }
-        }
-        finally {
-            this.isRunning = false;
-        }
-        return result;
-    }
-    /**
-     * Set flush delay (for testing).
-     */
-    setFlushDelay(ms) {
-        this.flushDelayMs = ms;
-    }
-    /**
-     * Check if pruner is currently running.
-     */
-    isActive() {
-        return this.isRunning;
-    }
-    /**
-     * Clear pending queue without flushing (for testing).
-     */
-    clearPending() {
-        this.pendingEdges.clear();
-        if (this.flushTimeout) {
-            clearTimeout(this.flushTimeout);
-            this.flushTimeout = null;
-        }
-    }
-    // ─── Full Background Prune ────────────────────────────────────────
-    fullPruneRunning = false;
-    fullPruneProgress = null;
-    /**
-     * Start a full background prune (non-blocking).
-     * Scans all edges, removes dead ones, marks orphaned chunks for TTL.
-     * Idempotent - if already running, returns existing progress.
-     */
-    startBackgroundPrune() {
-        if (this.fullPruneProgress && this.fullPruneRunning) {
-            return this.fullPruneProgress;
-        }
-        this.fullPruneProgress = {
-            status: 'running',
-            edgesScanned: 0,
-            edgesDeleted: 0,
-            chunksScanned: 0,
-            chunksOrphaned: 0,
-            startedAt: Date.now(),
-            completedAt: null,
-            error: null,
-        };
-        // Run in background - don't await
-        this.runFullPrune().catch((err) => {
-            if (this.fullPruneProgress) {
-                this.fullPruneProgress.status = 'error';
-                this.fullPruneProgress.error = err.message;
-                this.fullPruneProgress.completedAt = Date.now();
-            }
-            log.error('Full prune error', { error: err instanceof Error ? err.message : String(err) });
-        });
-        return this.fullPruneProgress;
-    }
-    /**
-     * Get current full prune progress (null if never started).
-     */
-    getFullPruneProgress() {
-        return this.fullPruneProgress;
-    }
-    /**
-     * Check if full prune is currently running.
-     */
-    isFullPruneRunning() {
-        return this.fullPruneRunning;
-    }
-    /**
-     * Run the full prune operation.
-     * Scans all edges, calculates weights, removes dead edges, and marks
-     * chunks that lose all edges for TTL cleanup.
-     */
-    async runFullPrune() {
-        if (this.fullPruneRunning) {
-            return;
-        }
-        this.fullPruneRunning = true;
-        const progress = this.fullPruneProgress;
-        try {
-            // Build reference clocks for all projects
-            const refClocks = new Map();
-            // Get all edges
-            const edges = getAllEdges();
-            const deadEdgeIds = [];
-            const chunkIdsToCheck = new Set();
-            // Scan edges and identify dead ones
-            for (const edge of edges) {
-                progress.edgesScanned++;
-                // Get reference clock for this edge's project (lazy load)
-                let refClock = refClocks.get(edge.sourceChunkId);
-                if (!refClock) {
-                    // Try to get from chunk's session
-                    const { getChunkById } = await import('./chunk-store.js');
-                    const chunk = getChunkById(edge.sourceChunkId);
-                    if (chunk) {
-                        refClock = getReferenceClock(chunk.sessionSlug);
-                        refClocks.set(edge.sourceChunkId, refClock);
-                    }
-                }
-                // Calculate weight
-                let weight = edge.initialWeight;
-                if (refClock && edge.vectorClock) {
-                    const edgeClock = deserialize(edge.vectorClock);
-                    const direction = edge.edgeType === 'forward' ? 'forward' : 'backward';
-                    weight = edge.initialWeight * calculateDirectionalDecayWeight(edgeClock, refClock, direction);
-                }
-                // Queue dead edges
-                if (weight <= 0) {
-                    deadEdgeIds.push(edge.id);
-                    chunkIdsToCheck.add(edge.sourceChunkId);
-                    chunkIdsToCheck.add(edge.targetChunkId);
-                }
-                // Yield periodically to avoid blocking
-                if (progress.edgesScanned % 500 === 0) {
-                    await new Promise((resolve) => setImmediate(resolve));
-                }
-            }
-            // Delete dead edges in batches
-            const batchSize = 100;
-            for (let i = 0; i < deadEdgeIds.length; i += batchSize) {
-                const batch = deadEdgeIds.slice(i, i + batchSize);
-                for (const edgeId of batch) {
-                    if (deleteEdge(edgeId)) {
-                        progress.edgesDeleted++;
-                    }
-                }
-                // Yield after each batch
-                await new Promise((resolve) => setImmediate(resolve));
-            }
-            // Mark chunks that lost all edges for TTL cleanup
-            for (const chunkId of chunkIdsToCheck) {
-                progress.chunksScanned++;
-                if (!hasAnyEdges(chunkId)) {
-                    await vectorStore.markOrphaned(chunkId);
-                    progress.chunksOrphaned++;
-                }
-                // Yield periodically
-                if (progress.chunksScanned % 100 === 0) {
-                    await new Promise((resolve) => setImmediate(resolve));
-                }
-            }
-            progress.status = 'completed';
-            progress.completedAt = Date.now();
-        }
-        finally {
-            this.fullPruneRunning = false;
-        }
-    }
-}
-// Export class for testing (allows creating fresh instances)
-export { Pruner };
-// Singleton instance for production use
-export const pruner = new Pruner();
-/**
- * Start background pruning on module load if environment variable is set.
- * This allows the MCP server or CLI to trigger startup pruning.
- */
-export function initStartupPrune() {
-    return pruner.startBackgroundPrune();
-}
-//# sourceMappingURL=pruner.js.map