[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7CHF59DV43JR69WVZDHF1GS":3,"skill-same:01M7CHF59DV43JR69WVZDHF1GS":60},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":18,"linkOnly":19,"markdownContent":20,"markdownBody":21,"frontMatter":22,"refName":23,"commitSha":24,"skillDirectory":25,"forksCount":26,"repositoryHtmlUrl":27,"repositoryHomepageUrl":6,"ownerHtmlUrl":28,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":29,"install":30,"resources":43},"01M7CHF59DV43JR69WVZDHF1GS","audit-augmentation",null,"Augments Trailmark code graphs with external audit findings from SARIF static analysis results, weAudit annotation files, and version-gated Trailmark 0.4.x binary-analysis graph exports. Maps findings to graph nodes by file and line overlap, creates severity-based subgraphs, and enables cross-referencing findings with pre-analysis data (blast radius, taint, etc.). Use when projecting SARIF results onto a code graph, overlaying weAudit annotations, importing binary graph findings, cross-referencing Semgrep, CodeQL, or binary-analysis findings with call graph data, or visualizing audit findings in the context of code structure.","bongkage\u002Ftrailofbits-skills","bongkage","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F101378796?v=4","01M7CH419QTJ16DNJ33P0WCWBE","01M7CH41A9NWK8D2JBRK9F0M2C",1,"CC-BY-SA-4.0","https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Ftrailmark\u002Fskills\u002Faudit-augmentation\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: audit-augmentation\ndescription: >\n  Augments Trailmark code graphs with external audit findings from SARIF static\n  analysis results, weAudit annotation files, and version-gated Trailmark 0.4.x\n  binary-analysis graph exports. Maps findings to graph nodes by\n  file and line overlap, creates severity-based subgraphs, and enables\n  cross-referencing findings with pre-analysis data (blast radius, taint, etc.).\n  Use when projecting SARIF results onto a code graph, overlaying weAudit\n  annotations, importing binary graph findings, cross-referencing Semgrep,\n  CodeQL, or binary-analysis findings with call graph data, or visualizing audit\n  findings in the context of code structure.\n---\n\n# Audit Augmentation\n\nProjects findings from external tools (SARIF) and human auditors (weAudit)\nonto Trailmark code graphs as annotations and subgraphs. Trailmark 0.4.0+ can\nalso import an external binary-analysis graph JSON export via\n`engine.augment_binary()`.\n\n## When to Use\n\n- Importing Semgrep, CodeQL, or other SARIF-producing tool results into a graph\n- Importing weAudit audit annotations into a graph\n- Importing binary-analysis graph data into a source graph (Trailmark 0.4.0+)\n- Cross-referencing static analysis findings with blast radius or taint data\n- Querying which functions have high-severity findings\n- Visualizing audit coverage alongside code structure\n- Preparing one SARIF or weAudit result for `trailmark-finding-triage`\n\n## When NOT to Use\n\n- Running static analysis tools (use semgrep\u002Fcodeql directly, then import)\n- Building the code graph itself (use the `trailmark` skill)\n- Generating diagrams (use the `diagramming-code` skill after augmenting)\n\n## Rationalizations to Reject\n\n| Rationalization | Why It's Wrong | Required Action |\n|-----------------|----------------|-----------------|\n| \"The user only asked about SARIF, skip pre-analysis\" | Without pre-analysis, you can't cross-reference findings with blast radius or taint | Always run `engine.preanalysis()` before augmenting |\n| \"Unmatched findings don't matter\" | Unmatched findings may indicate parsing gaps or out-of-scope files | Report unmatched count and investigate if high |\n| \"One severity subgraph is enough\" | Different severities need different triage workflows | Query all severity subgraphs, not just `error` |\n| \"SARIF results speak for themselves\" | Findings without graph context lack blast radius and taint reachability | Cross-reference with pre-analysis subgraphs |\n| \"weAudit and SARIF overlap, pick one\" | Human auditors and tools find different things | Import both when available |\n| \"Tool isn't installed, I'll do it manually\" | Manual analysis misses what tooling catches | Install trailmark first |\n\n---\n\n## Installation\n\n**MANDATORY:** If `uv run trailmark` fails, install trailmark first:\n\n```bash\nuv tool install trailmark\n# Python snippets: uv run --with trailmark python -   (a tool env is not importable)\n```\n\n## Version Gate\n\nSARIF and weAudit augmentation are v0.2-safe. Binary graph augmentation is\nTrailmark 0.4.0+ only. Before calling `engine.augment_binary()`, check:\n\n```python\nif not hasattr(engine, \"augment_binary\"):\n    raise RuntimeError(\"Binary augmentation requires Trailmark >= 0.4.0\")\n```\n\nOn Trailmark 0.5.0+, known links between source functions and imported binary\nor external endpoints can also be declared once in `.trailmark\u002Flinks.toml`\n(see the main `trailmark` skill's Repository Links section) instead of being\nre-derived per session. Declared external endpoints materialize as\n`proxy.external:\u003Csymbol>` nodes on every parse.\n\n## Quick Start\n\n### CLI\n\n```bash\n# Augment with SARIF\nuv run trailmark augment {targetDir} --sarif results.sarif\n\n# Augment with weAudit\nuv run trailmark augment {targetDir} --weaudit .vscode\u002Falice.weaudit\n\n# Both at once, output JSON\nuv run trailmark augment {targetDir} \\\n    --sarif results.sarif \\\n    --weaudit .vscode\u002Falice.weaudit \\\n    --json\n```\n\nBinary graph augmentation is programmatic in Trailmark 0.4.0+; do not invent a\nCLI flag if `trailmark augment --help` does not show one.\n\n### Programmatic API\n\n```python\nfrom trailmark.query.api import QueryEngine\n\nengine = QueryEngine.from_directory(\"{targetDir}\", language=\"auto\")\n\n# Run pre-analysis first for cross-referencing\nengine.preanalysis()\n\n# Augment with SARIF\nresult = engine.augment_sarif(\"results.sarif\")\n# result: {matched_findings: 12, unmatched_findings: 3, subgraphs_created: [...]}\n\n# Augment with weAudit\nresult = engine.augment_weaudit(\".vscode\u002Falice.weaudit\")\n\n# Augment with an external binary graph export (v0.4+)\nif hasattr(engine, \"augment_binary\"):\n    result = engine.augment_binary(\"binary_graph.json\")\n\n# Query findings\nengine.findings()                                       # All findings\nengine.subgraph(\"sarif:error\")                          # High-severity SARIF\nengine.subgraph(\"weaudit:high\")                         # High-severity weAudit\nengine.subgraph(\"sarif:semgrep\")                        # By tool name\nengine.annotations_of(\"function_name\")                  # Per-node lookup\n```\n\nIf auto-detection is wrong for the target, rerun with an explicit language or\ncomma-separated list such as `python,rust`.\n\n## Workflow\n\n```\nAugmentation Progress:\n- [ ] Step 1: Build graph and run pre-analysis\n- [ ] Step 2: Locate SARIF\u002FweAudit\u002Fbinary graph files\n- [ ] Step 3: Run augmentation\n- [ ] Step 4: Inspect results and subgraphs\n- [ ] Step 5: Cross-reference with pre-analysis\n```\n\n**Step 1:** Build the graph and run pre-analysis for blast radius and taint\ncontext:\n\n```python\nengine = QueryEngine.from_directory(\"{targetDir}\", language=\"auto\")\nengine.preanalysis()\n```\n\nIf auto-detection is wrong for the target, rerun with an explicit language or\ncomma-separated list such as `python,rust`.\n\n**Step 2:** Locate input files:\n- **SARIF**: Usually output by tools like `semgrep --sarif -o results.sarif`\n  or `codeql database analyze --format=sarif-latest`\n- **weAudit**: Stored in `.vscode\u002F\u003Cusername>.weaudit` within the workspace\n- **Binary graph (v0.4+)**: External JSON with `artifact`, `functions`, and\n  `calls` fields. Trailmark imports this graph; it does not disassemble\n  binaries itself.\n\n**Step 3:** Run augmentation via `engine.augment_sarif()` or\n`engine.augment_weaudit()`. For binary graphs, run `engine.augment_binary()`\nonly after the Version Gate succeeds. Check `unmatched_findings` in SARIF and\nweAudit results — these are findings whose file\u002Fline locations didn't overlap\nany parsed code unit.\n\n**Step 4:** Query findings and subgraphs. Use `engine.findings()` to list all\nannotated nodes. Use `engine.subgraph_names()` to see available subgraphs.\n\n**Step 5:** Cross-reference with pre-analysis data to prioritize:\n- Findings on tainted nodes: overlap `sarif:error` with `tainted` subgraph\n- Findings on high blast radius nodes: overlap with `high_blast_radius`\n- Findings on privilege boundaries: overlap with `privilege_boundary`\n\nFor one candidate finding that needs a reachability verdict or PoC handoff,\ncontinue with `trailmark-finding-triage` and use the augmented node as the\nbound candidate.\n\n## Annotation Format\n\nFindings are stored as standard Trailmark annotations:\n\n- **Kind**: `finding` (tool-generated) or `audit_note` (human notes)\n- **Source**: `sarif:\u003Ctool_name>` or `weaudit:\u003Cauthor>`\n- **Description**: Compact single-line:\n  `[SEVERITY] rule-id: message (tool)`\n\n## Subgraphs Created\n\n| Subgraph | Contents |\n|----------|----------|\n| `sarif:error` | Nodes with SARIF error-level findings |\n| `sarif:warning` | Nodes with SARIF warning-level findings |\n| `sarif:note` | Nodes with SARIF note-level findings |\n| `sarif:\u003Ctool>` | Nodes flagged by a specific tool |\n| `weaudit:high` | Nodes with high-severity weAudit findings |\n| `weaudit:medium` | Nodes with medium-severity weAudit findings |\n| `weaudit:low` | Nodes with low-severity weAudit findings |\n| `weaudit:findings` | All weAudit findings (entryType=0) |\n| `weaudit:notes` | All weAudit notes (entryType=1) |\n| `binary:\u003Cartifact>` | Binary function nodes imported from a v0.4+ binary graph |\n\n## How Matching Works\n\nFindings are matched to graph nodes by file path and line range overlap:\n\n1. Finding file path is normalized relative to the graph's `root_path`\n2. Nodes whose `location.file_path` matches AND whose line range overlaps are\n   selected\n3. The tightest match (smallest span) is preferred\n4. If a finding's location doesn't overlap any node, it counts as unmatched\n\nSARIF paths may be relative, absolute, or `file:\u002F\u002F` URIs — all are handled.\nweAudit uses 0-indexed lines which are converted to 1-indexed automatically.\n\nBinary graph imports create `origin=binary` function nodes, `origin=proxy`\nexternal proxy nodes for unresolved binary calls, and inferred\n`corresponds_to` edges when a binary function maps back to a source node. The\nexpected JSON shape is intentionally small:\n\n```json\n{\n  \"artifact\": {\"name\": \"libexample\", \"architecture\": \"x86_64\", \"sha256\": \"...\"},\n  \"functions\": [\n    {\"symbol\": \"parse_packet\", \"address\": \"0x401000\",\n     \"source\": {\"file\": \"src\u002Fparser.c\", \"line\": 42}}\n  ],\n  \"calls\": [\n    {\"source\": \"parse_packet\", \"target\": \"malloc\", \"confidence\": \"inferred\"}\n  ]\n}\n```\n\n## Supporting Documentation\n\n- **[references\u002Fformats.md](references\u002Fformats.md)** — SARIF 2.1.0 and\n  weAudit file format field reference\n","# Audit Augmentation\n\nProjects findings from external tools (SARIF) and human auditors (weAudit)\nonto Trailmark code graphs as annotations and subgraphs. Trailmark 0.4.0+ can\nalso import an external binary-analysis graph JSON export via\n`engine.augment_binary()`.\n\n## When to Use\n\n- Importing Semgrep, CodeQL, or other SARIF-producing tool results into a graph\n- Importing weAudit audit annotations into a graph\n- Importing binary-analysis graph data into a source graph (Trailmark 0.4.0+)\n- Cross-referencing static analysis findings with blast radius or taint data\n- Querying which functions have high-severity findings\n- Visualizing audit coverage alongside code structure\n- Preparing one SARIF or weAudit result for `trailmark-finding-triage`\n\n## When NOT to Use\n\n- Running static analysis tools (use semgrep\u002Fcodeql directly, then import)\n- Building the code graph itself (use the `trailmark` skill)\n- Generating diagrams (use the `diagramming-code` skill after augmenting)\n\n## Rationalizations to Reject\n\n| Rationalization | Why It's Wrong | Required Action |\n|-----------------|----------------|-----------------|\n| \"The user only asked about SARIF, skip pre-analysis\" | Without pre-analysis, you can't cross-reference findings with blast radius or taint | Always run `engine.preanalysis()` before augmenting |\n| \"Unmatched findings don't matter\" | Unmatched findings may indicate parsing gaps or out-of-scope files | Report unmatched count and investigate if high |\n| \"One severity subgraph is enough\" | Different severities need different triage workflows | Query all severity subgraphs, not just `error` |\n| \"SARIF results speak for themselves\" | Findings without graph context lack blast radius and taint reachability | Cross-reference with pre-analysis subgraphs |\n| \"weAudit and SARIF overlap, pick one\" | Human auditors and tools find different things | Import both when available |\n| \"Tool isn't installed, I'll do it manually\" | Manual analysis misses what tooling catches | Install trailmark first |\n\n---\n\n## Installation\n\n**MANDATORY:** If `uv run trailmark` fails, install trailmark first:\n\n```bash\nuv tool install trailmark\n# Python snippets: uv run --with trailmark python -   (a tool env is not importable)\n```\n\n## Version Gate\n\nSARIF and weAudit augmentation are v0.2-safe. Binary graph augmentation is\nTrailmark 0.4.0+ only. Before calling `engine.augment_binary()`, check:\n\n```python\nif not hasattr(engine, \"augment_binary\"):\n    raise RuntimeError(\"Binary augmentation requires Trailmark >= 0.4.0\")\n```\n\nOn Trailmark 0.5.0+, known links between source functions and imported binary\nor external endpoints can also be declared once in `.trailmark\u002Flinks.toml`\n(see the main `trailmark` skill's Repository Links section) instead of being\nre-derived per session. Declared external endpoints materialize as\n`proxy.external:\u003Csymbol>` nodes on every parse.\n\n## Quick Start\n\n### CLI\n\n```bash\n# Augment with SARIF\nuv run trailmark augment {targetDir} --sarif results.sarif\n\n# Augment with weAudit\nuv run trailmark augment {targetDir} --weaudit .vscode\u002Falice.weaudit\n\n# Both at once, output JSON\nuv run trailmark augment {targetDir} \\\n    --sarif results.sarif \\\n    --weaudit .vscode\u002Falice.weaudit \\\n    --json\n```\n\nBinary graph augmentation is programmatic in Trailmark 0.4.0+; do not invent a\nCLI flag if `trailmark augment --help` does not show one.\n\n### Programmatic API\n\n```python\nfrom trailmark.query.api import QueryEngine\n\nengine = QueryEngine.from_directory(\"{targetDir}\", language=\"auto\")\n\n# Run pre-analysis first for cross-referencing\nengine.preanalysis()\n\n# Augment with SARIF\nresult = engine.augment_sarif(\"results.sarif\")\n# result: {matched_findings: 12, unmatched_findings: 3, subgraphs_created: [...]}\n\n# Augment with weAudit\nresult = engine.augment_weaudit(\".vscode\u002Falice.weaudit\")\n\n# Augment with an external binary graph export (v0.4+)\nif hasattr(engine, \"augment_binary\"):\n    result = engine.augment_binary(\"binary_graph.json\")\n\n# Query findings\nengine.findings()                                       # All findings\nengine.subgraph(\"sarif:error\")                          # High-severity SARIF\nengine.subgraph(\"weaudit:high\")                         # High-severity weAudit\nengine.subgraph(\"sarif:semgrep\")                        # By tool name\nengine.annotations_of(\"function_name\")                  # Per-node lookup\n```\n\nIf auto-detection is wrong for the target, rerun with an explicit language or\ncomma-separated list such as `python,rust`.\n\n## Workflow\n\n```\nAugmentation Progress:\n- [ ] Step 1: Build graph and run pre-analysis\n- [ ] Step 2: Locate SARIF\u002FweAudit\u002Fbinary graph files\n- [ ] Step 3: Run augmentation\n- [ ] Step 4: Inspect results and subgraphs\n- [ ] Step 5: Cross-reference with pre-analysis\n```\n\n**Step 1:** Build the graph and run pre-analysis for blast radius and taint\ncontext:\n\n```python\nengine = QueryEngine.from_directory(\"{targetDir}\", language=\"auto\")\nengine.preanalysis()\n```\n\nIf auto-detection is wrong for the target, rerun with an explicit language or\ncomma-separated list such as `python,rust`.\n\n**Step 2:** Locate input files:\n- **SARIF**: Usually output by tools like `semgrep --sarif -o results.sarif`\n  or `codeql database analyze --format=sarif-latest`\n- **weAudit**: Stored in `.vscode\u002F\u003Cusername>.weaudit` within the workspace\n- **Binary graph (v0.4+)**: External JSON with `artifact`, `functions`, and\n  `calls` fields. Trailmark imports this graph; it does not disassemble\n  binaries itself.\n\n**Step 3:** Run augmentation via `engine.augment_sarif()` or\n`engine.augment_weaudit()`. For binary graphs, run `engine.augment_binary()`\nonly after the Version Gate succeeds. Check `unmatched_findings` in SARIF and\nweAudit results — these are findings whose file\u002Fline locations didn't overlap\nany parsed code unit.\n\n**Step 4:** Query findings and subgraphs. Use `engine.findings()` to list all\nannotated nodes. Use `engine.subgraph_names()` to see available subgraphs.\n\n**Step 5:** Cross-reference with pre-analysis data to prioritize:\n- Findings on tainted nodes: overlap `sarif:error` with `tainted` subgraph\n- Findings on high blast radius nodes: overlap with `high_blast_radius`\n- Findings on privilege boundaries: overlap with `privilege_boundary`\n\nFor one candidate finding that needs a reachability verdict or PoC handoff,\ncontinue with `trailmark-finding-triage` and use the augmented node as the\nbound candidate.\n\n## Annotation Format\n\nFindings are stored as standard Trailmark annotations:\n\n- **Kind**: `finding` (tool-generated) or `audit_note` (human notes)\n- **Source**: `sarif:\u003Ctool_name>` or `weaudit:\u003Cauthor>`\n- **Description**: Compact single-line:\n  `[SEVERITY] rule-id: message (tool)`\n\n## Subgraphs Created\n\n| Subgraph | Contents |\n|----------|----------|\n| `sarif:error` | Nodes with SARIF error-level findings |\n| `sarif:warning` | Nodes with SARIF warning-level findings |\n| `sarif:note` | Nodes with SARIF note-level findings |\n| `sarif:\u003Ctool>` | Nodes flagged by a specific tool |\n| `weaudit:high` | Nodes with high-severity weAudit findings |\n| `weaudit:medium` | Nodes with medium-severity weAudit findings |\n| `weaudit:low` | Nodes with low-severity weAudit findings |\n| `weaudit:findings` | All weAudit findings (entryType=0) |\n| `weaudit:notes` | All weAudit notes (entryType=1) |\n| `binary:\u003Cartifact>` | Binary function nodes imported from a v0.4+ binary graph |\n\n## How Matching Works\n\nFindings are matched to graph nodes by file path and line range overlap:\n\n1. Finding file path is normalized relative to the graph's `root_path`\n2. Nodes whose `location.file_path` matches AND whose line range overlaps are\n   selected\n3. The tightest match (smallest span) is preferred\n4. If a finding's location doesn't overlap any node, it counts as unmatched\n\nSARIF paths may be relative, absolute, or `file:\u002F\u002F` URIs — all are handled.\nweAudit uses 0-indexed lines which are converted to 1-indexed automatically.\n\nBinary graph imports create `origin=binary` function nodes, `origin=proxy`\nexternal proxy nodes for unresolved binary calls, and inferred\n`corresponds_to` edges when a binary function maps back to a source node. The\nexpected JSON shape is intentionally small:\n\n```json\n{\n  \"artifact\": {\"name\": \"libexample\", \"architecture\": \"x86_64\", \"sha256\": \"...\"},\n  \"functions\": [\n    {\"symbol\": \"parse_packet\", \"address\": \"0x401000\",\n     \"source\": {\"file\": \"src\u002Fparser.c\", \"line\": 42}}\n  ],\n  \"calls\": [\n    {\"source\": \"parse_packet\", \"target\": \"malloc\", \"confidence\": \"inferred\"}\n  ]\n}\n```\n\n## Supporting Documentation\n\n- **[references\u002Fformats.md](references\u002Fformats.md)** — SARIF 2.1.0 and\n  weAudit file format field reference\n",{"name":5,"description":7},"main","321ccfe628eca0d314b0ee4eaffcdd8a05639aaf","plugins\u002Ftrailmark\u002Fskills\u002Faudit-augmentation",0,"https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills","https:\u002F\u002Fgithub.com\u002Fbongkage","2026-11-06 12:15:06",{"source":8,"skillName":5,"commands":31,"prompt":41,"zipAvailable":42},[32,35,38],{"tool":33,"command":34},"npx","npx skills add bongkage\u002Ftrailofbits-skills --skill audit-augmentation",{"tool":36,"command":37},"bunx","bunx skills add bongkage\u002Ftrailofbits-skills --skill audit-augmentation",{"tool":39,"command":40},"pnpm","pnpm dlx skills add bongkage\u002Ftrailofbits-skills --skill audit-augmentation","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Ftrailmark\u002Fskills\u002Faudit-augmentation\u002FSKILL.md",true,[44,50,56],{"path":45,"resourceType":46,"resourceTypeDesc":47,"sizeBytes":48,"sourceHtmlUrl":49},"agents\u002Fopenai.yaml","REFERENCE","参考文档",128,"https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Ftrailmark\u002Fskills\u002Faudit-augmentation\u002Fagents\u002Fopenai.yaml",{"path":51,"resourceType":52,"resourceTypeDesc":53,"sizeBytes":54,"sourceHtmlUrl":55},"assets\u002Ftrail-of-bits-mark.svg","ASSET","资产文件",3084,"https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Ftrailmark\u002Fskills\u002Faudit-augmentation\u002Fassets\u002Ftrail-of-bits-mark.svg",{"path":57,"resourceType":46,"resourceTypeDesc":47,"sizeBytes":58,"sourceHtmlUrl":59},"references\u002Fformats.md",3609,"https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Ftrailmark\u002Fskills\u002Faudit-augmentation\u002Freferences\u002Fformats.md",[61,68,75,82,89,96],{"skillNo":62,"name":63,"nameZh":6,"description":64,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":65,"categories":66,"keywords":67,"publishedAt":18},"01M7CHJAESZRWKJXFQG55BMNAA","zeroize-audit","Detects missing zeroization of sensitive data in source code and identifies zeroization removed by compiler optimizations, with assembly-level analysis, and control-flow verification. Use for auditing C\u002FC++\u002FRust code handling secrets, keys, passwords, or other sensitive data.","https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Fzeroize-audit\u002Fskills\u002Fzeroize-audit\u002FSKILL.md",[],[],{"skillNo":69,"name":70,"nameZh":6,"description":71,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":72,"categories":73,"keywords":74,"publishedAt":18},"01M7CHJ543G42A9GQC3PJE4F4V","yara-rule-authoring","Guides authoring of high-quality YARA-X detection rules for malware identification. Use when writing, reviewing, or optimizing YARA rules. Covers naming conventions, string selection, performance optimization, migration from legacy YARA, and false positive reduction. Triggers on: YARA, YARA-X, malware detection, threat hunting, IOC, signature, crx module, dex module.","https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Fyara-authoring\u002Fskills\u002Fyara-rule-authoring\u002FSKILL.md",[],[],{"skillNo":76,"name":77,"nameZh":6,"description":78,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":79,"categories":80,"keywords":81,"publishedAt":18},"01M7CHHYVFS1AKDTH3YDS1Y4K4","writing-lean-proofs","Writes and reviews structured Lean 4 proofs and designs Lean libraries following Mathlib conventions. Use when proving theorems in Lean, formalizing mathematics or specifications in Lean 4, defining new types or definitions in a Lean library, reviewing Lean proofs for readability and maintainability, refactoring long tactic proofs into lemmas, filling in sorry placeholders in a Lean development, setting up CI or linters for a Lean project, diagnosing slow proofs or maxHeartbeats timeouts, or writing custom tactics, macros, or linters.","https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Fwriting-lean-proofs\u002Fskills\u002Fwriting-lean-proofs\u002FSKILL.md",[],[],{"skillNo":83,"name":84,"nameZh":6,"description":85,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":86,"categories":87,"keywords":88,"publishedAt":18},"01M7CHHQXA39M4965MV2RMM5YS","vulnerability-triage-brocards","This skill should be used when the user asks to \"triage a vulnerability report\", \"assess a CVE\", \"evaluate a bug bounty submission\", \"decide if a finding is valid\", \"review a security finding\", \"dismiss a vulnerability\", \"should we fix this CVE\", \"prioritize a vulnerability report\", or needs to determine whether an incoming vulnerability report warrants investigation. Applies 7 brocards (rules of thumb) to systematically accept, dismiss, or request more information on vulnerability reports, or needs to filter raw findings from agentic vulnerability discovery pipelines before human review.","https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Fvulnerability-triage-brocards\u002Fskills\u002Fvulnerability-triage-brocards\u002FSKILL.md",[],[],{"skillNo":90,"name":91,"nameZh":6,"description":92,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":93,"categories":94,"keywords":95,"publishedAt":18},"01M7CHHJVQC2ZG2M310GXT0T42","variant-analysis","Hunts for the other instances of a bug already found — the variants of one root cause across a codebase. Use immediately after a vulnerability, logic bug, or bad pattern turns up in a specific file and the question becomes where else it occurs, including the bare conversational form (\"are there others like this?\", \"is this the same bug?\"). Also for generalizing one known instance into a CodeQL or Semgrep query for its whole pattern family, and for triaging a set of look-alike candidates against a known root cause. Not for initial discovery with no bug in hand.","https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Fvariant-analysis\u002Fskills\u002Fvariant-analysis\u002FSKILL.md",[],[],{"skillNo":97,"name":98,"nameZh":6,"description":99,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":100,"categories":101,"keywords":102,"publishedAt":18},"01M7CHHC1GM5GH585ZWGP7D03P","vector-forge","Mutation-driven test vector generation. Finds implementations of a cryptographic algorithm or protocol, runs mutation testing to identify escaped mutants, then generates new test vectors that deliberately exercise the uncovered code paths. Compares before\u002Fafter mutation kill rates to prove vector effectiveness. Use when generating cryptographic test vectors, measuring Wycheproof coverage gaps, finding escaped mutants via mutation testing, creating cross-implementation test suites, or improving test vector coverage for crypto primitives.","https:\u002F\u002Fgithub.com\u002Fbongkage\u002Ftrailofbits-skills\u002Fblob\u002Fmain\u002Fplugins\u002Ftrailmark\u002Fskills\u002Fvector-forge\u002FSKILL.md",[],[]]