@auxiora/overseer 0.1.0

package/LICENSE

@@ -0,0 +1,191 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to the Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by the Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding any notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2026 Auxiora Contributors
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/package.json

@@ -0,0 +1,10 @@
+{
+  "name": "@auxiora/overseer",
+  "version": "0.1.0",
+  "type": "module",
+  "exports": {
+    ".": "./src/index.ts"
+  },
+  "dependencies": {},
+  "devDependencies": {}
+}

package/src/alert-store.ts

@@ -0,0 +1,100 @@
+import { DatabaseSync } from 'node:sqlite';
+import type { OverseerAlert } from './types.js';
+
+export interface StoredAlert extends OverseerAlert {
+  id: number;
+  acknowledged: boolean;
+}
+
+export class AlertStore {
+  private db: DatabaseSync;
+  private closed = false;
+
+  constructor(dbPath: string) {
+    this.db = new DatabaseSync(dbPath);
+    this.db.exec('PRAGMA journal_mode = WAL');
+    this.db.exec(`
+      CREATE TABLE IF NOT EXISTS alerts (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        type TEXT NOT NULL,
+        agentId TEXT NOT NULL,
+        message TEXT NOT NULL,
+        severity TEXT NOT NULL,
+        detectedAt INTEGER NOT NULL,
+        acknowledged INTEGER DEFAULT 0
+      )
+    `);
+  }
+
+  record(alert: OverseerAlert): void {
+    if (this.closed) return;
+    const stmt = this.db.prepare(
+      'INSERT INTO alerts (type, agentId, message, severity, detectedAt) VALUES (?, ?, ?, ?, ?)',
+    );
+    stmt.run(alert.type, alert.agentId, alert.message, alert.severity, alert.detectedAt);
+  }
+
+  getRecent(limit = 50): StoredAlert[] {
+    if (this.closed) return [];
+    const stmt = this.db.prepare('SELECT * FROM alerts ORDER BY detectedAt DESC LIMIT ?');
+    return (stmt.all(limit) as RawRow[]).map(toStoredAlert);
+  }
+
+  getByAgent(agentId: string): StoredAlert[] {
+    if (this.closed) return [];
+    const stmt = this.db.prepare(
+      'SELECT * FROM alerts WHERE agentId = ? ORDER BY detectedAt DESC',
+    );
+    return (stmt.all(agentId) as RawRow[]).map(toStoredAlert);
+  }
+
+  getBySeverity(severity: string): StoredAlert[] {
+    if (this.closed) return [];
+    const stmt = this.db.prepare(
+      'SELECT * FROM alerts WHERE severity = ? ORDER BY detectedAt DESC',
+    );
+    return (stmt.all(severity) as RawRow[]).map(toStoredAlert);
+  }
+
+  getUnacknowledged(): StoredAlert[] {
+    if (this.closed) return [];
+    const stmt = this.db.prepare(
+      'SELECT * FROM alerts WHERE acknowledged = 0 ORDER BY detectedAt DESC',
+    );
+    return (stmt.all() as RawRow[]).map(toStoredAlert);
+  }
+
+  acknowledge(id: number): void {
+    if (this.closed) return;
+    const stmt = this.db.prepare('UPDATE alerts SET acknowledged = 1 WHERE id = ?');
+    stmt.run(id);
+  }
+
+  close(): void {
+    if (this.closed) return;
+    this.closed = true;
+    this.db.close();
+  }
+}
+
+interface RawRow {
+  id: number;
+  type: string;
+  agentId: string;
+  message: string;
+  severity: string;
+  detectedAt: number;
+  acknowledged: number;
+}
+
+function toStoredAlert(row: RawRow): StoredAlert {
+  return {
+    id: row.id,
+    type: row.type as OverseerAlert['type'],
+    agentId: row.agentId,
+    message: row.message,
+    severity: row.severity as OverseerAlert['severity'],
+    detectedAt: row.detectedAt,
+    acknowledged: row.acknowledged === 1,
+  };
+}

package/src/assessment-store.ts

