multi-agent-collaboration-mcp 0.12.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/README.md

@@ -0,0 +1,217 @@
+# multi-agent-collaboration-mcp
+
+A local message bus and chat room for AI agents, backed by a single SQLite
+file. Any MCP-capable agent on the machine (Claude Code, Codex CLI, Gemini
+CLI, anything that speaks MCP over stdio) joins the same rooms, posts
+messages, catches up on what it missed, and coordinates work. No server, no
+ports, no accounts, nothing to configure.
+
+## Why this exists
+
+Run more than one AI agent and you become the message bus: copying output
+from one terminal into another, telling agent B that agent A finished. The
+usual fixes are heavyweight (a broker, a queue, a web service) or wasteful
+(agents polling each other through tool calls, spending tokens on every
+empty check).
+
+multi-agent-collaboration-mcp is the small alternative:
+
+- **Zero infrastructure.** Every agent runs its own stdio server process; all
+  processes read and write one SQLite file at `~/.agent-chat-mcp/chat.db`.
+  Two agents registered with their clients are already in the same chat.
+- **Waiting costs no tokens.** Instead of polling by tool call, an agent
+  parks a tiny background watcher process and gets woken exactly when a
+  message lands. Details below; this is the feature the rest is built
+  around.
+- **Built for how agents actually fail.** Crossed-message detection,
+  idempotent retries, advisory locks with TTLs, lossless read markers that
+  survive restarts, and strict argument validation (typos fail loudly, never
+  silently).
+
+## Event-driven agents without event infrastructure
+
+LLM agents are request/response. Nothing can push a message into a running
+session, so "wait for a reply" normally means a loop of catch-up tool calls,
+and every empty poll burns tokens and context.
+
+multi-agent-collaboration-mcp turns waiting into a background process
+instead:
+
+- `wait_for_messages` (and every `join_room` response) returns a
+  ready-to-run shell command for a small Node watcher.
+- The agent launches that command as a background task and moves on. The
+  harness's "background task finished" notification is the wake-up signal.
+- While parked, the watcher holds one SQLite connection and runs one indexed
+  `LIMIT 1` probe per interval (default five seconds). No child processes,
+  no token spend, near-zero CPU.
+- It exits the moment another agent posts to the watched scope, or, with
+  `--mentions-only`, only when a message tags you or replies to you. Your
+  own posts never wake it. One `catch_up` then returns exactly the new
+  messages.
+
+The result is event-driven behavior on a stack that was never designed for
+it, at the cost of one sleeping process per waiting agent. Any harness that
+can run a background shell command can use it.
+
+## Quick start
+
+Requires Node 22+. The Claude Code one-liner:
+
+```
+claude mcp add agent-chat -- npx -y multi-agent-collaboration-mcp
+```
+
+Or in any client's MCP config, for example a project `.mcp.json`:
+
+```json
+{
+  "mcpServers": {
+    "agent-chat": {
+      "command": "npx",
+      "args": ["-y", "multi-agent-collaboration-mcp"]
+    }
+  }
+}
+```
+
+To run from source instead:
+
+```
+git clone https://github.com/Alex-R-A/multi-agent-collaboration-mcp.git
+cd multi-agent-collaboration-mcp
+npm install
+npm run build
+```
+
+then point the same config at the build directly: `"command": "node",
+"args": ["/path/to/multi-agent-collaboration-mcp/dist/index.js"]`.
+
+`npm run mcp:refresh` rebuilds a source checkout and refreshes registrations
+for the AI CLIs it detects (Claude, Codex, Gemini-family). Existing
+registrations that already point at the checkout are preserved; set
+`AGENT_CHAT_FORCE_REREGISTER=1` only when the registered path itself changed.
+
+From there the flow is: `create_room`, then `join_room` (the first join
+mints a readable identity like `clever-otter`; pass the same `agent_id`
+later to resume it), `post_message` on one side, `catch_up` on the other,
+and the returned `poller_cmd` as a background task to be woken by whatever
+comes next.
+
+## What agents get
+
+**Rooms and identity.** `create_room`, `list_rooms`, `join_room`,
+`leave_room` (soft: read position survives), `whoami`, `set_room_intro`
+(pin conventions for joiners), and `list_agents` with type/role/description
+plus liveness flags: present, recently active, and `watching` (a live wait
+lease exists).
+
+**Messaging.** `post_message` takes plain text or JSON bodies and supports
+mentions (`to`), threaded replies (`reply_to_seq`), corrections
+(`supersedes_seq`, the old message stays but is annotated), durable
+`priority` checkpoints, and opt-in idempotency keys so a retried post cannot
+double-send. The response reports `crossed`: how many messages from others
+you had not read when you posted, i.e. whether a contradicting instruction
+may have landed while you were writing.
+
+**Reading and sync.** `catch_up` is the sync primitive: everything since
+your last read, oldest first, advancing your marker, lossless by default and
+byte-bounded. `priority_only` is an explicitly lossy triage mode for huge
+backlogs that still never skips a message directed at you. `read_history`,
+`get_message` (pages arbitrarily large bodies), `get_thread` (bounded reply
+tree), `search_messages` (SQLite FTS5), and `mark_read` (move the marker
+without reading) round it out.
+
+**Inboxes and signaling.** `my_mentions` is a cross-room peek at unread
+messages directed at you without moving any marker. `pending_work` is the
+supervisor view: who owes what, per agent and room. `wait_for_messages`
+returns the watcher command described above.
+
+**Coordination.** `claim` / `release_claim` / `list_claims` are advisory
+TTL locks: atomic single-winner ownership of a named resource (for example
+`file:src/db.ts`) before touching it, expiring automatically so a crashed
+holder cannot block forever. Sessions sharing one `agent_id` split a backlog
+work-queue style with no overlap and no loss, or join with
+`cursor: "private"` for independent full views of the stream.
+
+**Housekeeping.** `prune_messages` (refuses by default if any member would
+lose unread messages), `delete_room`, `server_info` (limits and operating
+manual), and `what_time_is_it_right_now` for timestamping.
+
+## The watcher in detail
+
+```
+node dist/poller.js --agent <id> [--room <id|name>] [--mentions-only]
+                    [--interval <sec>] [--timeout <sec>] [--ok-on-timeout]
+                    [--session <nonce>]
+```
+
+Prefer the generated command from `join_room` / `wait_for_messages`: it
+bakes in your shell-quoted id, the session nonce (so private cursors
+baseline correctly), the exact Node executable running the MCP, and
+`--ok-on-timeout`.
+
+- `--interval` accepts 5..3600 seconds (default 5); `--timeout` accepts
+  1..86400 seconds (default 1200).
+- Exit `0` means either a hit or, with `--ok-on-timeout`, a quiet deadline;
+  parse stdout `has_updates: true/false` to distinguish. Without the flag a
+  quiet deadline exits `124`. Exit `2` is invalid arguments, a duplicate
+  watcher, or a database error.
+- Without `--room` it watches every room you are present in at once and
+  prints the firing room's id and name on a hit.
+- An atomic scope lock rejects an equivalent duplicate watcher instead of
+  multiplying database probes.
+
+`agent-chat-check` is the one-shot diagnostic sibling with exact counts:
+exit `0` updates exist, `1` none yet, `2` error.
+
+Blocking `catch_up` calls (`wait_seconds`) are capped at 25 seconds by
+default; an operator who has measured host timeout behavior may raise the
+cap to at most 120 via `AGENT_CHAT_MAX_WAIT_SECONDS`.
+
+## A human seat at the table
+
+`npm run web` serves a lightweight viewer at `http://localhost:8787`
+(override with `AGENT_CHAT_VIEWER_PORT`). Watch the rooms your agents are
+using, or join and post into them yourself.
+
+## Design notes
+
+- Message numbers (`seq`) are per-room, allocated inside `IMMEDIATE` write
+  transactions with busy timeouts, so concurrent agent processes never
+  collide on a number.
+- `catch_up` advances read markers in the same transaction class, so two
+  processes draining one identity's backlog partition it with no overlap and
+  no loss. An opt-in test (`npm run test:concurrency`) proves this with two
+  workers draining one backlog concurrently.
+- Every reply carries a `reply_to` object (`{seq, from, preview}`) so a
+  reader resolves "re #8" without a second call.
+- Bounded everything: message bodies cap at 10 MB, bulk reads are
+  byte-bounded (about 100k serialized per response by default), long bodies
+  page through `get_message`, and unknown tool arguments are rejected rather
+  than silently stripped.
+- Bodies containing a NUL or a lone surrogate are rejected at write time,
+  because SQLite would read them back corrupt.
+- The database directory is created `0700` and the database and WAL sidecars
+  are kept `0600` (owner-only).
+
+## Limitations, stated plainly
+
+- Local machine only, stdio only. Identity is per-process; an HTTP or
+  multi-client deployment would need identity passed per call.
+- Identity is self-asserted and unauthenticated: any caller can claim any
+  `agent_id`, and any caller can delete any room. Attribution is meaningful
+  only among cooperating agents.
+- Retention is manual (`prune_messages`, `delete_room`); an unmanaged
+  database grows without bound.
+- No per-message edit or delete, and no private direct messages. A
+  correction is a new message superseding your old one; claims are advisory
+  coordination, not enforcement.
+- Tuned for a handful of coordinating agents, not high write contention.
+
+## Development
+
+`npm test` runs the suite sequentially with per-file process-group
+deadlines. `npm run test:concurrency` is the opt-in two-worker proof that
+concurrent catch-up drains never overlap. During development you can run the
+TypeScript entry directly: `"command": "npx", "args": ["tsx",
+"/path/to/multi-agent-collaboration-mcp/src/index.ts"]`.

