bare-agent 0.7.0 → 0.8.0

package/LICENSE

@@ -0,0 +1,202 @@
+                                 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 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 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 those 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
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   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/NOTICE

@@ -0,0 +1,13 @@
+bare-agent
+Copyright 2026 hamr0
+
+This product includes software developed by hamr0
+(https://github.com/hamr0/bareagent).
+
+Licensed under the Apache License, Version 2.0 (the "License").
+You may obtain a copy of the License at:
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+This NOTICE file is required by Section 4(d) of the License.
+Forks and derivative works MUST preserve this attribution.

package/README.md

@@ -11,9 +11,9 @@
 
 ```
 
-**Agent orchestration in ~1800 lines. Zero required deps. MIT license.**
+**Agent orchestration in ~2.4K lines of core. One required dep ([bareguard](https://npmjs.com/package/bareguard)). Apache 2.0.**
 
-Lightweight enough to understand completely. Complete enough to not reinvent wheels. Not a framework, not 50,000 lines of opinions — just composable building blocks for agents.
+Lightweight enough to understand completely. Complete enough to not reinvent wheels. Not a framework, not 50,000 lines of opinions — just composable building blocks for agents. Single-gate governance via bareguard: every tool call traverses one policy hook, one audit log, one budget cap.
 
 ## Quick start
 
@@ -60,7 +60,7 @@ Every piece works alone — take what you need, ignore the rest.
 
 | Component | What it does |
 |---|---|
-| **Loop** | Think → act → observe → repeat. Calls any LLM, executes your tools, loops until done. Throws on error by default. Returns estimated USD cost per run. Loop-level `policy(toolName, args, ctx)` + `audit` gate every tool call (native, MCP, browsing, mobile, user-defined) through one hook — `ctx` is a per-call opaque blob for multi-tenant routing. `maxCost` cap catches runaway loops before they burn budget. Unified `loop:error` + `onError` surface every previously silent failure (audit write, callback throw, Checkpoint timeout) |
+| **Loop** | Think → act → observe → repeat. Calls any LLM, executes your tools, loops until done. Returns estimated USD cost per run. Governance via `Loop({ policy })` — wire bareguard's `Gate` through `wireGate(gate)` and every tool call (native, MCP, browsing, mobile) traverses one chokepoint with per-caller `ctx` routing. Bareguard owns the audit log, budget caps, and halt decisions; Loop respects the verdict. `onError` + `loop:error` surface every silent-ish failure (callback throw, Checkpoint timeout) |
 | **Planner** | Break a goal into a step DAG via LLM. Built-in caching (`cacheTTL`) |
 | **runPlan** | Execute steps in parallel waves. Dependency-aware, failure propagation, per-step retry |
 | **Retry** | Exponential/linear backoff with jitter. Respects `err.retryable` |
@@ -71,8 +71,8 @@ Every piece works alone — take what you need, ignore the rest.
 | **Checkpoint** | Human approval gate. You provide the transport — terminal, Telegram, Slack, whatever |
 | **Scheduler** | Cron (`0 9 * * 1-5`) or relative (`2h`, `30m`). Persisted jobs survive restarts |
 | **Stream** | Structured event emitter. Pipe as JSONL, subscribe in-process, or custom transport |
-| **Errors** | Typed hierarchy — `ProviderError`, `ToolError`, `TimeoutError`, `MaxRoundsError`, `MaxCostError`, `CircuitOpenError`, `ValidationError` |
-| **Policy helpers** | `pathAllowlist`, `commandAllowlist`, `combinePolicies` — composable predicates for `Loop({ policy })`. Home expansion, deny-wins, short-circuit combinator, argv-based safe allowlists. `require('bare-agent/policy')` |
+| **Errors** | Typed hierarchy — `ProviderError`, `ToolError`, `TimeoutError`, `CircuitOpenError`, `ValidationError`. Halt decisions (turn cap, budget cap, content rules) come from bareguard, not Loop |
+| **bareguard adapter** | `wireGate(gate)` returns `{ policy, wrapTools }` — one-line wiring to bareguard's `Gate`. Maps gate decisions to Loop's `policy` contract; `wrapTools` decorates tools so `gate.record` fires after every execute. `require('bare-agent/bareguard')` |
 | **Browsing** | Web navigation, clicking, typing, reading via `barebrowse` (17 tools). Two modes: library tools (inline snapshots, pass to Loop) or CLI session (disk-based snapshots, token-efficient for multi-step flows). Optional `assess` tool (privacy scan) when `wearehere` is installed |
 | **Mobile** | Android + iOS device control via `baremobile`. Same two modes: library tools (`createMobileTools` — action tools auto-return snapshots) or CLI session (`baremobile` CLI — disk-based snapshots) |
 | **Shell** | Cross-platform `shell_read`, `shell_grep`, `shell_run` (argv, no shell), `shell_exec` (raw shell). Pure Node — no `grep`/`rg`/`findstr` dependency. Injection-proof `shell_run` for policy-gated use |
@@ -84,7 +84,7 @@ Every piece works alone — take what you need, ignore the rest.
 
 **Cross-language:** Runs as a subprocess. Communicate via JSONL on stdin/stdout from Python, Go, Rust, Ruby, Java, or anything that can spawn a process. Ready-made wrappers in [`contrib/`](contrib/README.md).
 
-**Deps:** 0 required. Optional: `cron-parser` (cron expressions), `better-sqlite3` (SQLite store), `barebrowse` (web browsing), `baremobile` (Android + iOS device control), `wearehere` (privacy assessment via barebrowse).
+**Deps:** 1 required (`bareguard` for governance — single-gate policy + audit + budget). Optional: `cron-parser` (cron expressions), `better-sqlite3` (SQLite store), `barebrowse` (web browsing), `baremobile` (Android + iOS device control), `wearehere` (privacy assessment via barebrowse).
 
 ---
 
@@ -141,15 +141,17 @@ For wiring recipes and API details, see the **[Integration Guide](bareagent.cont
 
 ## The bare ecosystem
 
-Three vanilla JS modules. Zero dependencies. Same API patterns.
+Four vanilla JS modules. Zero deps where possible (bareguard has one). Same API patterns.
 
-| | [**bareagent**](https://npmjs.com/package/bare-agent) | [**barebrowse**](https://npmjs.com/package/barebrowse) | [**baremobile**](https://npmjs.com/package/baremobile) |
-|---|---|---|---|
-| **Does** | Gives agents a think→act loop | Gives agents a real browser | Gives agents Android + iOS devices |
-| **How** | Goal in → coordinated actions out | URL in → pruned snapshot out | Screen in → pruned snapshot out |
-| **Replaces** | LangChain, CrewAI, AutoGen | Playwright, Selenium, Puppeteer | Appium, Espresso, XCUITest |
-| **Interfaces** | Library · CLI · subprocess | Library · CLI · MCP | Library · CLI · MCP |
-| **Solo or together** | Orchestrates both as tools | Works standalone | Works standalone |
+| | [**bareagent**](https://npmjs.com/package/bare-agent) | [**barebrowse**](https://npmjs.com/package/barebrowse) | [**baremobile**](https://npmjs.com/package/baremobile) | [**bareguard**](https://npmjs.com/package/bareguard) |
+|---|---|---|---|---|
+| **Does** | Gives agents a think→act loop | Gives agents a real browser | Gives agents Android + iOS devices | Gates everything an agent does |
+| **How** | Goal in → coordinated actions out | URL in → pruned snapshot out | Screen in → pruned snapshot out | Action in → allow / deny / human-asked out |
+| **Replaces** | LangChain, CrewAI, AutoGen | Playwright, Selenium, Puppeteer | Appium, Espresso, XCUITest | Hand-rolled allowlists, scattered policy code |
+| **Interfaces** | Library · CLI · subprocess | Library · CLI · MCP | Library · CLI · MCP | Library |
+| **Solo or together** | Orchestrates the others as tools | Works standalone | Works standalone | Embedded in bareagent's loop; usable by any runner |
+
+> **Reach 50+ messengers with one Docker container via [beeperbox](https://github.com/hamr0/beeperbox)** — a headless Beeper Desktop that exposes WhatsApp, iMessage, Signal, Telegram, Slack, Discord, RCS, SMS and more as a single MCP server. Wire it through bareagent's MCP bridge; bareguard policies the invocations like any other tool (per-chat allowlists, ask patterns on destructive sends, all the usual layered defense).
 
 **What you can build:**
 
@@ -163,4 +165,4 @@ Three vanilla JS modules. Zero dependencies. Same API patterns.
 
 ## License
 
-MIT
+Apache License, Version 2.0 — see [LICENSE](LICENSE) and [NOTICE](NOTICE).

package/index.js

@@ -10,6 +10,7 @@ const { Stream } = require('./src/stream');
 const { Retry } = require('./src/retry');
 const { runPlan } = require('./src/run-plan');
 const { CircuitBreaker } = require('./src/circuit-breaker');
+const { wireGate } = require('./src/bareguard-adapter');
 const {
   BareAgentError,
   ProviderError,
@@ -17,8 +18,6 @@ const {
   TimeoutError,
   ValidationError,
   CircuitOpenError,
-  MaxRoundsError,
-  MaxCostError,
 } = require('./src/errors');
 
 module.exports = {
@@ -32,12 +31,11 @@ module.exports = {
   Retry,
   runPlan,
   CircuitBreaker,
+  wireGate,
   BareAgentError,
   ProviderError,
   ToolError,
   TimeoutError,
   ValidationError,
   CircuitOpenError,
-  MaxRoundsError,
-  MaxCostError,
 };

package/package.json

@@ -1,14 +1,16 @@
 {
   "name": "bare-agent",
-  "version": "0.7.0",
+  "version": "0.8.0",
   "files": [
     "index.js",
     "src/",
     "bin/",
-    "tools/"
+    "tools/",
+    "LICENSE",
+    "NOTICE"
   ],
-  "description": "Lightweight, composable agent orchestration. ~1800 lines, 0 required deps.",
-  "license": "MIT",
+  "description": "Lightweight, composable agent orchestration for autonomous agents. Single-gate governance via bareguard, cross-platform shell tools, MCP bridge. ~2.4K lines core, one required dep.",
+  "license": "Apache-2.0",
   "author": "hamr0",
   "repository": {
     "type": "git",
@@ -25,7 +27,7 @@
     "./transports": "./src/transports.js",
     "./tools": "./src/tools.js",
     "./mcp": "./src/mcp.js",
-    "./policy": "./src/policy.js"
+    "./bareguard": "./src/bareguard-adapter.js"
   },
   "engines": {
     "node": ">=18"
@@ -37,8 +39,13 @@
     "ai",
     "tool-calling",
     "planner",
-    "lightweight"
+    "lightweight",
+    "bareguard",
+    "governance"
   ],
+  "dependencies": {
+    "bareguard": "^0.1.1"
+  },
   "optionalDependencies": {
     "barebrowse": "^0.5.0",
     "baremobile": "^0.7.0",

package/src/bareguard-adapter.js

@@ -0,0 +1,93 @@
+'use strict';
+
+/**
+ * Wire a bareguard Gate into bareagent's Loop.
+ *
+ * Returns:
+ *   - `policy`   — async (toolName, args, ctx) closure for `new Loop({ policy })`.
+ *                  Maps gate.check decisions to true (allow) or a deny string
+ *                  (used verbatim by Loop as the LLM-visible reason).
+ *   - `wrapTool` — wraps a single tool so its execute() also calls gate.record
+ *                  with the result + duration (or error). Bareguard owns the
+ *                  audit log and budget tracking; record() is what feeds them.
+ *   - `wrapTools` — convenience: applies wrapTool to an array.
+ *
+ * Halt-severity decisions (budget exhausted, limits.maxTurns hit, etc.) come
+ * back as deny strings tagged `[HALT: <rule>]`. Subsequent rounds halt the
+ * same way; the LLM typically gives up and the loop exits naturally. For
+ * earlier exit, watch the loop:error stream (the closure also calls onError
+ * via Loop's policy-deny path) or wire `onError` to detect halt strings.
+ *
+ * @param {object} gate - A bareguard Gate instance (must have .check and .record).
+ * @returns {{policy: Function, wrapTool: Function, wrapTools: Function}}
+ *
+ * @example
+ *   const { Gate } = require('bareguard');
+ *   const { Loop } = require('bare-agent');
+ *   const { wireGate } = require('bare-agent/bareguard');
+ *
+ *   const gate = new Gate({
+ *     budget: { maxCostUsd: 0.50 },
+ *     limits: { maxTurns: 20 },
+ *     audit:  { path: './audit.jsonl' },
+ *     humanChannel: async (ev) => ({ decision: 'deny' }),
+ *   });
+ *   await gate.init();
+ *
+ *   const { policy, wrapTools } = wireGate(gate);
+ *   const loop = new Loop({ provider, policy });
+ *   await loop.run(messages, wrapTools(myTools));
+ */
+function wireGate(gate) {
+  if (!gate || typeof gate.check !== 'function' || typeof gate.record !== 'function') {
+    throw new Error('[wireGate] expects a bareguard Gate instance (must have .check and .record).');
+  }
+
+  const policy = async (toolName, args, ctx) => {
+    const decision = await gate.check({ type: toolName, args, _ctx: ctx });
+    if (decision.outcome === 'allow') return true;
+    const tag = decision.severity === 'halt'
+      ? `[HALT: ${decision.rule}]`
+      : `[deny: ${decision.rule}]`;
+    return decision.reason ? `${tag} ${decision.reason}` : `${tag} ${toolName} denied`;
+  };
+
+  function wrapTool(tool) {
+    if (!tool || typeof tool.execute !== 'function') {
+      throw new Error('[wireGate.wrapTool] tool must have an execute() function');
+    }
+    const original = tool.execute;
+    return {
+      ...tool,
+      execute: async (args) => {
+        const action = { type: tool.name, args };
+        const startedAt = Date.now();
+        try {
+          const result = await original(args);
+          await gate.record(action, {
+            result: typeof result === 'string' ? result : JSON.stringify(result),
+            durationMs: Date.now() - startedAt,
+          });
+          return result;
+        } catch (err) {
+          await gate.record(action, {
+            error: err?.message || String(err),
+            durationMs: Date.now() - startedAt,
+          });
+          throw err;
+        }
+      },
+    };
+  }
+
+  function wrapTools(tools) {
+    if (!Array.isArray(tools)) {
+      throw new Error('[wireGate.wrapTools] expects an array of tools');
+    }
+    return tools.map(wrapTool);
+  }
+
+  return { policy, wrapTool, wrapTools };
+}
+
+module.exports = { wireGate };

package/src/errors.js

@@ -43,18 +43,6 @@ class CircuitOpenError extends BareAgentError {
   }
 }
 
-class MaxRoundsError extends BareAgentError {
-  constructor(message, opts = {}) {
-    super(message || 'Loop exceeded maximum rounds', { code: 'MAX_ROUNDS', retryable: false, ...opts });
-  }
-}
-
-class MaxCostError extends BareAgentError {
-  constructor(message, opts = {}) {
-    super(message || 'Loop exceeded maximum cost cap', { code: 'MAX_COST', retryable: false, ...opts });
-  }
-}
-
 module.exports = {
   BareAgentError,
   ProviderError,
@@ -62,6 +50,4 @@ module.exports = {
   TimeoutError,
   ValidationError,
   CircuitOpenError,
-  MaxRoundsError,
-  MaxCostError,
 };

package/src/loop.js

@@ -1,7 +1,6 @@
 'use strict';
 
-const fs = require('node:fs');
-const { ToolError, MaxRoundsError, MaxCostError } = require('./errors');
+const { ToolError } = require('./errors');
 
 // Average pricing per 1K tokens (USD). Adjust these to match your provider's rates.
 // Last updated: 2026-03-18. Source: public provider pricing pages.
@@ -21,6 +20,11 @@ const COST_PER_1K = {
   '_default': { in: 0.002, out: 0.008 },
 };
 
+// Internal safety net only — real iteration bounds come from a wired bareguard
+// Gate via `limits.maxTurns`. If you hit this without bareguard wired, you have
+// no governance and the LLM loop is unbounded by design — wire bareguard.
+const HARD_ROUND_LIMIT = 100;
+
 function estimateCost(model, usage) {
   if (!usage || !model) return null;
   const rates = COST_PER_1K[model] || COST_PER_1K['_default'];
@@ -34,20 +38,17 @@ class Loop {
   /**
    * @param {object} options
    * @param {object} options.provider - LLM provider (must implement generate()).
-   * @param {number} [options.maxRounds=5] - Maximum think/act/observe cycles.
    * @param {string} [options.system] - System prompt prepended to messages.
    * @param {object} [options.checkpoint] - Checkpoint instance for human-in-the-loop.
    * @param {object} [options.retry] - Retry instance for backoff on failures.
    * @param {object} [options.stream] - Stream instance for event emission.
    * @param {object} [options.store] - Store instance for validate() health check.
-   * @param {Function} [options.policy] - Async (toolName, args) => true|false|string. Deny returns the string (or a generic message) to the LLM as tool result.
-   * @param {string} [options.audit] - File path for JSONL audit log. Each tool call appends one line: {ts, tool, args, decision, result|reason|error, durationMs}.
+   * @param {Function} [options.policy] - Async (toolName, args, ctx) => true | string. Recommended wiring: closure that delegates to a bareguard Gate (`require('bare-agent/bareguard').wireGate(gate).policy`). Anything other than `true` denies; a string is fed to the LLM verbatim as the deny reason. All policy/budget/audit decisions live in bareguard — Loop just calls the closure and respects the verdict.
    * @throws {Error} `[Loop] requires a provider` — when options.provider is missing.
    */
   constructor(options = {}) {
     if (!options.provider) throw new Error('[Loop] requires a provider');
     this.provider = options.provider;
-    this.maxRounds = options.maxRounds || 5;
     this.system = options.system || null;
     this.checkpoint = options.checkpoint || null;
     this.retry = options.retry || null;
@@ -58,19 +59,16 @@ class Loop {
     this.throwOnError = options.throwOnError !== undefined ? options.throwOnError : true;
     this.store = options.store || null;
     if (options.policy != null && typeof options.policy !== 'function') {
-      throw new Error('[Loop] options.policy must be a function (toolName, args) => true | false | string');
+      throw new Error('[Loop] options.policy must be a function (toolName, args, ctx) => true | string');
     }
     this.policy = options.policy || null;
-    this.audit = options.audit || null;
-    this.maxCost = typeof options.maxCost === 'number' && options.maxCost > 0 ? options.maxCost : null;
     this._stopped = false;
     this._history = []; // for chat() stateful mode
-    this._auditInFlight = new Set();
   }
 
   // Unified error emitter — every silent-ish failure path routes through here so
-  // operators see audit writes, callback throws, checkpoint timeouts, stream listener
-  // errors in one place: loop:error stream event + onError callback.
+  // operators see callback throws, checkpoint timeouts, stream listener errors
+  // in one place: loop:error stream event + onError callback.
   _reportError(source, err, extra = {}) {
     const message = err?.message || String(err);
     this._safeEmit({ type: 'loop:error', data: { source, error: message, ...extra } });
@@ -106,35 +104,11 @@ class Loop {
     }
   }
 
-  // Append one JSONL record. Returns nothing (fire-and-forget for callers)
-  // but tracks the in-flight promise so `flush()` and the end of `run()` can await it.
-  _writeAudit(record) {
-    if (!this.audit) return;
-    let line;
-    try {
-      line = JSON.stringify(record) + '\n';
-    } catch (err) {
-      this._reportError('audit:serialize', err, { tool: record?.tool });
-      return;
-    }
-    const p = fs.promises.appendFile(this.audit, line)
-      .catch(err => this._reportError('audit:write', err, { tool: record?.tool }))
-      .finally(() => this._auditInFlight.delete(p));
-    this._auditInFlight.add(p);
-  }
-
-  // Await any in-flight audit writes. Safe to call multiple times; resolves immediately
-  // when no writes are pending. Called automatically at the end of each `run()`.
-  async flush() {
-    if (this._auditInFlight.size === 0) return;
-    await Promise.all([...this._auditInFlight]);
-  }
-
   /**
    * Run the think/act/observe loop.
    * @param {Array<object>} messages - Conversation messages in OpenAI format.
    * @param {Array<object>} [tools=[]] - Tool definitions with name, execute, description, parameters.
-   * @param {object} [options={}] - Per-run overrides (system, temperature, etc.).
+   * @param {object} [options={}] - Per-run overrides (system, temperature, ctx, etc.).
    * @returns {Promise<{text: string, toolCalls: Array, usage: object, error: string|null}>}
    * @throws {Error} `[Loop] Tool is missing a name` — when a tool has no name or a non-string name.
    * @throws {Error} `[Loop] Tool "X" is missing an execute() function` — when execute is not a function.
@@ -170,7 +144,7 @@ class Loop {
     let lastUsage = { inputTokens: 0, outputTokens: 0 };
     let totalCost = 0;
 
-    for (let round = 0; round < this.maxRounds; round++) {
+    for (let round = 0; round < HARD_ROUND_LIMIT; round++) {
       if (this._stopped) break;
 
       let result;
@@ -179,7 +153,6 @@ class Loop {
         result = this.retry ? await this.retry.call(generate) : await generate();
       } catch (err) {
         this._reportError('provider', err, { round });
-        await this.flush();
         if (this.throwOnError) throw err;
         return { text: '', toolCalls: [], usage: lastUsage, cost: totalCost, error: err.message };
       }
@@ -189,21 +162,10 @@ class Loop {
       const roundCost = estimateCost(model, lastUsage);
       if (roundCost !== null) totalCost += roundCost;
 
-      // Cost cap — fail fast before the next round costs more money.
-      if (this.maxCost !== null && totalCost > this.maxCost) {
-        const msg = `[Loop] cost ${totalCost.toFixed(4)} exceeded cap ${this.maxCost.toFixed(4)} after round ${round + 1}`;
-        const err = new MaxCostError(msg, { context: { cost: totalCost, maxCost: this.maxCost, round } });
-        this._reportError('cost-cap', err, { cost: totalCost, maxCost: this.maxCost });
-        await this.flush();
-        if (this.throwOnError) throw err;
-        return { text: '', toolCalls: [], usage: lastUsage, cost: totalCost, error: msg };
-      }
-
       // No tool calls — LLM gave a final text response
       if (!result.toolCalls || result.toolCalls.length === 0) {
         this._safeEmit({ type: 'loop:text', data: { text: result.text } });
         this._safeCall('onText', this.onText, result.text);
-        await this.flush();
         this._safeEmit({ type: 'loop:done', data: { text: result.text, usage: lastUsage, cost: totalCost } });
         return { text: result.text, toolCalls: [], usage: lastUsage, cost: totalCost, error: null };
       }
@@ -260,6 +222,8 @@ class Loop {
         // anything else (false, string, undefined, object, throw) denies. A string verdict
         // is used verbatim as the deny reason. `ctx` (opaque blob passed via
         // loop.run(msgs, tools, { ctx })) is forwarded as the third arg for per-caller gating.
+        // Recommended wiring: bareguard's Gate via `wireGate(gate).policy` — bareguard
+        // owns budget, audit, and halt decisions; Loop just respects the verdict.
         if (this.policy) {
           let verdict;
           try {
@@ -273,54 +237,29 @@ class Loop {
               : `[Loop] Tool "${tc.name}" denied by policy`;
             msgs.push({ role: 'tool', tool_call_id: tc.id, content: reason });
             this._safeEmit({ type: 'loop:tool_result', data: { tool: tc.name, denied: true, reason } });
-            this._writeAudit({
-              ts: new Date().toISOString(),
-              tool: tc.name,
-              args: tc.arguments,
-              decision: 'deny',
-              reason,
-            });
             continue;
           }
         }
 
-        const startedAt = Date.now();
         try {
           const execute = () => tool.execute(tc.arguments);
           const toolResult = this.retry ? await this.retry.call(execute) : await execute();
           const content = typeof toolResult === 'string' ? toolResult : JSON.stringify(toolResult);
           msgs.push({ role: 'tool', tool_call_id: tc.id, content });
           this._safeEmit({ type: 'loop:tool_result', data: { tool: tc.name, result: content } });
-          this._writeAudit({
-            ts: new Date().toISOString(),
-            tool: tc.name,
-            args: tc.arguments,
-            decision: 'allow',
-            result: content,
-            durationMs: Date.now() - startedAt,
-          });
         } catch (err) {
           const toolErr = err instanceof ToolError ? err : new ToolError(err.message, { context: { tool: tc.name } });
           const errMsg = `[Loop] Tool error: ${toolErr.message}`;
           msgs.push({ role: 'tool', tool_call_id: tc.id, content: errMsg });
           this._safeEmit({ type: 'loop:tool_result', data: { tool: tc.name, error: errMsg } });
-          this._writeAudit({
-            ts: new Date().toISOString(),
-            tool: tc.name,
-            args: tc.arguments,
-            decision: 'allow',
-            error: toolErr.message,
-            durationMs: Date.now() - startedAt,
-          });
         }
       }
     }
 
-    // maxRounds exceeded
-    const warning = `[Loop] ended after ${this.maxRounds} rounds without final response`;
-    await this.flush();
+    // Hard safety limit — should never fire under normal usage; bareguard's
+    // limits.maxTurns (or the LLM's natural completion) ends the loop first.
+    const warning = `[Loop] hit internal safety limit of ${HARD_ROUND_LIMIT} rounds. Wire bareguard for proper governance — see bare-agent/bareguard.`;
     this._safeEmit({ type: 'loop:done', data: { text: '', warning, cost: totalCost } });
-    if (this.throwOnError) throw new MaxRoundsError(warning);
     return { text: '', toolCalls: [], usage: lastUsage, cost: totalCost, error: warning };
   }
 

package/src/policy.js

@@ -1,132 +0,0 @@
-'use strict';
-
-/**
- * Policy helpers — composable predicates for `new Loop({ policy })`.
- *
- * Each helper returns an async function `(toolName, args, ctx) => true | string`
- * matching bareagent's policy contract. `true` allows; anything else denies.
- * A string is fed verbatim to the LLM as the deny reason.
- *
- * Compose multiple helpers with `combinePolicies(a, b, c)` — first non-`true`
- * verdict wins, short-circuit semantics.
- *
- * Zero deps. Pure Node. Cross-platform.
- */
-
-const path = require('node:path');
-
-function expandHome(p) {
-  if (!p || typeof p !== 'string') return p;
-  if (p === '~') return process.env.HOME || process.env.USERPROFILE || '';
-  if (p.startsWith('~/') || p.startsWith('~\\')) {
-    const home = process.env.HOME || process.env.USERPROFILE || '';
-    return path.join(home, p.slice(2));
-  }
-  return p;
-}
-
-function normalize(p) {
-  try {
-    return path.resolve(expandHome(p));
-  } catch {
-    return p;
-  }
-}
-
-/**
- * Allow/deny file-system paths used by tools like shell_read, shell_grep.
- *
- * Deny wins over allow. Paths containing `..` after normalization are denied
- * unconditionally (prevents traversal bypassing the allow list).
- *
- * @param {object} options
- * @param {string[]} [options.allow] - Path prefixes users may access. `~` expands.
- * @param {string[]} [options.deny] - Path prefixes hard-denied. `~` expands.
- * @param {string[]} [options.toolNames] - Only check these tool names. If omitted, checks any tool with an `args.path` string.
- * @param {string} [options.argKey='path'] - Name of the args field to inspect.
- * @returns {Function} policy predicate `(toolName, args) => true | string`
- */
-function pathAllowlist({ allow = [], deny = [], toolNames, argKey = 'path' } = {}) {
-  const allowNorm = allow.map(normalize);
-  const denyNorm = deny.map(normalize);
-  const gatedTools = toolNames ? new Set(toolNames) : null;
-
-  return async function pathPolicy(toolName, args) {
-    if (gatedTools && !gatedTools.has(toolName)) return true;
-    const raw = args?.[argKey];
-    if (typeof raw !== 'string') return true; // nothing to check
-    const target = normalize(raw);
-
-    for (const d of denyNorm) {
-      if (target === d || target.startsWith(d + path.sep) || target.startsWith(d + '/')) {
-        return `Path denied: ${raw} is under a denied root (${d}).`;
-      }
-    }
-    if (allowNorm.length === 0) return true;
-    for (const a of allowNorm) {
-      if (target === a || target.startsWith(a + path.sep) || target.startsWith(a + '/')) {
-        return true;
-      }
-    }
-    return `Path denied: ${raw} is not under any allowed root.`;
-  };
-}
-
-/**
- * Allow/deny commands by their base name.
- *
- * For `shell_run` (argv-array): inspects `args.argv[0]`. Safe — no shell in path.
- * For `shell_exec` (raw shell): inspects `args.command.split(/\s+/)[0]` BUT this
- * is defeatable by shell metacharacters. Prefer gating `shell_run` with this helper
- * and denying `shell_exec` entirely, or handling shell_exec with a custom policy
- * that parses the command string carefully.
- *
- * Deny wins over allow.
- *
- * @param {object} options
- * @param {string[]} [options.allow] - Base command names allowed.
- * @param {string[]} [options.deny] - Base command names denied.
- * @param {string} [options.toolName='shell_run'] - Which tool this helper gates.
- * @returns {Function} policy predicate `(toolName, args) => true | string`
- */
-function commandAllowlist({ allow = [], deny = [], toolName = 'shell_run' } = {}) {
-  const allowSet = new Set(allow);
-  const denySet = new Set(deny);
-
-  return async function commandPolicy(name, args) {
-    if (name !== toolName) return true;
-    let base;
-    if (name === 'shell_run') {
-      if (!Array.isArray(args?.argv) || typeof args.argv[0] !== 'string') return true;
-      base = args.argv[0];
-    } else {
-      if (typeof args?.command !== 'string') return true;
-      base = args.command.trim().split(/\s+/)[0];
-    }
-    if (denySet.has(base)) return `Command denied: ${base} is on the denylist.`;
-    if (allowSet.size > 0 && !allowSet.has(base)) {
-      return `Command denied: ${base} is not on the allowlist.`;
-    }
-    return true;
-  };
-}
-
-/**
- * Compose multiple policy predicates into one. First non-true verdict wins.
- * Short-circuits on first deny — later predicates are not called.
- *
- * @param {...Function} policies - Any number of policy predicates.
- * @returns {Function} combined policy predicate `(toolName, args, ctx) => true | string`
- */
-function combinePolicies(...policies) {
-  const list = policies.filter(p => typeof p === 'function');
-  return async function combined(toolName, args, ctx) {
-    for (const p of list) {
-      const verdict = await p(toolName, args, ctx);
-      if (verdict !== true) return verdict;
-    }
-    return true;
-  };
-}
-
-module.exports = { pathAllowlist, commandAllowlist, combinePolicies };