@@ -0,0 +1,76 @@
+import { DatabaseSync } from 'node:sqlite';
+import type { AssessmentResult, OverseerAction, LLMAssessment, OverseerAlert } from './types.js';
+
+export class AssessmentStore {
+  private readonly db: DatabaseSync;
+  private closed = false;
+
+  constructor(dbPath: string) {
+    this.db = new DatabaseSync(dbPath);
+    this.db.exec('PRAGMA journal_mode=WAL');
+    this.db.exec('PRAGMA busy_timeout=5000');
+    this.db.exec(`
+      CREATE TABLE IF NOT EXISTS assessments (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        agentId TEXT NOT NULL,
+        heuristicAlertsJson TEXT NOT NULL,
+        llmAssessmentJson TEXT,
+        action TEXT NOT NULL,
+        notification TEXT,
+        assessedAt INTEGER NOT NULL
+      )
+    `);
+    this.db.exec('CREATE INDEX IF NOT EXISTS idx_assessments_agent ON assessments (agentId)');
+    this.db.exec('CREATE INDEX IF NOT EXISTS idx_assessments_action ON assessments (action)');
+  }
+
+  record(result: AssessmentResult): void {
+    if (this.closed) return;
+    const stmt = this.db.prepare(
+      'INSERT INTO assessments (agentId, heuristicAlertsJson, llmAssessmentJson, action, notification, assessedAt) VALUES (?, ?, ?, ?, ?, ?)',
+    );
+    stmt.run(
+      result.agentId,
+      JSON.stringify(result.heuristicAlerts),
+      result.llmAssessment ? JSON.stringify(result.llmAssessment) : null,
+      result.action,
+      result.notification ?? null,
+      result.assessedAt,
+    );
+  }
+
+  getByAgent(agentId: string): AssessmentResult[] {
+    if (this.closed) return [];
+    const stmt = this.db.prepare('SELECT * FROM assessments WHERE agentId = ? ORDER BY assessedAt DESC');
+    return this.mapRows(stmt.all(agentId) as Record<string, unknown>[]);
+  }
+
+  getByAction(action: OverseerAction): AssessmentResult[] {
+    if (this.closed) return [];
+    const stmt = this.db.prepare('SELECT * FROM assessments WHERE action = ? ORDER BY assessedAt DESC');
+    return this.mapRows(stmt.all(action) as Record<string, unknown>[]);
+  }
+
+  getRecent(limit = 50): AssessmentResult[] {
+    if (this.closed) return [];
+    const stmt = this.db.prepare('SELECT * FROM assessments ORDER BY assessedAt DESC LIMIT ?');
+    return this.mapRows(stmt.all(limit) as Record<string, unknown>[]);
+  }
+
+  close(): void {
+    if (this.closed) return;
+    this.closed = true;
+    this.db.close();
+  }
+
+  private mapRows(rows: Record<string, unknown>[]): AssessmentResult[] {
+    return rows.map((r) => ({
+      agentId: r.agentId as string,
+      heuristicAlerts: JSON.parse(r.heuristicAlertsJson as string) as OverseerAlert[],
+      llmAssessment: r.llmAssessmentJson ? (JSON.parse(r.llmAssessmentJson as string) as LLMAssessment) : undefined,
+      action: r.action as OverseerAction,
+      notification: (r.notification as string) || undefined,
+      assessedAt: r.assessedAt as number,
+    }));
+  }
+}

package/src/index.ts

@@ -0,0 +1,16 @@
+export { AlertStore } from './alert-store.js';
+export type { StoredAlert } from './alert-store.js';
+export { AssessmentStore } from './assessment-store.js';
+export { OverseerMonitor } from './monitor.js';
+export { ActiveOverseer } from './llm-overseer.js';
+export type {
+  AgentSnapshot,
+  AlertType,
+  AssessmentResult,
+  LLMAssessment,
+  LLMCallerLike,
+  OverseerAction,
+  OverseerAlert,
+  OverseerConfig,
+  ToolCall,
+} from './types.js';

package/src/llm-overseer.ts

