原型 · 预览版:收录官方注册中心里的全部服务器,每 30 分钟同步一次。评价和账户功能将在后续阶段推出。
PopNx MCP为使用 AI 的人准备的 MCP 服务器 · 用大白话讲清楚

Brainbox

作者:thebasedcapital版本 0.1.6i★ –i在你的电脑上运行
注册名称io.github.thebasedcapital/brainbox

安装

概览

作者提供的说明(英文原文)

Hebbian memory for AI agents. Learns file patterns, predicts next tools, saves tokens.

PopNx MCP 的三大支柱

这三项永远不会合并成一个分数:意见、测量和人气是不同的东西。

它能帮你做什么

我们还没有为它写通俗的介绍。下面是我们从注册中心读取到的事实。

  • 连接方式: 在你的电脑上运行
  • 传输方式: stdio
  • 分类: 搜索与 AI 记忆

安装

选择你使用的 AI 应用,然后复制设置。

安装之前

  • 基础检查:1 项中通过 1 项
  • 在你的电脑上运行,拥有你的用户账户的权限(文件、网络、应用)。
  • 注册中心没有列出需要填写的密钥。

你需要

  • npm已安装 Node.js(用于 npx 命令)

你用的是哪个应用?

在上方选择你的应用。我们会记住它,下次按钮会显示“安装到 …”。

打开 Claude Desktop → Settings → Developer → Edit Config,把下面的内容粘贴到 claude_desktop_config.json

{
  "mcpServers": {
    "brainbox": {
      "command": "npx",
      "args": [
        "-y",
        "brainbox-hebbian"
      ]
    }
  }
}

在终端中运行这条命令

claude mcp add brainbox -- npx -y brainbox-hebbian

在 Cursor 中打开

或者自己复制设置

粘贴到项目中的 .cursor/mcp.json,或 ~/.cursor/mcp.json

{
  "mcpServers": {
    "brainbox": {
      "command": "npx",
      "args": [
        "-y",
        "brainbox-hebbian"
      ]
    }
  }
}

浏览器会先询问是否打开应用,然后应用会显示设置并请你确认。密钥的值会留空,由你自己填写。

在 VS Code 中打开

或者自己复制设置

粘贴到项目中的 .vscode/mcp.json

{
  "servers": {
    "brainbox": {
      "type": "stdio",
      "command": "npx",
      "args": [
        "-y",
        "brainbox-hebbian"
      ]
    }
  }
}

浏览器会先询问是否打开应用,然后应用会显示设置并请你确认。密钥的值会留空,由你自己填写。

这个服务器在你的电脑上运行,而 ChatGPT 只能连接互联网上的服务器。请选择其他应用。

你的选择通过 Cookie 保存在这台设备上,无需账户。

这些设置是根据作者在注册中心的条目生成的。如果 README 的写法不同,请以 README 为准。

它能做什么

它在你的电脑上运行;安装后,工具列表会显示在你的 AI 应用中。

基础检查i

我们检查的是任何人都能看到的信息;我们没有阅读代码。不适用的检查项不计入总数。 · 检查于 2026年11月6日

  • ✓ 通过

    作者与仓库一致

    注册名称已通过 GitHub 账户 thebasedcapital 验证,该账户拥有此仓库

  • … 尚未检查

    仍在维护

    我们还没有从 GitHub 读取这个仓库

  • … 尚未检查

    有许可证

    我们还没有从 GitHub 读取这个仓库

  • – 不适用

    端点有响应

    它在你的电脑上运行,没有互联网端点

  • – 不适用

    使用 OAuth 登录

    在你的电脑上运行,改用本地设置

  • … 尚未检查

    工具描述中没有隐藏指令

    它在你的电脑上运行;我们只能读取互联网端点的工具列表

与“搜索与 AI 记忆”中的其他服务器比较i

  • 星标数多于此分类中其他 7243 个服务器的 0%
  • 发布到注册中心的时间比此分类中其他 7243 个服务器的 3% 更新
  • 基础检查结果等于或优于此分类中其他 7243 个服务器的 100%

与注册中心里这个分类中所有活跃的服务器比较。只有当发布者拥有该仓库时,星标数才计入。

常见问题

Brainbox 安全吗?

它在 1 项适用的基础检查中通过了 1 项。我们没有阅读代码。在添加密钥或令牌之前,请先看看这个服务器要求哪些权限,并使用只具备所需权限的密钥。

它需要哪些密钥或代码?

注册中心没有列出必需的密钥,不过有些服务器会在首次使用时要求你登录。

