技能潮 SkillTide 提交收录
官方说明7 个来源MCP 服务8 天前
najaeda/naja-scope

najaeda/naja-scope

name: io.github.keplertech/naja-scope Let your AI assistant explore SystemVerilog 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 design.
在 GitHub 查看 ↗直链 · 无中转页
配置模板(请按你的客户端调整)
claude mcp add naja-scope -- npx -y naja-scope
这是根据仓库名生成的可粘贴骨架,命令行参数与包名请以该项目 README 为准。
★ 数取值
17 ★ · najaeda/naja-scope · 取自该仓库的 GitHub 页面 · (2026-10-16 20:00:20 核对)
来源明细
收录自 punkpeye/awesome-mcp-servers 榜单(我们从中收集的条目之一) · 条目类型:MCP 服务
收录与活跃
收录于 2026-10-09 · 最近见到 2026-10-16 · 共见到 32 次 · 被 7 个来源列出
评分构成
综合分 703 · 17 ★ · 7 个来源 · mcp
常见问题(答案都来自我们的记录)
怎么安装?
我们【没有】从该仓库取到安装命令(我们的 install 覆盖率只有约 4%)。请看它的 README 或 releases 页。
它适合谁 / 用来做什么?
我们把它归在这些标签下: MCP 服务。标签来自条目自身,不是我们强加的分类。
谁维护它、还在更新吗?
仓库 najaeda/naja-scope;我们收录于 2026-10-09;最近见到 2026-10-16。这里没有"官方认证"或"质量评级"——我们只记录来源与时间。
第三方质量标记

naja-scope

以下摘录自该仓库的 README(片段) · 在 GitHub 读完整 README →

**Let your AI assistant explore SystemVerilog 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 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 ↓
---
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.
Works on **RTL and gate-level netlists** alike: load elaborated SystemVerilog,
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). VHDL loading is in
beta.
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
cv32a6_imac_sv32 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 ex_stage_i | **92**, in 4 turns | No answer at the turn limit |
| Flattened register groups under commit_stage_i | **0**, in 3 turns | No answer at the turn limit |
| Elaborated hpdcache_mux variants | **20**, in 3 turns | No answer at the turn limit |
Source search remains the right tool for local textual questions. naja-scope
adds the elaborated hierarchy, connectivity, lowered primitives, and generated
or uniquified structures that are otherwise difficult to reconstruct.
See the benchmark methodology and multi-model runner
and historical result record for
configuration, scoring, token accounting, and reproducibility details.
---
Install
---
Connect it to Claude Code
Or add it to any MCP client's config:
Then just ask your assistant to load a design and start exploring:
> *"Load my UART design from rtl/uart.sv with top uart_top, then show me
来源
awesome · https://github.com/najaeda/naja-scope
按领域浏览
MCP 服务
Traction
17 ★
收录于
昨天

更多MCP 服务

查看MCP 服务全部 5,525 条 →

所属领域与标签

每个标签都能点进去看同类的全部条目。数字是当前库里的真实条数。

浏览全部领域 →

← 返回索引