@@ -0,0 +1,59 @@
+import { OverseerMonitor } from './monitor.js';
+import type {
+  OverseerConfig,
+  AgentSnapshot,
+  OverseerAlert,
+  AssessmentResult,
+  LLMAssessment,
+  LLMCallerLike,
+  OverseerAction,
+} from './types.js';
+
+export class ActiveOverseer {
+  private readonly monitor: OverseerMonitor;
+  private readonly llmCaller?: LLMCallerLike;
+  private readonly history: AssessmentResult[] = [];
+
+  constructor(config: OverseerConfig, llmCaller?: LLMCallerLike) {
+    this.monitor = new OverseerMonitor(config);
+    this.llmCaller = llmCaller;
+  }
+
+  async assess(snapshot: AgentSnapshot): Promise<AssessmentResult> {
+    const heuristicAlerts = this.monitor.analyze(snapshot);
+
+    let llmAssessment: LLMAssessment | undefined;
+    let action: OverseerAction = 'none';
+    let notification: string | undefined;
+
+    if (heuristicAlerts.length > 0) {
+      action = 'alert';
+
+      if (this.llmCaller) {
+        try {
+          llmAssessment = await this.llmCaller.assessWithLLM(heuristicAlerts, snapshot);
+          action = llmAssessment.suggestedAction;
+          notification = llmAssessment.notification;
+        } catch {
+          // LLM failed — fall back to heuristic action
+        }
+      }
+    }
+
+    const result: AssessmentResult = {
+      agentId: snapshot.agentId,
+      heuristicAlerts,
+      llmAssessment,
+      action,
+      notification,
+      assessedAt: Date.now(),
+    };
+
+    this.history.push(result);
+    return result;
+  }
+
+  getAssessmentHistory(): AssessmentResult[] {
+    return [...this.history];
+  }
+}

package/src/monitor.ts

