K
keplertech/naja-scope
Trace connectivity and hierarchy in SystemVerilog and VHDL
在 GitHub 查看 ↗链接已于 2026-11-12 核查 · HTTP 200 · 打开的是厂商自己的官网
安装与配置
- 复制上面的命令
- 粘成
claude_desktop_config.json里mcpServers的一项(本地服务器用 command + args,示例见 客户端接法) - 重启客户端
取自该仓库的安装命令
claude mcp add naja-scope -- uvx naja-scope
解析自我们于 2026-11-05 抓取的该仓库 README;我们未执行过。
这条是仓库自己写的安装方式,不是 MCP 客户端配置,所以不生成 JSON。
配置项的键名以你的客户端为准:客户端与 CLI
- 来源明细
- 收录自 abordage/awesome-mcp 榜单(我们从中收集的条目之一) · 条目类型:MCP 服务
- 收录与活跃
- 收录于 2026-11-05 · 最近见到 2026-11-14 · 共见到 10 次 · 被 10 个来源列出
- 评分构成
- 综合分 1,003 · 10 个来源 · mcp
- 安装
claude mcp add naja-scope -- uvx naja-scope
常见问题(答案都来自我们的记录)
怎么安装?
该仓库给出的安装命令是
claude mcp add naja-scope -- uvx naja-scope。我们的记录里它是仓库自己提供的;不保证在你的客户端上直接可用。它适合谁 / 用来做什么?
我们把它归在这些标签下: MCP 服务。标签来自条目自身,不是我们强加的分类。
谁维护它、还在更新吗?
我们收录于 2026-11-05;最近见到 2026-11-14。这里没有"官方认证"或"质量评级"——我们只记录来源与时间。
# naja-scope
以下摘录自该仓库的 README(片段) · 在 GitHub 读完整 README →
Let your AI assistant explore SystemVerilog and VHDL designs — without pasting source code into the chat.
naja-scope is an MCP server that gives AI
agents (Claude, and any MCP-compatible assistant) a precise, structured view of
your elaborated SystemVerilog or VHDL design. Instead of dumping thousands of lines of
RTL into the model's context, the agent asks targeted questions — what drives
this signal? what's inside this module? where does this net come from? — and
gets back small, exact answers with file-and-line references.
Built on the najaeda netlist engine.
> On a 17-question CVA6 benchmark,
> the same Claude Code agent scored 17/17 with naja-scope versus 10/17 with
> grep/read source tools — in 77 turns instead of 123, processing about 5×
> less input. How it was measured ↓
sh
pip install naja-scope
claude mcp add naja-scope -- naja-scope-mcp
## Why
Large designs don't fit in a chat window. Pasting RTL is slow, expensive, and
the model still can't reliably trace connectivity across hierarchy. naja-scope
turns your design into something an agent can navigate:
🔎 Trace connectivity — find what drives or loads any signal, across
module boundaries.
🌲 Walk the hierarchy — explore modules, instances, and ports on demand.
🎯 Jump to source — every answer comes with file:line ranges, so the
agent can quote the exact RTL that matters.
🧩 Logic cones — trace fan-in / fan-out combinational cones up to the
register boundary.
💡 Recover design intent — enum state names, struct/union fields, and
parameter formulas that normally vanish when a design is elaborated.
Requires najaeda 0.7.33 or newer, including the CVA6 RV32 elaboration
fix. See the
0.1.21 release notes
for test results and snapshot migration requirements.
Works on RTL and gate-level netlists alike: load elaborated SystemVerilog
or VHDL (beta), or load a post-synthesis structural Verilog netlist together with its Liberty
standard-cell library and navigate the gates the same way (see
Gate-level designs).
All responses are token-bounded: lists paginate, large results truncate with
clear markers. Your context stays small; your answers stay accurate.
## Does it actually help?
naja-scope helps most when the answer exists in the elaborated design rather
than in any single source file. In an initial 17-question run on the
cv32a6imacsv32 configuration of
CVA6, the same Claude Code agent was
tested with naja-scope and with source-search tools alone.
| Agent setup | Provider and models | Initial automated score | Turns | Input processed | Output tokens |
| Agent + naja-scope | Anthropic Claude Code; claude-sonnet-4-6 with claude-haiku-4-5-20251001 helper | 17 / 17 | 77 | 1,058,556 | 19,520 |
| Agent + grep/read source | Anthropic Claude Code; claude-sonnet-4-6 with claude-haiku-4-5-20251001 helper | 10 / 17 | 123 | 5,461,719 | 55,962 |
The difference is clearest on structural questions that source search cannot
answer directly:
| CVA6 question | Agent + naja-scope | Agent + grep/read source |
| Flattened register groups under exstagei | 92, in 4 turns | No answer at the turn limit |
| Flattened register groups under commitstagei | 0, in 3 turns | No answer at the turn limit |
naja-scope is an MCP server that gives AI
agents (Claude, and any MCP-compatible assistant) a precise, structured view of
your elaborated SystemVerilog or VHDL design. Instead of dumping thousands of lines of
RTL into the model's context, the agent asks targeted questions — what drives
this signal? what's inside this module? where does this net come from? — and
gets back small, exact answers with file-and-line references.
Built on the najaeda netlist engine.
> On a 17-question CVA6 benchmark,
> the same Claude Code agent scored 17/17 with naja-scope versus 10/17 with
> grep/read source tools — in 77 turns instead of 123, processing about 5×
> less input. How it was measured ↓
sh
pip install naja-scope
claude mcp add naja-scope -- naja-scope-mcp
## Why
Large designs don't fit in a chat window. Pasting RTL is slow, expensive, and
the model still can't reliably trace connectivity across hierarchy. naja-scope
turns your design into something an agent can navigate:
🔎 Trace connectivity — find what drives or loads any signal, across
module boundaries.
🌲 Walk the hierarchy — explore modules, instances, and ports on demand.
🎯 Jump to source — every answer comes with file:line ranges, so the
agent can quote the exact RTL that matters.
🧩 Logic cones — trace fan-in / fan-out combinational cones up to the
register boundary.
💡 Recover design intent — enum state names, struct/union fields, and
parameter formulas that normally vanish when a design is elaborated.
Requires najaeda 0.7.33 or newer, including the CVA6 RV32 elaboration
fix. See the
0.1.21 release notes
for test results and snapshot migration requirements.
Works on RTL and gate-level netlists alike: load elaborated SystemVerilog
or VHDL (beta), or load a post-synthesis structural Verilog netlist together with its Liberty
standard-cell library and navigate the gates the same way (see
Gate-level designs).
All responses are token-bounded: lists paginate, large results truncate with
clear markers. Your context stays small; your answers stay accurate.
## Does it actually help?
naja-scope helps most when the answer exists in the elaborated design rather
than in any single source file. In an initial 17-question run on the
cv32a6imacsv32 configuration of
CVA6, the same Claude Code agent was
tested with naja-scope and with source-search tools alone.
| Agent setup | Provider and models | Initial automated score | Turns | Input processed | Output tokens |
| Agent + naja-scope | Anthropic Claude Code; claude-sonnet-4-6 with claude-haiku-4-5-20251001 helper | 17 / 17 | 77 | 1,058,556 | 19,520 |
| Agent + grep/read source | Anthropic Claude Code; claude-sonnet-4-6 with claude-haiku-4-5-20251001 helper | 10 / 17 | 123 | 5,461,719 | 55,962 |
The difference is clearest on structural questions that source search cannot
answer directly:
| CVA6 question | Agent + naja-scope | Agent + grep/read source |
| Flattened register groups under exstagei | 92, in 4 turns | No answer at the turn limit |
| Flattened register groups under commitstagei | 0, in 3 turns | No answer at the turn limit |
收录徽章(可选)
想把收录标记放进 README 就复制这行,可选,不影响收录。
[](https://anclum.com/zh/s/keplertech-naja-scope/)
- 来源
- awesome · https://github.com/keplertech/naja-scope
- 按领域浏览
- MCP 服务
- 收录来源
- 10 个独立来源
- 收录于
- 今天
同类推荐
所属领域与标签
每个标签都能点进去看同类的全部条目。数字是当前库里的真实条数。