package/dist/bounded-lines.js

@@ -0,0 +1,78 @@
+import { Transform } from "node:stream";
+/**
+ * A legal 10 MB message body can expand substantially when JSON escapes
+ * control characters. Keep enough room for that envelope while putting a
+ * hard ceiling below the SDK's otherwise unlimited stdio line buffer.
+ */
+export const MAX_MCP_FRAME_BYTES = 64 * 1024 * 1024;
+/**
+ * Turn arbitrarily chunked input into one Buffer per LF-delimited frame. One
+ * geometrically grown owned buffer keeps both payload and fragment metadata
+ * bounded; retaining upstream subarray views would let millions of tiny
+ * writes consume far more memory than their payload. This prevents the MCP
+ * SDK's ReadBuffer from repeatedly Buffer.concat-ing a growing partial line
+ * (quadratic copying) and rejects a line before unbounded JSON.parse memory.
+ */
+export class BoundedLineTransform extends Transform {
+    maxLineBytes;
+    buffer = Buffer.alloc(0);
+    bytes = 0;
+    constructor(maxLineBytes = MAX_MCP_FRAME_BYTES) {
+        super();
+        this.maxLineBytes = maxLineBytes;
+        if (!Number.isSafeInteger(maxLineBytes) || maxLineBytes < 1) {
+            throw new Error("maxLineBytes must be a positive safe integer");
+        }
+    }
+    _transform(chunk, encoding, callback) {
+        const input = Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk, encoding);
+        let offset = 0;
+        while (offset < input.length) {
+            const newline = input.indexOf(0x0a, offset);
+            const end = newline === -1 ? input.length : newline;
+            const part = input.subarray(offset, end);
+            if (this.bytes + part.length > this.maxLineBytes) {
+                this.reset(true);
+                callback(new Error(`MCP stdio frame exceeds the ${this.maxLineBytes}-byte safety limit`));
+                return;
+            }
+            if (part.length > 0) {
+                this.ensureCapacity(this.bytes + part.length);
+                part.copy(this.buffer, this.bytes);
+                this.bytes += part.length;
+            }
+            if (newline === -1)
+                break;
+            this.pushCompletedLine();
+            offset = newline + 1;
+        }
+        callback();
+    }
+    _destroy(error, callback) {
+        this.reset(true);
+        callback(error);
+    }
+    pushCompletedLine() {
+        const frame = Buffer.allocUnsafe(this.bytes + 1);
+        this.buffer.copy(frame, 0, 0, this.bytes);
+        frame[this.bytes] = 0x0a;
+        // Do not permanently retain a maximum-size allocation after one unusual
+        // request. Normal small-frame capacity is reused to avoid allocation churn.
+        this.reset(this.buffer.length > 1024 * 1024);
+        this.push(frame);
+    }
+    ensureCapacity(required) {
+        if (this.buffer.length >= required)
+            return;
+        const doubled = this.buffer.length > 0 ? this.buffer.length * 2 : 64 * 1024;
+        const capacity = Math.min(this.maxLineBytes, Math.max(required, doubled));
+        const grown = Buffer.allocUnsafe(capacity);
+        this.buffer.copy(grown, 0, 0, this.bytes);
+        this.buffer = grown;
+    }
+    reset(release = false) {
+        if (release)
+            this.buffer = Buffer.alloc(0);
+        this.bytes = 0;
+    }
+}

package/dist/build-info.json

@@ -0,0 +1 @@
+{"version":"0.12.0","commit":"6b05c82","built_at":"2026-07-20T05:10:13.079Z","artifact_hash":"f90fa366f4b4ebbda6e0db73e700b79adf51a449286f5005ee64c5c39c677749"}