@@ -0,0 +1,168 @@
+import type { AgentSnapshot, OverseerAlert, OverseerConfig } from './types.js';
+
+export class OverseerMonitor {
+  private readonly config: OverseerConfig;
+
+  constructor(config: OverseerConfig) {
+    this.config = config;
+  }
+
+  analyze(snapshot: AgentSnapshot): OverseerAlert[] {
+    const alerts: OverseerAlert[] = [];
+    const now = Date.now();
+
+    const loopAlerts = this.detectLoops(snapshot, now);
+    alerts.push(...loopAlerts);
+
+    const stallAlert = this.detectStall(snapshot, now);
+    if (stallAlert) {
+      alerts.push(stallAlert);
+    }
+
+    const budgetAlert = this.detectBudgetExceeded(snapshot, now);
+    if (budgetAlert) {
+      alerts.push(budgetAlert);
+    }
+
+    return alerts;
+  }
+
+  private detectLoops(snapshot: AgentSnapshot, now: number): OverseerAlert[] {
+    const alerts: OverseerAlert[] = [];
+    const { toolCalls } = snapshot;
+    const { loopThreshold } = this.config;
+
+    if (toolCalls.length < loopThreshold) {
+      return alerts;
+    }
+
+    // Detect single-tool repetition: same tool N times consecutively
+    const singleToolAlert = this.detectSingleToolRepetition(snapshot, now);
+    if (singleToolAlert) {
+      alerts.push(singleToolAlert);
+    }
+
+    // Detect repeating patterns (e.g. A,B,A,B,A,B)
+    const patternAlert = this.detectRepeatingPattern(snapshot, now);
+    if (patternAlert) {
+      alerts.push(patternAlert);
+    }
+
+    return alerts;
+  }
+
+  private detectSingleToolRepetition(
+    snapshot: AgentSnapshot,
+    now: number,
+  ): OverseerAlert | undefined {
+    const { toolCalls } = snapshot;
+    const { loopThreshold } = this.config;
+
+    if (toolCalls.length < loopThreshold) {
+      return undefined;
+    }
+
+    // Check the last N tool calls for same-tool repetition
+    const tail = toolCalls.slice(-loopThreshold);
+    const allSame = tail.every((tc) => tc.tool === tail[0]!.tool);
+
+    if (allSame) {
+      return {
+        type: 'loop_detected',
+        agentId: snapshot.agentId,
+        message: `Tool "${tail[0]!.tool}" called ${loopThreshold} times consecutively`,
+        severity: 'warning',
+        detectedAt: now,
+      };
+    }
+
+    return undefined;
+  }
+
+  private detectRepeatingPattern(
+    snapshot: AgentSnapshot,
+    now: number,
+  ): OverseerAlert | undefined {
+    const { toolCalls } = snapshot;
+    const { loopThreshold } = this.config;
+    const tools = toolCalls.map((tc) => tc.tool);
+
+    // Try pattern lengths from 2 up to half the tool call list
+    const maxPatternLen = Math.floor(tools.length / 2);
+
+    for (let patternLen = 2; patternLen <= maxPatternLen; patternLen++) {
+      const repetitions = this.countPatternRepetitions(tools, patternLen);
+      if (repetitions >= loopThreshold) {
+        const tailStart = tools.length - patternLen * Math.floor(tools.length / patternLen);
+        const pattern = tools.slice(tailStart, tailStart + patternLen).join(',');
+        return {
+          type: 'loop_detected',
+          agentId: snapshot.agentId,
+          message: `Repeating pattern [${pattern}] detected ${repetitions} times`,
+          severity: 'warning',
+          detectedAt: now,
+        };
+      }
+    }
+
+    return undefined;
+  }
+
+  private countPatternRepetitions(tools: string[], patternLen: number): number {
+    const pattern = tools.slice(-patternLen * Math.floor(tools.length / patternLen));
+    if (pattern.length < patternLen * 2) {
+      return 0;
+    }
+
+    const base = pattern.slice(0, patternLen);
+    let count = 0;
+
+    for (let i = 0; i <= pattern.length - patternLen; i += patternLen) {
+      const chunk = pattern.slice(i, i + patternLen);
+      const matches = chunk.every((t, idx) => t === base[idx]);
+      if (matches) {
+        count++;
+      } else {
+        break;
+      }
+    }
+
+    return count;
+  }
+
+  private detectStall(
+    snapshot: AgentSnapshot,
+    now: number,
+  ): OverseerAlert | undefined {
+    const idleMs = now - snapshot.lastActivityAt;
+
+    if (idleMs > this.config.stallTimeoutMs) {
+      return {
+        type: 'stall_detected',
+        agentId: snapshot.agentId,
+        message: `Agent idle for ${Math.round(idleMs / 1000)}s (threshold: ${Math.round(this.config.stallTimeoutMs / 1000)}s)`,
+        severity: 'critical',
+        detectedAt: now,
+      };
+    }
+
+    return undefined;
+  }
+
+  private detectBudgetExceeded(
+    snapshot: AgentSnapshot,
+    now: number,
+  ): OverseerAlert | undefined {
+    if (snapshot.tokenUsage > this.config.maxTokenBudget) {
+      return {
+        type: 'budget_exceeded',
+        agentId: snapshot.agentId,
+        message: `Token usage ${snapshot.tokenUsage} exceeds budget ${this.config.maxTokenBudget}`,
+        severity: 'critical',
+        detectedAt: now,
+      };
+    }
+
+    return undefined;
+  }
+}

package/src/types.ts

@@ -0,0 +1,51 @@
+export interface OverseerConfig {
+  loopThreshold: number;
+  stallTimeoutMs: number;
+  maxTokenBudget: number;
+  checkIntervalMs: number;
+}
+
+export interface ToolCall {
+  tool: string;
+  timestamp: number;
+}
+
+export interface AgentSnapshot {
+  agentId: string;
+  toolCalls: ToolCall[];
+  tokenUsage: number;
+  lastActivityAt: number;
+  startedAt: number;
+}
+
+export type AlertType = 'loop_detected' | 'stall_detected' | 'budget_exceeded';
+
+export interface OverseerAlert {
+  type: AlertType;
+  agentId: string;
+  message: string;
+  severity: 'warning' | 'critical';
+  detectedAt: number;
+}
+
+export type OverseerAction = 'none' | 'alert' | 'notify' | 'cancel';
+
+export interface LLMAssessment {
+  severity: 'warning' | 'critical';
+  reasoning: string;
+  suggestedAction: OverseerAction;
+  notification?: string;
+}
+
+export interface AssessmentResult {
+  agentId: string;
+  heuristicAlerts: OverseerAlert[];
+  llmAssessment?: LLMAssessment;
+  action: OverseerAction;
+  notification?: string;
+  assessedAt: number;
+}
+
+export interface LLMCallerLike {
+  assessWithLLM(alerts: OverseerAlert[], snapshot: AgentSnapshot): Promise<LLMAssessment>;
+}

