追踪标记寻找分类
- 作者仓库星标 0
- 作者更新于 2026年8月24日 23:09
- 作者仓库 skills
- 领域
- 人工智能
- 作者声明的智能体
- 未找到明确声明;不据此推断已兼容或已测试
- 静态检查
- 88 / 100 · 启发式扫描,不代表运行安全
- 运行环境证据
- 未执行;当前没有隔离运行测试证据
- 作者 / 版本 / 许可证
- @trailofbits · 未声明许可证
- 上下文用量评级
- 低消耗
- 接入复杂程度
- 即装即用
- 是否需要外部接口密钥
- 不需要
- 兼容的系统
- macOS · Linux · Windows
- 运行环境要求
- Node.js
- 检测到的文件与系统行为
-
- 只读
- 允许写入 / 修改
- 网络行为
- 仅限本地
- 安装命令数
- 无(仅作为资料)
需要注意: 未声明工具权限范围;实际权限由运行环境决定。
第 1 步:规范候选人
接受文件/行、函数名称、SARIF 结果、weAudit 注释、Markdown 查找摘录或手动声明。将其规范化为:标题源类型文件路径和行范围(如果存在)
第 2 步:构建或重用图表
使用公共`trailmark`技能工作流程。更喜欢现有的新鲜导出图表或 `.trailmark/` 工件(如果存在)。否则,使用`language="auto"`或目标的显式语言列表构建图形,然后运行`engine.preanalysis()`。记录使用的 Trailmark 版本或功能探针。特征门跟踪标记
第 3 步:绑定候选人
首先按文件和行重叠绑定,然后是函数名加文件。如果有多个节点匹配,则列出每个候选节点并选择最窄的封闭节点作为主节点。如果没有节点匹配,则报告绑定限制而不是猜测。 SARIF 和 weAudit 用户应重用`audit-augmentation`工作流程进行匹配,然后检查带注释的节点。
第 4 步:分析图表证据
在references/query-recipes.md中运行查询配方:当`tainted`、`privilege_boundary`和`high_blast_radius`中有可用成员资格时,每个路径的绑定节点信任级别的入口点路径
第 5 步:决定并移交
做出一项判决: 判决 · 含义 `Promote` · 图证据支持可达性和似是而非的影响 `Needs manual review` · 证据是暗示性的,但不是决定性的 `Deprioritize` · 没有可达路径或仅找到可信/内部路径
# Trailmark Finding Triage
Build a concise graph evidence packet for one candidate finding. This skill
answers whether the affected code is reachable, what graph evidence supports
or weakens the claim, and what manual review is still required before calling
the issue exploitable.
## When to Use
- Triage one static-analysis result before spending PoC time
- Check whether a manual finding is entrypoint-reachable
- Build an evidence packet for PoC work
- Review a single suspicious function discovered during manual audit
- Decide whether one issue should be promoted, deprioritized, or treated as
part of a broader chain analysis
## When NOT to Use
- Multiple weak findings might compose into a stronger chain. Use a chain or
composition workflow instead.
- The user wants a full audit. Use an audit or design-review workflow instead.
- The user wants remediation verification for a known finding. Use a
remediation-review workflow instead.
- The target is a PR or branch diff. Use `graph-evolution` plus a differential
review workflow.
- No concrete finding, function, file/line, or suspicious sink exists yet. Use
discovery skills first.
## Rationalizations to Reject
| Rationalization | Why It Is Wrong | Required Action |
|---|---|---|
| "The scanner says high severity, so reachability is obvious" | Static findings need graph and code context before promotion | Bind the finding to a graph node and check entrypoint paths |
| "No entrypoint path means impossible" | It may mean parser, proxy, or dynamic dispatch limitations | Report the limitation separately from reachability |
| "An auth check appears on the path, so the issue is safe" | The check may enforce the wrong predicate or be bypassed by another path | Treat validation/auth as review targets, not proof |
| "One reachable path is enough for a PoC claim" | The path still needs attacker-controlled inputs and compatible preconditions | Separate graph reachability from exploitability |
| "This is probably a chain" | Single-finding triage stops at one candidate | Hand off related findings to a composition workflow |
## Workflow
```
Finding Triage Progress:
- [ ] Step 1: Normalize the candidate
- [ ] Step 2: Build or reuse the Trailmark graph
- [ ] Step 3: Bind the candidate to graph node(s)
- [ ] Step 4: Analyze reachability, taint, boundaries, and blast radius
- [ ] Step 5: Decide and emit the evidence packet
```
### Step 1: Normalize the Candidate
Accept file/line, function name, SARIF result, weAudit annotation, Markdown
finding excerpt, or a manual claim. Normalize it to:
- title
- source type
- file path and line range if present
- function or node hint
- suspected source, sink, or asset
- claimed impact
If there is no concrete code anchor, stop and ask for one.
For input handling details, see
[references/input-normalization.md](references/input-normalization.md).
### Step 2: Build Or Reuse The Graph
Use the public `trailmark` skill workflow. Prefer an existing fresh exported
graph or `.trailmark/` artifact when present. Otherwise build a graph with
`language="auto"` or the target's explicit language list, then run
`engine.preanalysis()`.
Record the Trailmark version or feature probes used. Feature-gate Trailmark
0.4-only APIs with `hasattr()` or CLI help checks.
### Step 3: Bind The Candidate
Bind by file and line overlap first, then function name plus file. If several
nodes match, list every candidate and select the narrowest enclosing node as
primary. If no node matches, report a binding limitation instead of guessing.
SARIF and weAudit users should reuse the `audit-augmentation` workflow for
matching and then inspect the annotated node.
### Step 4: Analyze Graph Evidence
Run the query recipe in
[references/query-recipes.md](references/query-recipes.md):
- entrypoint paths to the bound node
- trust level of each path when available
- membership in `tainted`, `privilege_boundary`, and `high_blast_radius`
subgraphs
- direct callers and callees
- high-impact downstream sinks
- sibling or nearby nodes worth manual review
Do not treat graph reachability as proof of exploitability.
### Step 5: Decide And Handoff
Produce one verdict:
| Verdict | Meaning |
|---|---|
| `Promote` | Graph evidence supports reachability and plausible impact |
| `Needs manual review` | Evidence is suggestive but not decisive |
| `Deprioritize` | No reachable path or only trusted/internal paths found |
| `Blocked` | Binding or Trailmark analysis failed |
Write the evidence packet using
[references/output-format.md](references/output-format.md).
Hand off promoted PoC-worthy issues to the user's PoC workflow. Hand off
related findings to a composition workflow. Hand off repeatable root causes to
`trailmark-variant-neighborhood`, `variant-analysis`, or a custom Semgrep/CodeQL
rule workflow.
## Example Prompts
- "Use Trailmark finding triage on `src/Vault.sol:148`; I think withdraw can
bypass the balance update."
- "Triage this SARIF result before I spend PoC time: `semgrep:error
unchecked-transfer` in `contracts/Bridge.sol` line 91."
- "This report excerpt claims `parse_packet` is attacker reachable. Build the
Trailmark evidence packet and tell me what is still missing."
章节与文件索引
按说明文件中的顺序排列。
何时使用
何时不使用
拒绝的理由
第 1 步:规范候选人
第 2 步:构建或重用图表
文件/命令 -> graph-evolution · trailmark · .trailmark/ · language="auto" · engine.preanalysis() · hasattr() · audit-augmentation · tainted
内容校验值 -> bd6733e04344
当前原文的自动摘译,尚未人工审校。
何时使用
在花费 PoC 时间之前对一个静态分析结果进行分类 检查手动发现的入口点是否可达 为 PoC 工作构建证据包 审查手动审核期间发现的单个可疑功能 决定是否应升级、取消优先级或将一个问题视为
何时不使用
多个薄弱的发现可能会组成一个更强的链条。请改用链或组合工作流程。用户想要进行全面审核。请改用审核或设计审核工作流程。用户希望对已知发现进行补救验证。请改用修复审核工作流程。
拒绝的理由
合理化 · 错误的原因 · 所需的操作 “扫描器显示严重性很高,因此可达性很明显” · 静态发现在升级之前需要图形和代码上下文 · 将发现绑定到图形节点并检查入口点路径 “没有入口点路径意味着不可能” · 这可能意味着解析器、代理或动态分派限制 · 将限制与可达性分开报告“身份验证检查出现在路径上,因此问题是安全的” · 检查可能会强制执行错误的谓词或被其他路径绕过 · 对待验证/身份验证作为审查目标,而不是证据
第 2 步:构建或重用图表
使用公共
trailmark技能工作流程。更喜欢现有的新导出图表或.trailmark/工件(如果存在)。否则使用language="auto"或目标的显式语言列表构建图形,然后运行engine.preanalysis()。记录使用的 Trailmark 版本或功能探针。特征门跟踪标记