hippo-memory 1.56.0 → 1.57.0

package/dist/eval-stats.d.ts

@@ -120,4 +120,62 @@ export declare function passAtK(runsByTask: boolean[][], k: number): number;
  * NaN when no task has k runs.
  */
 export declare function passHatK(runsByTask: boolean[][], k: number): number;
+/** All units of one family (tasks by seeds), resampled as one block so seeds stay together. */
+export type Family<T> = readonly T[];
+/** One repository's families; a task with no lesson is a family of one. */
+export type Repository<T> = readonly Family<T>[];
+/** An {@link Estimate} with a two-sided p-value from the same resamples. */
+export interface TestedEstimate extends Estimate {
+    /** 2 x min(share <= null, share >= null), capped at 1; NaN with fewer than two repositories. */
+    readonly p: number;
+    /** Non-finite resamples, dropped; `iterations + dropped` is the number requested. */
+    readonly dropped: number;
+    /** The null the p-value tested against; {@link verdict} reads its sides from here. */
+    readonly nullValue: number;
+}
+/** Options for {@link twoLevelBootstrap}. */
+export interface TwoLevelOpts extends BootstrapOpts {
+    /** Resamples. Default 10,000. */
+    readonly iterations?: number;
+    /** Value the p-value tests against: 0 for differences, 1 for ratios. Default 0. */
+    readonly nullValue?: number;
+}
+/** Resamples repositories, then families inside each; only the repository draw carries a shared-store fault.
+ * The statistic never uses the PRNG, so a second call on one seed draws the same resamples. */
+export declare function twoLevelBootstrap<T>(repos: readonly Repository<T>[], statistic: (units: readonly T[]) => number, opts?: TwoLevelOpts): TestedEstimate;
+/** Holm step-down in input order; the family size is `ps.length`, as preregistered.
+ * A NaN stays NaN but ranks as 1, so it never loosens the others; a finite p outside [0, 1] throws. */
+export declare function holmAdjust(ps: readonly number[]): number[];
+/** One of the four mutually exclusive outcomes the preregistration allows per hypothesis. */
+export type Verdict = 'loss' | 'win' | 'tie' | 'inconclusive';
+/** What a hypothesis needs to be read; see {@link verdict}. */
+export interface VerdictSpec {
+    /** Direction that favours the treatment arm. */
+    readonly helpful: 'lower' | 'higher';
+    /** Inclusive band the interval must sit inside for a tie. */
+    readonly tieBand: readonly [number, number];
+    /** An estimate on this value or beyond it, on the helpful side, reaches the minimum effect. */
+    readonly minimumEffectAt: number;
+    /** Default 0.05. */
+    readonly alpha?: number;
+}
+/** A verdict, plus whether a win reaches the minimum effect (a win below it is a small win). */
+export interface VerdictResult {
+    readonly verdict: Verdict;
+    readonly reachesMinimum: boolean;
+}
+/** Checks in the preregistered order; the null comes from `e.nullValue`, so p and sides cannot disagree.
+ * A NaN estimate, p or bound is inconclusive, since a win or loss cannot be ruled out. */
+export declare function verdict(e: TestedEstimate, adjustedP: number, spec: VerdictSpec): VerdictResult;
+/** A win must hold under both codings of not-applicable, while a loss under either is reported. */
+export declare function combineCodings(a: VerdictResult, b: VerdictResult): VerdictResult;
+/** Outcome of the harm gate; see {@link harmGate}. */
+export interface HarmGate {
+    readonly pass: boolean;
+    readonly costOk: boolean;
+    readonly resolveOk: boolean;
+}
+/** Cost ratio's upper bound below 1.10, resolve difference's lower bound (a fraction) above -0.05.
+ * Both estimates must use alpha 0.05, the conservative reading of "upper 95% bound"; a NaN bound fails. */
+export declare function harmGate(costRatio: Estimate, resolveDiff: Estimate): HarmGate;
 //# sourceMappingURL=eval-stats.d.ts.map

package/dist/eval-stats.js

@@ -184,4 +184,115 @@ export function passHatK(runsByTask, k) {
         return Number.NaN;
     return eligible.filter((r) => r.slice(0, k).every(Boolean)).length / eligible.length;
 }