package/tests/alert-store.test.ts

@@ -0,0 +1,77 @@
+import { mkdtempSync, rmSync } from 'node:fs';
+import { tmpdir } from 'node:os';
+import { join } from 'node:path';
+import { describe, it, expect, beforeEach, afterEach } from 'vitest';
+import { AlertStore } from '../src/alert-store.js';
+import type { OverseerAlert } from '../src/types.js';
+
+function makeAlert(overrides: Partial<OverseerAlert> = {}): OverseerAlert {
+  return {
+    type: 'loop_detected',
+    agentId: 'agent-1',
+    message: 'Loop detected',
+    severity: 'warning',
+    detectedAt: Date.now(),
+    ...overrides,
+  };
+}
+
+describe('AlertStore', () => {
+  let dir: string;
+  let store: AlertStore;
+
+  beforeEach(() => {
+    dir = mkdtempSync(join(tmpdir(), 'alert-store-'));
+    store = new AlertStore(join(dir, 'alerts.db'));
+  });
+
+  afterEach(() => {
+    store.close();
+    rmSync(dir, { recursive: true, force: true });
+  });
+
+  it('stores and retrieves alerts', () => {
+    store.record(makeAlert({ message: 'first' }));
+    store.record(makeAlert({ message: 'second' }));
+
+    const recent = store.getRecent(10);
+    expect(recent).toHaveLength(2);
+    expect(recent[0].id).toBeTypeOf('number');
+    expect(recent.map((a) => a.message)).toContain('first');
+    expect(recent.map((a) => a.message)).toContain('second');
+  });
+
+  it('filters by agent', () => {
+    store.record(makeAlert({ agentId: 'a1' }));
+    store.record(makeAlert({ agentId: 'a2' }));
+    store.record(makeAlert({ agentId: 'a1' }));
+
+    const results = store.getByAgent('a1');
+    expect(results).toHaveLength(2);
+    expect(results.every((a) => a.agentId === 'a1')).toBe(true);
+  });
+
+  it('filters by severity', () => {
+    store.record(makeAlert({ severity: 'warning' }));
+    store.record(makeAlert({ severity: 'critical' }));
+    store.record(makeAlert({ severity: 'critical' }));
+
+    const results = store.getBySeverity('critical');
+    expect(results).toHaveLength(2);
+    expect(results.every((a) => a.severity === 'critical')).toBe(true);
+  });
+
+  it('acknowledges alerts', () => {
+    store.record(makeAlert());
+    store.record(makeAlert());
+
+    const before = store.getUnacknowledged();
+    expect(before).toHaveLength(2);
+
+    store.acknowledge(before[0].id);
+    store.acknowledge(before[1].id);
+
+    const after = store.getUnacknowledged();
+    expect(after).toHaveLength(0);
+  });
+});

package/tests/assessment-store.test.ts

