
Reachvuln
io.github.CloudCorpRecords由 GitHub 账号 CloudCorpRecords 发布v0.1.0更新于 Nov 3, 2026
根据易受攻击的代码路径在您的代码中是否可达来对漏洞进行排序。
AI 翻译由 AI 模型根据下方的原文描述翻译,可能有误。
原文描述
Rank vulnerabilities by whether the vulnerable code path is reachable in your code.
概览
Reachvuln 的本地 MCP 服务;无需登录;STDIO。
暂无 AI 概览:以下信息来自注册中心条目和服务本身。
安装
在 SourceWeft 中
- 打开 控制台中的 Reachvuln,将其添加到工作区。
- 为需要使用其工具的对话启用该服务。
Desktop only,通过 STDIO。 STDIO 服务会启动本地进程,因此需要 SourceWeft 桌面宿主。
其他 MCP 客户端
参照 仓库 中的启动说明。
README
reachvuln
A scanner report with two hundred findings is not a work list. Most of those packages may never be loaded by your code at all, and of the ones that are, the vulnerable export may never be the one you import. reachvuln reorders the report around that question: given the findings, your modules and their imports, and your entry points, which findings can actually be reached?
Reachability is computed over the import graph you supply.
An import whose package equals another module's path
is a local edge; anything else is an external package
import. The reachable modules are the entry points plus
everything reached from them by following local edges —
breadth-first, and safe around cycles, so a circular import
chain neither loops forever nor hides what sits behind it.
A finding is reachable when some reachable module
imports its package and either the finding lists no
vulnerable_exports (any import of the package counts) or
that import's names share at least one entry with
vulnerable_exports. It is imported_unreachable when
some module imports the package but the reachable condition
does not hold — the package is in the tree, yet no reachable
module imports it in a way that touches the vulnerable
exports. It is not_imported when no module imports the
package at all. For a reachable finding, reached_via
lists the sorted distinct paths of the reachable modules
whose imports satisfy the condition; otherwise it is empty.
Ranking is pinned arithmetic, not a heuristic: severity
weighs critical 40, high 30, medium 20, and low 10, and the
weight is multiplied by 3 for reachable findings, by 1 for
imported-but-unreachable ones, and by 0 for not-imported
ones. Findings order by rank score descending, then
severity weight descending, then id ascending, and the
result also carries counts for the three classes.
Validation is strict and names the offending path: a
missing or badly typed vulnerabilities, modules, or
entry_points; a finding with a missing, empty, or
duplicate id, a missing or empty package, a severity
outside its enum, or a badly typed vulnerable_exports; a
module with a missing, empty, or duplicate path, a
missing imports, or an import with a bad package or
names; and an entry point that is not one of the module
paths. Note that entries in an import's names may be
empty strings — they simply never match a vulnerable
export, which is itself required to be non-empty. Unknown
extra fields are ignored, and no partial result is produced
on invalid input. The computation is pure and local: no
network, no configuration, and no repository is read.
CLI
args.json contains the full arguments object:
The result is printed as JSON:
Exit codes: 0 on success, 1 on a runtime error (including
an unreadable or invalid input file, or invalid input), 2
on a usage error.
MCP server
MCP client config:
Tools
-
rank_vulns_by_reach— Rank vulnerability findings by whether the vulnerable package and exports are reachable from your entry points.vulnerabilities(array, required, may be empty) — findings, each{id, package, severity, vulnerable_exports};idis a non-empty unique string,packagea non-empty string,severityone ofcritical,high,medium,low, andvulnerable_exportsan optional array of non-empty strings (default[])modules(array, required, may be empty) — modules, each{path, imports};pathis a non-empty unique string andimportsan array of{package, names}, wherepackageis a non-empty string andnamesa required array of strings (entries may be empty)entry_points(array, required, may be empty) — module paths that are entry points; every entry must equal some module'spath
Returns
{ranked, counts}, where each ranked entry is{id, package, severity, reachability, rank_score, reached_via}in the pinned order andcountsis{reachable, imported_unreachable, not_imported}.
Docker
Development
License
MIT — Copyright (c) 2026 Rene Turcios
来源:README.md,提交 f659040
工具
0版本历史
1- v0.1.0最新Nov 3, 2026
评分
已满足适用检查项的 50%
该评分衡量此收录条目的完整程度,依据注册中心条目、端点与公开来源计算得出。它不是对服务器本身的评价,也不表示服务器安全或当前可用:可连通性是带日期的检查结果,评分也不包含安装量或用户评价。
- 近 30 天内可连通25 分
请保持端点能够响应 MCP 握手;SourceWeft 每 30 天探测一次。
- 已声明认证方式10 分
请在注册中心条目中声明凭据请求头,或保持端点能够响应探测,以便判定其认证方式。
- 已列出工具15 分
请让服务器在无凭据时响应 tools/list,或发布可在沙箱中无凭据启动的软件包。
- 描述必需15 分
- 图标10 分
- 文档15 分
- 许可证10 分