+function notANumber(nullValue, dropped) {
+    const nan = Number.NaN;
+    return { estimate: nan, low: nan, high: nan, p: nan, iterations: 0, dropped, nullValue };
+}
+function resampleUnits(repos, rand) {
+    const units = [];
+    for (let i = 0; i < repos.length; i++) {
+        const repo = repos[Math.floor(rand() * repos.length)];
+        for (let j = 0; j < repo.length; j++) {
+            for (const unit of repo[Math.floor(rand() * repo.length)])
+                units.push(unit);
+        }
+    }
+    return units;
+}
+// Inclusive on both sides, as the p-value is worded; float noise around the null breaks a tie.
+function twoSidedP(samples, nullValue) {
+    let below = 0;
+    let above = 0;
+    for (const s of samples) {
+        if (s <= nullValue)
+            below++;
+        if (s >= nullValue)
+            above++;
+    }
+    return Math.min(1, (2 * Math.min(below, above)) / samples.length);
+}
+/** Resamples repositories, then families inside each; only the repository draw carries a shared-store fault.
+ * The statistic never uses the PRNG, so a second call on one seed draws the same resamples. */
+export function twoLevelBootstrap(repos, statistic, opts = {}) {
+    const requested = opts.iterations ?? 10_000;
+    if (!Number.isInteger(requested) || requested <= 0) {
+        throw new RangeError(`iterations must be a positive integer, got ${requested}`);
+    }
+    const nullValue = opts.nullValue ?? 0;
+    const kept = repos.map((r) => r.filter((f) => f.length > 0)).filter((r) => r.length > 0);
+    if (kept.length === 0)
+        return notANumber(nullValue, 0);
+    const rand = seededRandom(opts.seed ?? 1);
+    const samples = [];
+    for (let b = 0; b < requested; b++) {
+        const value = statistic(resampleUnits(kept, rand));
+        if (Number.isFinite(value))
+            samples.push(value);
+    }
+    const dropped = requested - samples.length;
+    if (samples.length === 0)
+        return notANumber(nullValue, dropped);
+    const estimate = statistic(kept.flatMap((r) => r.flat()));
+    const p = kept.length < 2 ? Number.NaN : twoSidedP(samples, nullValue);
+    const interval = percentileInterval(samples, opts.alpha ?? 0.05);
+    return { estimate, ...interval, p, iterations: samples.length, dropped, nullValue };
+}
+/** Holm step-down in input order; the family size is `ps.length`, as preregistered.
+ * A NaN stays NaN but ranks as 1, so it never loosens the others; a finite p outside [0, 1] throws. */
+export function holmAdjust(ps) {
+    for (const p of ps) {
+        if (!Number.isNaN(p) && !(p >= 0 && p <= 1))
+            throw new RangeError(`p-value out of range: ${p}`);
+    }
+    const ranked = ps
+        .map((p, index) => ({ index, key: Number.isNaN(p) ? 1 : p }))
+        .sort((a, b) => a.key - b.key || a.index - b.index);
+    const adjusted = Array.from({ length: ps.length }, () => Number.NaN);
+    let running = 0;
+    ranked.forEach(({ index, key }, rank) => {
+        running = Math.max(running, (ps.length - rank) * key);
+        if (!Number.isNaN(ps[index]))
+            adjusted[index] = Math.min(1, running);
+    });
+    return adjusted;
+}
+/** Checks in the preregistered order; the null comes from `e.nullValue`, so p and sides cannot disagree.
+ * A NaN estimate, p or bound is inconclusive, since a win or loss cannot be ruled out. */
+export function verdict(e, adjustedP, spec) {
+    const inconclusive = { verdict: 'inconclusive', reachesMinimum: false };
+    if ([adjustedP, e.estimate, e.low, e.high].some(Number.isNaN))
+        return inconclusive;
+    const nullValue = e.nullValue;
+    const lowerIsHelpful = spec.helpful === 'lower';
+    if (adjustedP < (spec.alpha ?? 0.05)) {
+        const helpfulSide = lowerIsHelpful ? e.estimate < nullValue : e.estimate > nullValue;
+        const harmfulSide = lowerIsHelpful ? e.estimate > nullValue : e.estimate < nullValue;
+        if (harmfulSide)
+            return { verdict: 'loss', reachesMinimum: false };
+        if (helpfulSide) {
+            const reaches = lowerIsHelpful ? e.estimate <= spec.minimumEffectAt : e.estimate >= spec.minimumEffectAt;
+            return { verdict: 'win', reachesMinimum: reaches };
+        }
+    }
+    const insideBand = e.low >= spec.tieBand[0] && e.high <= spec.tieBand[1];
+    return insideBand ? { verdict: 'tie', reachesMinimum: false } : inconclusive;
+}
+/** A win must hold under both codings of not-applicable, while a loss under either is reported. */
+export function combineCodings(a, b) {
+    if (a.verdict === 'loss' || b.verdict === 'loss')
+        return { verdict: 'loss', reachesMinimum: false };
+    if (a.verdict === 'win' && b.verdict === 'win') {
+        return { verdict: 'win', reachesMinimum: a.reachesMinimum && b.reachesMinimum };
+    }
+    if (a.verdict === 'tie' && b.verdict === 'tie')
+        return { verdict: 'tie', reachesMinimum: false };
+    return { verdict: 'inconclusive', reachesMinimum: false };
+}
+/** Cost ratio's upper bound below 1.10, resolve difference's lower bound (a fraction) above -0.05.
+ * Both estimates must use alpha 0.05, the conservative reading of "upper 95% bound"; a NaN bound fails. */
+export function harmGate(costRatio, resolveDiff) {
+    const costOk = costRatio.high < 1.1;
+    const resolveOk = resolveDiff.low > -0.05;
+    return { pass: costOk && resolveOk, costOk, resolveOk };
+}
 //# sourceMappingURL=eval-stats.js.map