@@ -0,0 +1,79 @@
+import { describe, it, expect, afterEach } from 'vitest';
+import { AssessmentStore } from '../src/assessment-store.js';
+import { mkdtempSync, rmSync } from 'node:fs';
+import { join } from 'node:path';
+import { tmpdir } from 'node:os';
+import type { AssessmentResult } from '../src/types.js';
+
+describe('AssessmentStore', () => {
+  let store: AssessmentStore;
+  let tmpDir: string;
+
+  afterEach(() => {
+    store?.close();
+    if (tmpDir) rmSync(tmpDir, { recursive: true, force: true });
+  });
+
+  it('stores and retrieves assessments', () => {
+    tmpDir = mkdtempSync(join(tmpdir(), 'as-'));
+    store = new AssessmentStore(join(tmpDir, 'assessments.db'));
+
+    const assessment: AssessmentResult = {
+      agentId: 'agent-1',
+      heuristicAlerts: [{ type: 'loop_detected', agentId: 'agent-1', message: 'loop', severity: 'warning', detectedAt: 1000 }],
+      action: 'alert',
+      assessedAt: Date.now(),
+    };
+
+    store.record(assessment);
+    const results = store.getByAgent('agent-1');
+    expect(results).toHaveLength(1);
+    expect(results[0].action).toBe('alert');
+    expect(results[0].heuristicAlerts).toHaveLength(1);
+  });
+
+  it('stores assessments with LLM data', () => {
+    tmpDir = mkdtempSync(join(tmpdir(), 'as-'));
+    store = new AssessmentStore(join(tmpDir, 'assessments.db'));
+
+    const assessment: AssessmentResult = {
+      agentId: 'agent-2',
+      heuristicAlerts: [{ type: 'budget_exceeded', agentId: 'agent-2', message: 'over budget', severity: 'critical', detectedAt: 2000 }],
+      llmAssessment: { severity: 'critical', reasoning: 'Agent has used too many tokens', suggestedAction: 'cancel', notification: 'Stop' },
+      action: 'cancel',
+      notification: 'Stop',
+      assessedAt: Date.now(),
+    };
+
+    store.record(assessment);
+    const results = store.getByAgent('agent-2');
+    expect(results[0].llmAssessment?.reasoning).toBe('Agent has used too many tokens');
+    expect(results[0].notification).toBe('Stop');
+  });
+
+  it('filters by action type', () => {
+    tmpDir = mkdtempSync(join(tmpdir(), 'as-'));
+    store = new AssessmentStore(join(tmpDir, 'assessments.db'));
+
+    store.record({ agentId: 'a', heuristicAlerts: [], action: 'none', assessedAt: 1000 });
+    store.record({ agentId: 'b', heuristicAlerts: [{ type: 'stall_detected', agentId: 'b', message: 'stall', severity: 'warning', detectedAt: 2000 }], action: 'alert', assessedAt: 2000 });
+    store.record({ agentId: 'c', heuristicAlerts: [{ type: 'loop_detected', agentId: 'c', message: 'loop', severity: 'critical', detectedAt: 3000 }], action: 'cancel', assessedAt: 3000 });
+
+    const cancels = store.getByAction('cancel');
+    expect(cancels).toHaveLength(1);
+    expect(cancels[0].agentId).toBe('c');
+  });
+
+  it('returns recent assessments with limit', () => {
+    tmpDir = mkdtempSync(join(tmpdir(), 'as-'));
+    store = new AssessmentStore(join(tmpDir, 'assessments.db'));
+
+    for (let i = 0; i < 5; i++) {
+      store.record({ agentId: `a${i}`, heuristicAlerts: [], action: 'none', assessedAt: i * 1000 });
+    }
+
+    const recent = store.getRecent(2);
+    expect(recent).toHaveLength(2);
+    expect(recent[0].agentId).toBe('a4');
+  });
+});

package/tests/llm-overseer.test.ts