它在我的电脑上运行还是在云端?

它在你的电脑上运行。你的 AI 应用会在需要时启动它,数据不会经过作者的服务器(除非它自己调用在线服务)。

它还在维护吗?

GitHub 仓库最后更新于–,最新版本(0.1.6)于9个月前进入注册中心。

哪些应用可以使用它?

支持 MCP 的应用,例如 Claude Desktop、Claude Code、Cursor 和 VS Code。你的电脑上还需要有 Node.js。

有什么可以替代它?

同一分类中有:Context7, Codebase Memory, Exa

替代选择

同一分类中其他作者的服务器,按星标数排序。

如何看卡片:★ GitHub 星标i三大支柱:评价 · 检查 · 使用情况i更新 = 最新版本发布到注册中心的时间i

Context7

作者:upstash

Up-to-date docs for AI agents

电脑或云端★ 64,224MIT3天前更新
安装

Codebase Memory

作者:DeusData

Codebase knowledge graph for AI agents — 162 languages, sub-ms queries, 99% fewer tokens.

在你的电脑上运行★ 48,148MIT20天前更新
安装

Exa

作者:exa-labs

Connect AI agents to Exa for web search, content fetching, and multi-step research.

在云端运行★ 5,213MIT44天前更新
安装

作者的 README

打开 README

按原文从作者的仓库复制。PopNx MCP 没有审查或背书其内容。HTML、图片和脚本已被移除。链接会离开本站。

Install · How it works · Results · Research · Integrations · Whitepaper

BrainBox is procedural memory for AI coding agents. It watches what the agent actually does and remembers it:

  • which files get read and edited together
  • which errors were fixed by which edits
  • which tool chains the agent repeats

On the next task it puts the right files in front of the agent *before* it starts searching.

Not a vector database. Not RAG. Hebbian learning on a local SQLite graph. Zero API cost, no GPU, nothing leaves your machine.

Session 1   agent greps for auth.ts, reads it, edits it            ~2,000 tokens of searching

Session 5 BrainBox recalls auth.ts + session.ts up front search skipped Session 20 auth.ts → session.ts → token.ts is a superhighway instant recall

Paper

BrainBox: Local Behavioral Memory for Coding Agents (Bhavesh B, 2026). The DOI above covers all versions and resolves to the latest. Latest version: v0.2, doi:10.5281/zenodo.23250505.