package/dist/goals.d.ts

@@ -79,12 +79,36 @@ export interface GetActiveGoalsOpts {
 }
 export declare function getActiveGoals(hippoRoot: string, opts: GetActiveGoalsOpts): Goal[];
 export declare function getActiveGoalsWithDb(db: DatabaseSyncLike, opts: GetActiveGoalsOpts): Goal[];
+/** One `goal_recall_log` row: a boosted local memory recalled while its goal was active. */
+export interface GoalRecallLogRow {
+    goalId: string;
+    memoryId: string;
+    tenantId: string;
+    sessionId: string;
+    recalledAt: string;
+    score: number;
+}
+/** Options shared by {@link computeGoalStackBoost} and {@link applyGoalStackBoost}. */
+export interface GoalStackBoostOpts {
+    sessionId: string;
+    tenantId: string;
+    limit: number;
+    /**
+     * Optional side-channel: one goal-boost `RerankStep` per boosted row, keyed by
+     * `entry.id`. A map rather than a row field because the helper re-spreads rows.
+     * Only populated when passed, so the default path allocates nothing.
+     */
+    trace?: Map<string, RerankStep>;
+}
+/** The boosted, re-sorted rows and the `goal_recall_log` rows they earn. */
+export interface GoalStackBoost<R> {
+    results: R[];
+    log: GoalRecallLogRow[];
+}
 /**
- * v1.7.4 -- dlPFC goal-stack boost helper. Applies the multi-goal boost to a
- * list of entry-backed scored rows when (tenant, session) has active goals.
- * Pre-v1.7.4 this logic lived inline in cmdRecall (src/cli.ts:988-1140);
- * lifting here lets api.recall (primary band only) AND MCP physics/hybrid
- * call it.
+ * dlPFC goal-stack boost. Applies the multi-goal boost to entry-backed scored
+ * rows when (tenant, session) has active goals and returns the log rows to
+ * write, without writing them; {@link writeGoalRecallLog} persists them.
  *
  * Caller responsibilities:
  *   - Do NOT call when an explicit `goalTag` is set (caller's gate)
@@ -94,31 +118,31 @@ export declare function getActiveGoalsWithDb(db: DatabaseSyncLike, opts: GetActi
  *   - Recompute `tokens` after if returned rows are projected to a budgeted
  *     shape
  *
- * Side effects:
- *   - INSERT OR IGNORE into `goal_recall_log` for each (boosted, goal) pair
- *   - Local memory id filter applied before INSERT (skips global-only ids
- *     to preserve FK invariant on goal_recall_log.memory_id)
+ * Log rows cover the top `limit` boosted rows that live in this store's
+ * `memories` table (global-only ids are skipped to keep the FK on
+ * goal_recall_log.memory_id valid).
  *
- * @internal v1.7.4 -- internal recall ranking helper. Subject to change.
+ * @internal Recall ranking helper. Subject to change.
+ */
+export declare function computeGoalStackBoost<R extends {
+    entry: MemoryEntry;
+    score: number;
+}>(db: DatabaseSyncLike, results: R[], opts: GoalStackBoostOpts): GoalStackBoost<R>;
+/**
+ * Writes goal-boost log rows. INSERT OR IGNORE because UNIQUE(memory_id, goal_id)
+ * makes a re-recall during the same goal life a no-op for outcome attribution.
+ */
+export declare function writeGoalRecallLog(db: DatabaseSyncLike, rows: readonly GoalRecallLogRow[]): void;
+/**
+ * {@link computeGoalStackBoost} plus {@link writeGoalRecallLog} in one call, for
+ * pipelines that boost and log on the same handle.
+ *
+ * @internal Recall ranking helper. Subject to change.
  */
 export declare function applyGoalStackBoost<R extends {
     entry: MemoryEntry;
     score: number;
-}>(db: DatabaseSyncLike, results: R[], opts: {
-    sessionId: string;
-    tenantId: string;
-    limit: number;
-    /**
-     * A7 recall-trace (optional side-channel). When supplied, the helper
-     * records one goal-boost `RerankStep` per ACTUALLY-boosted row, keyed by
-     * `entry.id`. This is a SEPARATE accumulator, NOT a field on the result
-     * row — the helper re-spreads rows and strips internal markers
-     * (`_goalMatches` below), so a row field would be dropped. The score-mul
-     * + re-sort math is untouched; the trace is only populated when this map
-     * is passed (default path never allocates → byte-identical).
-     */
-    trace?: Map<string, RerankStep>;
-}): R[];
+}>(db: DatabaseSyncLike, results: R[], opts: GoalStackBoostOpts): R[];
 export interface CompleteGoalOpts {
     outcomeScore?: number;
     /**

package/dist/goals.js

@@ -142,11 +142,9 @@ export function getActiveGoalsWithDb(db, opts) {
     return rows.map(rowToGoal);
 }
 /**
- * v1.7.4 -- dlPFC goal-stack boost helper. Applies the multi-goal boost to a
- * list of entry-backed scored rows when (tenant, session) has active goals.
- * Pre-v1.7.4 this logic lived inline in cmdRecall (src/cli.ts:988-1140);
- * lifting here lets api.recall (primary band only) AND MCP physics/hybrid
- * call it.
+ * dlPFC goal-stack boost. Applies the multi-goal boost to entry-backed scored
+ * rows when (tenant, session) has active goals and returns the log rows to
+ * write, without writing them; {@link writeGoalRecallLog} persists them.
  *
  * Caller responsibilities:
  *   - Do NOT call when an explicit `goalTag` is set (caller's gate)
@@ -156,18 +154,17 @@ export function getActiveGoalsWithDb(db, opts) {
  *   - Recompute `tokens` after if returned rows are projected to a budgeted
  *     shape
  *
- * Side effects:
- *   - INSERT OR IGNORE into `goal_recall_log` for each (boosted, goal) pair
- *   - Local memory id filter applied before INSERT (skips global-only ids
- *     to preserve FK invariant on goal_recall_log.memory_id)
+ * Log rows cover the top `limit` boosted rows that live in this store's
+ * `memories` table (global-only ids are skipped to keep the FK on
+ * goal_recall_log.memory_id valid).
  *
- * @internal v1.7.4 -- internal recall ranking helper. Subject to change.
+ * @internal Recall ranking helper. Subject to change.
  */
-export function applyGoalStackBoost(db, results, opts) {
+export function computeGoalStackBoost(db, results, opts) {
     const { sessionId, tenantId, limit, trace } = opts;
     const active = getActiveGoalsWithDb(db, { sessionId, tenantId });
     if (active.length === 0)
-        return results;
+        return { results, log: [] };
     const goalsByTag = new Map(active.map((g) => [g.goalName, g]));
     // Load retrieval_policy rows for active goals so per-policy multipliers
     // can compose onto the base goal-tag boost. Composed result is hard-capped
@@ -271,15 +268,8 @@ export function applyGoalStackBoost(db, results, opts) {
         for (const row of localRows)
             localIds.add(row.id);
     }
-    // Log top-K boosted recalls. INSERT OR IGNORE because
-    // UNIQUE(memory_id, goal_id) means a re-recall during the same goal life
-    // is a no-op for outcome attribution.
     const recalledAt = new Date().toISOString();
-    const insertLog = db.prepare(`
-    INSERT OR IGNORE INTO goal_recall_log
-      (goal_id, memory_id, tenant_id, session_id, recalled_at, score)
-    VALUES (?, ?, ?, ?, ?, ?)
-  `);
+    const log = [];
     for (const r of boosted.slice(0, limit)) {
         if (!localIds.has(r.entry.id))
             continue; // global -> skip log insert
@@ -290,10 +280,37 @@ export function applyGoalStackBoost(db, results, opts) {
             const goal = goalsByTag.get(tag);
             if (!goal)
                 continue;
-            insertLog.run(goal.id, r.entry.id, tenantId, sessionId, recalledAt, r.score);
+            log.push({ goalId: goal.id, memoryId: r.entry.id, tenantId, sessionId, recalledAt, score: r.score });
         }
     }
-    return boosted;
+    return { results: boosted, log };
+}
+/**
+ * Writes goal-boost log rows. INSERT OR IGNORE because UNIQUE(memory_id, goal_id)
+ * makes a re-recall during the same goal life a no-op for outcome attribution.
+ */
+export function writeGoalRecallLog(db, rows) {
+    if (rows.length === 0)
+        return;
+    const insertLog = db.prepare(`
+    INSERT OR IGNORE INTO goal_recall_log
+      (goal_id, memory_id, tenant_id, session_id, recalled_at, score)
+    VALUES (?, ?, ?, ?, ?, ?)
+  `);
+    for (const row of rows) {
+        insertLog.run(row.goalId, row.memoryId, row.tenantId, row.sessionId, row.recalledAt, row.score);
+    }
+}
+/**
+ * {@link computeGoalStackBoost} plus {@link writeGoalRecallLog} in one call, for
+ * pipelines that boost and log on the same handle.
+ *
+ * @internal Recall ranking helper. Subject to change.
+ */
+export function applyGoalStackBoost(db, results, opts) {
+    const boost = computeGoalStackBoost(db, results, opts);
+    writeGoalRecallLog(db, boost.log);
+    return boost.results;
 }
 const POSITIVE_OUTCOME_THRESHOLD = 0.7;
 const NEGATIVE_OUTCOME_THRESHOLD = 0.3;

package/dist/graph-extract.js

@@ -25,7 +25,7 @@ import { loadDecisions } from './decisions.js';
 import { loadPolicies } from './policies.js';
 import { loadCustomerNotes } from './customer-notes.js';
 import { loadProjectBriefs } from './project-briefs.js';
-import { assertTenantId } from './store.js';
+import { assertTenantId } from './tenant.js';
 /** Per-type load cap (the loaders default to 100). A type whose active or superseded
  *  set exceeds this is truncated; `ExtractResult.truncated` records it so the
  *  incompleteness is observable rather than silent. */

package/dist/graph-recall.d.ts

@@ -1,4 +1,4 @@
-import { type ResultCost, type SearchResult } from './search.js';
+import type { ResultCost, SearchResult } from './search.js';
 /** Hard cap on `--hops` (a higher value just walks more of a finite graph; this bounds
  *  worst-case work and keeps the flag honest). */
 export declare const MAX_HOPS = 3;

package/dist/graph-recall.js

@@ -37,7 +37,7 @@
  * check-graph-writes lint permits this module living outside graph.ts.
  */
 import { loadEntriesByIds } from './store.js';
-import { estimateTokens } from './search.js';
+import { estimateTokens } from './token-ledger.js';
 import { compareEntryIdentity } from './compare.js';
 import { loadEntitiesByMemoryId, loadEntitiesByIds, loadNeighborRelations, } from './graph.js';
 import { passesCliRecallScopeFilter, passesScopeFilterForRecall } from './recall-scope.js';

package/dist/graph.js

@@ -18,7 +18,7 @@
  * until E3.2 multi-hop recall.
  */
 import { openHippoDb, closeHippoDb } from './db.js';
-import { assertTenantId } from './store.js';
+import { assertTenantId } from './tenant.js';
 const SOURCE_OBJECT_TABLE = {
     decision: 'decisions',
     policy: 'policies',

package/dist/hooks.d.ts

@@ -45,8 +45,8 @@ export interface CodexWrapperPaths {
     wrapperShPath: string;
     logFile: string;
     runsDir: string;
+    codexHome: string;
     historyPath: string;
-    sessionsDir: string;
 }
 export interface CodexWrapperInstallResult {
     installed: boolean;
@@ -63,8 +63,6 @@ export interface CodexWrapperMetadata {
     backupPath: string;
     installMode: 'same-path' | 'cmd-shim';
     logFile: string;
-    historyPath: string;
-    sessionsDir: string;
     installedAt: string;
 }
 export interface EnsureCodexWrapperResult {

package/dist/hooks.js

@@ -154,7 +154,7 @@ export function defaultPreCompactLogPath() {
 }
 export function resolveCodexWrapperPaths() {
     const home = homeDir();
-    const codexHome = path.join(home, '.codex');
+    const codexHome = codexHomeDir(home);
     const wrapperDir = path.join(home, '.hippo', 'bin');
     return {
         wrapperDir,
@@ -164,8 +164,8 @@ export function resolveCodexWrapperPaths() {
         wrapperShPath: path.join(wrapperDir, 'codex'),
         logFile: path.join(home, '.hippo', 'logs', 'codex-sleep.log'),
         runsDir: path.join(home, '.hippo', 'runs', 'codex'),
+        codexHome,
         historyPath: path.join(codexHome, 'history.jsonl'),
-        sessionsDir: path.join(codexHome, 'sessions'),
     };
 }
 function pathEquals(a, b) {
@@ -348,8 +348,6 @@ export function installCodexWrapper(realCodexPath) {
         backupPath: plan.backupPath,
         installMode: plan.installMode,
         logFile: paths.logFile,
-        historyPath: paths.historyPath,
-        sessionsDir: paths.sessionsDir,
         installedAt: new Date().toISOString(),
     };
     fs.writeFileSync(paths.metadataPath, JSON.stringify(metadata, null, 2) + '\n', 'utf8');

package/dist/http-util.d.ts

@@ -0,0 +1,31 @@
+import type { IncomingMessage, ServerResponse } from 'node:http';
+export type JsonValue = string | number | boolean | null | JsonValue[] | {
+    [key: string]: JsonValue;
+};
+export declare function isJsonObjectRecord(value: JsonValue | undefined): value is Record<string, JsonValue>;
+export declare function isHeaderString(value: string | string[] | undefined): value is string;
+export declare const JSON_HEADERS: {
+    readonly 'content-type': "application/json";
+};
+export declare class HttpError extends Error {
+    status: number;
+    constructor(status: number, message: string);
+}
+export declare class BodyTooLargeError extends Error {
+}
+export declare function sendJson<T>(res: ServerResponse, status: number, body: T): void;
+/**
+ * Read the entire request body into a Buffer. Caps at MAX_BODY_BYTES to keep
+ * a malicious or buggy client from exhausting memory. The cap is enforced
+ * mid-stream so we don't wait for an attacker to finish before erroring out.
+ */
+export declare function readBody(req: IncomingMessage): Promise<string>;
+/** Per-request values a connector webhook receiver reads; ServeOpts and the /v1 RouteRequest both satisfy it. */
+export interface WebhookRequest {
+    req: IncomingMessage;
+    res: ServerResponse;
+    opts: {
+        hippoRoot: string;
+    };
+}
+//# sourceMappingURL=http-util.d.ts.map

package/dist/http-util.js

@@ -0,0 +1,46 @@
+export function isJsonObjectRecord(value) {
+    return value !== undefined && value !== null && typeof value === 'object' && !Array.isArray(value);
+}
+// node:http header values are `string | string[] | undefined` (never a bare
+// unknown), so this gets its own predicate rather than reusing isJsonString.
+export function isHeaderString(value) {
+    return typeof value === 'string';
+}
+// 1 MB body cap. The CLI never sends payloads near this; anything bigger is
+// almost certainly a misconfigured client or a deliberate memory-blowup attempt.
+const MAX_BODY_BYTES = 1024 * 1024;
+export const JSON_HEADERS = { 'content-type': 'application/json' };
+export class HttpError extends Error {
+    status;
+    constructor(status, message) {
+        super(message);
+        this.status = status;
+    }
+}
+export class BodyTooLargeError extends Error {
+}
+export function sendJson(res, status, body) {
+    res.writeHead(status, JSON_HEADERS);
+    res.end(JSON.stringify(body));
+}
+/**
+ * Read the entire request body into a Buffer. Caps at MAX_BODY_BYTES to keep
+ * a malicious or buggy client from exhausting memory. The cap is enforced
+ * mid-stream so we don't wait for an attacker to finish before erroring out.
+ */
+export async function readBody(req) {
+    const chunks = [];
+    let total = 0;
+    for await (const chunk of req) {
+        // SAFETY: IncomingMessage never runs setEncoding() here, so every
+        // streamed chunk is a Buffer, not a decoded string.
+        const buf = chunk;
+        total += buf.length;
+        if (total > MAX_BODY_BYTES) {
+            throw new BodyTooLargeError('request body exceeds 1MB');
+        }
+        chunks.push(buf);
+    }
+    return Buffer.concat(chunks).toString('utf8');
+}
+//# sourceMappingURL=http-util.js.map

package/dist/incidents.js

@@ -26,7 +26,8 @@
  * cross-tenant or nonexistent id is rejected (throw) before the insert.
  */
 import { openHippoDb, closeHippoDb } from './db.js';
-import { writeEntry, assertTenantId } from './store.js';
+import { writeEntry } from './store.js';
+import { assertTenantId } from './tenant.js';
 import { createMemory, Layer } from './memory.js';
 import { appendAuditEvent } from './audit.js';
 import { objectHalfLifeDays } from './half-life-migration.js';

package/dist/index.d.ts

@@ -5,10 +5,13 @@ import { type CreateMemoryOptions, type MemoryEntry } from './memory.js';
 export { MemoryEntry, Layer, EmotionalValence, ConfidenceLevel, DecayOptions, calculateStrength, resolveConfidence, confidenceFacets, type ConfidenceFacets, applyOutcome, generateId, computeSchemaFit } from './memory.js';
 /** Published signature, so `baseHalfLifeDays` stays optional here; hippo's own writers use the strict one in memory.ts. */
 export declare function createMemory(content: string, options?: Partial<CreateMemoryOptions>): MemoryEntry;
-export { search, hybridSearch, physicsSearch, markRetrieved, estimateTokens, textOverlap, tokenize, explainMatch, detectTemporalDirection, temporalBoost, computeTemporalRange, SearchResult, MatchExplanation } from './search.js';
+export { search, hybridSearch, physicsSearch, estimateTokens, textOverlap, explainMatch, detectTemporalDirection, temporalBoost, computeTemporalRange, SearchResult, MatchExplanation } from './search.js';
+export { tokenize } from './tokenize.js';
+export { markRetrieved } from './memory.js';
 export { multihopSearch } from './multihop.js';
 export { graphExpandRecall, MAX_HOPS, DEFAULT_MAX_NEIGHBORS, type GraphExpandOpts } from './graph-recall.js';
-export { initStore, loadAllEntries, loadSearchEntries, loadRecallSearchEntries, writeEntry, readEntry, deleteEntry, loadIndex, rebuildIndex, saveActiveTaskSnapshot, loadActiveTaskSnapshot, loadFreshActiveTaskSnapshot, SNAPSHOT_AMBIENT_MAX_AGE_MS, closeTaskSnapshotsForSession, clearActiveTaskSnapshot, appendSessionEvent, listSessionEvents, listMemoryConflicts, replaceDetectedConflicts, resolveConflict, saveSessionHandoff, loadLatestHandoff, loadHandoffById, stampHandoffOutcome, writeSessionEndHandoff, loadSessionDecayContext, SessionDecayContext, createCard, loadCard, listCards, loadCardDeps, loadCardRuns, loadCardComments, claimCard, heartbeatCard, blockCard, reviewCard, completeCard, reclaimExpiredCards, addCardComment, loadLatestHandoffForCard, } from './store.js';
+export { initStore, loadAllEntries, loadSearchEntries, loadRecallSearchEntries, writeEntry, readEntry, deleteEntry, loadIndex, rebuildIndex, saveActiveTaskSnapshot, loadActiveTaskSnapshot, loadFreshActiveTaskSnapshot, SNAPSHOT_AMBIENT_MAX_AGE_MS, closeTaskSnapshotsForSession, clearActiveTaskSnapshot, appendSessionEvent, listSessionEvents, listMemoryConflicts, replaceDetectedConflicts, resolveConflict, saveSessionHandoff, loadLatestHandoff, loadHandoffById, stampHandoffOutcome, writeSessionEndHandoff, loadSessionDecayContext, SessionDecayContext, } from './store.js';
+export { createCard, loadCard, listCards, loadCardDeps, loadCardRuns, loadCardComments, claimCard, heartbeatCard, blockCard, reviewCard, completeCard, reclaimExpiredCards, addCardComment, loadLatestHandoffForCard, } from './store-cards.js';
 export { SessionHandoff, HandoffOutcome, HandoffEvidence, isHandoffOutcome } from './handoff.js';
 export { Card, CardStatus, CardRun, CardComment, CardTransitions, isCardStatus, CARD_TRANSITIONS, CARD_LEASE_MS } from './card.js';
 export { consolidate, ConsolidationResult } from './consolidate.js';

package/dist/index.js

@@ -7,10 +7,13 @@ export { Layer, calculateStrength, resolveConfidence, confidenceFacets, applyOut
 export function createMemory(content, options = {}) {
     return createStoreMemory(content, { ...options, baseHalfLifeDays: options.baseHalfLifeDays ?? DEFAULT_HALF_LIFE_DAYS });
 }
-export { search, hybridSearch, physicsSearch, markRetrieved, estimateTokens, textOverlap, tokenize, explainMatch, detectTemporalDirection, temporalBoost, computeTemporalRange } from './search.js';
+export { search, hybridSearch, physicsSearch, estimateTokens, textOverlap, explainMatch, detectTemporalDirection, temporalBoost, computeTemporalRange } from './search.js';
+export { tokenize } from './tokenize.js';
+export { markRetrieved } from './memory.js';
 export { multihopSearch } from './multihop.js';
 export { graphExpandRecall, MAX_HOPS, DEFAULT_MAX_NEIGHBORS } from './graph-recall.js';
-export { initStore, loadAllEntries, loadSearchEntries, loadRecallSearchEntries, writeEntry, readEntry, deleteEntry, loadIndex, rebuildIndex, saveActiveTaskSnapshot, loadActiveTaskSnapshot, loadFreshActiveTaskSnapshot, SNAPSHOT_AMBIENT_MAX_AGE_MS, closeTaskSnapshotsForSession, clearActiveTaskSnapshot, appendSessionEvent, listSessionEvents, listMemoryConflicts, replaceDetectedConflicts, resolveConflict, saveSessionHandoff, loadLatestHandoff, loadHandoffById, stampHandoffOutcome, writeSessionEndHandoff, loadSessionDecayContext, createCard, loadCard, listCards, loadCardDeps, loadCardRuns, loadCardComments, claimCard, heartbeatCard, blockCard, reviewCard, completeCard, reclaimExpiredCards, addCardComment, loadLatestHandoffForCard, } from './store.js';
+export { initStore, loadAllEntries, loadSearchEntries, loadRecallSearchEntries, writeEntry, readEntry, deleteEntry, loadIndex, rebuildIndex, saveActiveTaskSnapshot, loadActiveTaskSnapshot, loadFreshActiveTaskSnapshot, SNAPSHOT_AMBIENT_MAX_AGE_MS, closeTaskSnapshotsForSession, clearActiveTaskSnapshot, appendSessionEvent, listSessionEvents, listMemoryConflicts, replaceDetectedConflicts, resolveConflict, saveSessionHandoff, loadLatestHandoff, loadHandoffById, stampHandoffOutcome, writeSessionEndHandoff, loadSessionDecayContext, } from './store.js';
+export { createCard, loadCard, listCards, loadCardDeps, loadCardRuns, loadCardComments, claimCard, heartbeatCard, blockCard, reviewCard, completeCard, reclaimExpiredCards, addCardComment, loadLatestHandoffForCard, } from './store-cards.js';
 // Feature 5: Session handoff
 export { isHandoffOutcome } from './handoff.js';
 // W2a: work-queue cards