@@ -0,0 +1,102 @@
+import { describe, it, expect, vi } from 'vitest';
+import { ActiveOverseer } from '../src/llm-overseer.js';
+import type { AgentSnapshot, OverseerConfig } from '../src/types.js';
+
+const defaultConfig: OverseerConfig = {
+  loopThreshold: 3,
+  stallTimeoutMs: 30_000,
+  maxTokenBudget: 50_000,
+  checkIntervalMs: 5_000,
+};
+
+const makeSnapshot = (overrides: Partial<AgentSnapshot> = {}): AgentSnapshot => ({
+  agentId: 'test-agent',
+  toolCalls: [],
+  tokenUsage: 0,
+  lastActivityAt: Date.now(),
+  startedAt: Date.now() - 10_000,
+  ...overrides,
+});
+
+describe('ActiveOverseer', () => {
+  it('returns heuristic alerts when no LLM is provided', async () => {
+    const overseer = new ActiveOverseer(defaultConfig);
+
+    const snapshot = makeSnapshot({
+      toolCalls: [
+        { tool: 'read', timestamp: 1 },
+        { tool: 'read', timestamp: 2 },
+        { tool: 'read', timestamp: 3 },
+      ],
+    });
+
+    const result = await overseer.assess(snapshot);
+    expect(result.heuristicAlerts.length).toBeGreaterThan(0);
+    expect(result.llmAssessment).toBeUndefined();
+    expect(result.action).toBe('alert');
+  });
+
+  it('calls LLM for assessment when provided and heuristic triggers', async () => {
+    const mockLLM = vi.fn().mockResolvedValue({
+      severity: 'critical',
+      reasoning: 'Agent is stuck in a read loop',
+      suggestedAction: 'cancel',
+      notification: 'You appear to be repeating the same action. Please try a different approach.',
+    });
+
+    const overseer = new ActiveOverseer(defaultConfig, { assessWithLLM: mockLLM });
+
+    const snapshot = makeSnapshot({
+      toolCalls: [
+        { tool: 'read', timestamp: 1 },
+        { tool: 'read', timestamp: 2 },
+        { tool: 'read', timestamp: 3 },
+      ],
+    });
+
+    const result = await overseer.assess(snapshot);
+    expect(mockLLM).toHaveBeenCalledTimes(1);
+    expect(result.llmAssessment).toBeDefined();
+    expect(result.llmAssessment?.suggestedAction).toBe('cancel');
+    expect(result.action).toBe('cancel');
+    expect(result.notification).toBe('You appear to be repeating the same action. Please try a different approach.');
+  });
+
+  it('skips LLM when heuristic finds no issues', async () => {
+    const mockLLM = vi.fn();
+    const overseer = new ActiveOverseer(defaultConfig, { assessWithLLM: mockLLM });
+
+    const snapshot = makeSnapshot();
+    const result = await overseer.assess(snapshot);
+
+    expect(mockLLM).not.toHaveBeenCalled();
+    expect(result.heuristicAlerts).toHaveLength(0);
+    expect(result.action).toBe('none');
+  });
+
+  it('falls back to heuristic action when LLM fails', async () => {
+    const mockLLM = vi.fn().mockRejectedValue(new Error('LLM unavailable'));
+    const overseer = new ActiveOverseer(defaultConfig, { assessWithLLM: mockLLM });
+
+    const snapshot = makeSnapshot({
+      tokenUsage: 60_000,
+    });
+
+    const result = await overseer.assess(snapshot);
+    expect(result.heuristicAlerts.length).toBeGreaterThan(0);
+    expect(result.llmAssessment).toBeUndefined();
+    expect(result.action).toBe('alert');
+  });
+
+  it('records assessments in history', async () => {
+    const overseer = new ActiveOverseer(defaultConfig);
+
+    await overseer.assess(makeSnapshot({ tokenUsage: 60_000 }));
+    await overseer.assess(makeSnapshot());
+
+    const history = overseer.getAssessmentHistory();
+    expect(history).toHaveLength(2);
+    expect(history[0].action).toBe('alert');
+    expect(history[1].action).toBe('none');
+  });
+});

package/tests/monitor.test.ts