@misc{b2026brainbox,

author = {B, Bhavesh}, title = {BrainBox: Local Behavioral Memory for Coding Agents}, year = {2026}, publisher = {Zenodo}, version = {v0.2}, doi = {10.5281/zenodo.23250505}, url = {https://doi.org/10.5281/zenodo.23250505} }

Install

npm install brainbox-hebbian

That's it. The postinstall script:

  1. Adds a PostToolUse hook to ~/.claude/settings.json. It learns from every file read, edit, search and command.
  2. Adds a UserPromptSubmit hook. It injects compact recall into prompts, or stays silent once it has learned you ignore it.
  3. Adds a SessionEnd hook. It scores which recalled files you actually opened or edited and compiles procedures.
  4. Registers the MCP server via claude mcp add, with 8 tools: record, recall, explain, error, resolve, predict_next, stats, decay.
  5. Creates ~/.brainbox/ and starts a background download of the embedding model.

Hooks never download models. Until the model is cached (brainbox models pull), recall runs lexical-only. Embeddings come from the optional @huggingface/transformers dependency; if its native modules can't install on your machine (for example, sharp with a system libvips and no build tools), BrainBox still installs and runs with keyword search. brainbox models status shows which mode you are in.

Kill the cold start by seeding from git history and the code graph:

brainbox bootstrap --repo /path/to/project --imports

Uninstall: brainbox uninstall removes the hooks and the MCP server and keeps your database.

How it works

Every tool call is a neuron firing. Files, tools and errors become neurons, and things accessed close together become synapses. A prompt triggers recall, which fuses several ranking channels. A learned policy decides whether injecting is worth the tokens. Feedback on what you actually opened or edited flows back into the graph.

Fire together, wire together

Access auth.ts then session.ts across sessions and their synapse strengthens. SNAP plasticity makes strong synapses grow more slowly, so no single connection takes over. Links are directional (STDP): what you open *next* matters more than what came before.

Spreading activation

Recalling one file activates its neighbours for up to 3 hops. Each hop is damped by 1/√degree, so hub files don't flood the results. Each result carries the channel and the edge that produced it. brainbox_explain shows you exactly why a file was recalled.

Superhighways and decay

Paths you use often are myelinated into instant-recall superhighways. Recency and frequency follow the ACT-R base-level equation, B = ln Σ tⱼ^-0.5, and unused connections fade. Files recalled but ignored weaken only the edge that surfaced them.

Error → fix immune system

When a failed command is followed by edits and a passing rerun, BrainBox stores an error→fix procedure. The procedure is keyed by the error's fingerprint and tracks helpful/harmful outcomes. The next time that error appears, the fix files are recalled at once. Procedures are shown to the agent as quoted observations, never as instructions.

Results

brainbox eval replays real coding-agent trajectories in time order. Each task is scored on a fresh in-memory DB trained only on earlier tasks from the same repo, and every system ranks the same candidate set.

v0.1 lost to plain recency on next-file prediction. On the held-out SWE tasks the gap was −.207, 95% CI −.312…−.118. v0.2 is statistically tied with recency there. Next-tool prediction now beats every baseline significantly, and files-read recall leads on both data sources.

Known gap: on local sessions, ranking by edit frequency alone still beats BrainBox for *edited* files (Δ −.089, CI −.185…0).

Fitting the lexical and Hebbian channel weights to zero scored higher on dev, but recall then ignored the query, so the shipped weights keep them.

Full table, protocol and commands

Probes:

  • P1: files edited or read for the task (query = task text)
  • P2: next file, step by step
  • P3: next tool (top 3)

Baselines: recency, frequency, BM25, EdgeBank and random. Confidence intervals are paired bootstrap 95% CIs, resampled by trajectory.

Datasets:

  • Ranking weights were fit only on the dev repos (sqlglot, dvc, streamlink).
  • SWE test is 40 held-out tasks from Pillow and conan.
  • Local is 97 agent sessions across 5 projects, never used for fitting.

Scores are MRR (P3: MRR@3), with embeddings off.

ProbeSWE test: v0.1v0.2best baselinelocal: v0.1v0.2best baseline
P1 edited files.307.307.216 BM25.737.703.791 frequency
P1 read files.191.267.206 BM25.372.555.547 BM25
P2 next file.223.409.430 recency (Δ CI −.049…+.003).634.702.701 recency (tie)
P3 next tool.479.767.748 frequency (Δ +.019, CI +.012…+.027).257.686.662 recency (Δ CI +.010…+.036)
npm run eval -- --source nebius --repos 5 --max-tasks-per-repo 20 --split test --embeddings off --engine new

npm run eval -- --source omp --repos 5 --max-tasks-per-repo 20 --embeddings off --engine old # v0.1 engine (needs a worktree, see src/eval)

Code search: on a 30-query code-search set, the default jina-embeddings-v2-base-code reaches Recall@5 0.867, against 0.667 for the previous MiniLM.

Built on research

Each v0.2 change maps to a recent paper and was measured with the replay eval:

SubsystemWhat changedSource
RankingACT-R base-level activation replaces fixed decay. Recurrence and popularity candidates are added. Weighted reciprocal-rank fusion with weights fit on held-out dev repos. Directional STDP; n-gram tool prediction.ACT-R 2505.05083 · Base3 2506.12764 · 2502.04910
Code searchcAST-style AST chunks. FTS5 BM25 + sqlite-vec KNN, fused with RRF (k=60). Incremental by content hash.cAST 2506.15655
Injection policyA contextual UCB1 bandit picks SILENT / TOP1 / TOP3 / TOP5. Reward = files you open or edit, minus token cost.MemCon 2607.13591
AttributionEvery recall is logged with the synapse that produced it; ignored recalls weaken only that edge.MemTrace 2605.28732
Compact injectionInjects a compact path:start-end — why list; deleted files are never injected.FastContext 2606.14066
ProceduresDeterministic mining of failed command → edits → passing rerun, plus multi-session workflows, with helpful/harmful counters.ACE 2510.04618 · Mem^p 2508.06433
Code graphTree-sitter import / call / inheritance edges (TS/JS, Python, Rust, Swift, Go), seeded as weak priors (≤ 0.35) that learned co-access outranks.—
EvaluationOffline replay of SWE-rebench OpenHands trajectories and local sessions, with baselines and paired CIs.SWE-rebench trajectories

Also in 0.2:

  • Builds on Node 22–26 (better-sqlite3 v13).
  • Hooks are written in Claude Code's nested settings format.
  • The hook DB lock wait is capped at 100 ms.
  • Procedure compilation is 470× faster

只显示了开头部分;其余内容请在仓库中阅读

问 PopNx