
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 分