@@ -0,0 +1,122 @@
+import { describe, expect, it, vi } from 'vitest';
+
+import { OverseerMonitor } from '../src/monitor.js';
+import type { AgentSnapshot, OverseerConfig } from '../src/types.js';
+
+const baseConfig: OverseerConfig = {
+  loopThreshold: 3,
+  stallTimeoutMs: 10_000,
+  maxTokenBudget: 50_000,
+  checkIntervalMs: 5_000,
+};
+
+function makeSnapshot(overrides: Partial<AgentSnapshot> = {}): AgentSnapshot {
+  const now = Date.now();
+  return {
+    agentId: 'agent-1',
+    toolCalls: [],
+    tokenUsage: 1_000,
+    lastActivityAt: now,
+    startedAt: now - 5_000,
+    ...overrides,
+  };
+}
+
+describe('OverseerMonitor', () => {
+  it('detects tool call looping (3 same tool = loop with threshold 3)', () => {
+    const monitor = new OverseerMonitor(baseConfig);
+    const now = Date.now();
+    const snapshot = makeSnapshot({
+      toolCalls: [
+        { tool: 'search', timestamp: now - 3000 },
+        { tool: 'search', timestamp: now - 2000 },
+        { tool: 'search', timestamp: now - 1000 },
+      ],
+    });
+
+    const alerts = monitor.analyze(snapshot);
+
+    expect(alerts.length).toBeGreaterThanOrEqual(1);
+    const loopAlert = alerts.find(
+      (a) => a.type === 'loop_detected' && a.message.includes('search'),
+    );
+    expect(loopAlert).toBeDefined();
+    expect(loopAlert!.severity).toBe('warning');
+    expect(loopAlert!.agentId).toBe('agent-1');
+  });
+
+  it('detects stalling agent (15s idle with 10s threshold)', () => {
+    const monitor = new OverseerMonitor(baseConfig);
+    const now = Date.now();
+    vi.spyOn(Date, 'now').mockReturnValue(now);
+
+    const snapshot = makeSnapshot({
+      lastActivityAt: now - 15_000,
+    });
+
+    const alerts = monitor.analyze(snapshot);
+
+    vi.restoreAllMocks();
+
+    const stallAlert = alerts.find((a) => a.type === 'stall_detected');
+    expect(stallAlert).toBeDefined();
+    expect(stallAlert!.severity).toBe('critical');
+    expect(stallAlert!.message).toContain('15s');
+  });
+
+  it('detects token budget exceeded (60k with 50k threshold)', () => {
+    const monitor = new OverseerMonitor(baseConfig);
+    const snapshot = makeSnapshot({
+      tokenUsage: 60_000,
+    });
+
+    const alerts = monitor.analyze(snapshot);
+
+    const budgetAlert = alerts.find((a) => a.type === 'budget_exceeded');
+    expect(budgetAlert).toBeDefined();
+    expect(budgetAlert!.severity).toBe('critical');
+    expect(budgetAlert!.message).toContain('60000');
+    expect(budgetAlert!.message).toContain('50000');
+  });
+
+  it('returns empty for healthy agent', () => {
+    const monitor = new OverseerMonitor(baseConfig);
+    const now = Date.now();
+    const snapshot = makeSnapshot({
+      toolCalls: [
+        { tool: 'search', timestamp: now - 2000 },
+        { tool: 'read', timestamp: now - 1000 },
+      ],
+      tokenUsage: 5_000,
+      lastActivityAt: now,
+    });
+
+    const alerts = monitor.analyze(snapshot);
+
+    expect(alerts).toEqual([]);
+  });
+
+  it('detects repeated consecutive tool pattern (search,read,search,read,search,read)', () => {
+    const monitor = new OverseerMonitor(baseConfig);
+    const now = Date.now();
+    const snapshot = makeSnapshot({
+      toolCalls: [
+        { tool: 'search', timestamp: now - 6000 },
+        { tool: 'read', timestamp: now - 5000 },
+        { tool: 'search', timestamp: now - 4000 },
+        { tool: 'read', timestamp: now - 3000 },
+        { tool: 'search', timestamp: now - 2000 },
+        { tool: 'read', timestamp: now - 1000 },
+      ],
+    });
+
+    const alerts = monitor.analyze(snapshot);
+
+    const patternAlert = alerts.find(
+      (a) => a.type === 'loop_detected' && a.message.includes('pattern'),
+    );
+    expect(patternAlert).toBeDefined();
+    expect(patternAlert!.message).toContain('search');
+    expect(patternAlert!.message).toContain('read');
+  });
+});

package/tsconfig.json

@@ -0,0 +1,5 @@
+{
+  "extends": "../../tsconfig.json",
+  "compilerOptions": { "rootDir": "src", "outDir": "dist" },
+  "include": ["src"]
+}