[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill-trail-of-bits-trailmark-variant-neighborhood":3,"mdc--qa2u25-key":38,"related-repo-trail-of-bits-trailmark-variant-neighborhood":505,"related-org-trail-of-bits-trailmark-variant-neighborhood":601},{"slug":4,"name":4,"fn":5,"description":6,"org":7,"tags":12,"stars":26,"repoUrl":27,"updatedAt":28,"license":29,"forks":30,"topics":31,"repo":33,"sourceUrl":36,"mdContent":37},"trailmark-variant-neighborhood","identify vulnerability variants using graph neighborhoods","Expands one confirmed or suspected vulnerability into a Trailmark graph neighborhood of variant candidates by finding sibling functions, shared callers and callees, common sensitive sinks, common entrypoint paths, interface implementations, override relationships, type\u002Freference neighbors, and structurally similar nodes. Use after one issue is found to seed variant-analysis, semgrep-rule-creator, static-analysis, or manual review with graph-derived candidate locations.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},"trail-of-bits","Trail of Bits","https:\u002F\u002Fpexgzepcugksgbtrxkhf.supabase.co\u002Fstorage\u002Fv1\u002Fobject\u002Fpublic\u002Forg-logos\u002Ftrail-of-bits.png","trailofbits",[13,17,20,23],{"name":14,"slug":15,"type":16},"Security","security","tag",{"name":18,"slug":19,"type":16},"Graph Analysis","graph-analysis",{"name":21,"slug":22,"type":16},"Code Analysis","code-analysis",{"name":24,"slug":25,"type":16},"Debugging","debugging",6139,"https:\u002F\u002Fgithub.com\u002Ftrailofbits\u002Fskills","2026-08-01T06:06:10.036636",null,541,[32],"agent-skills",{"repoUrl":27,"stars":26,"forks":30,"topics":34,"description":35},[32],"Trail of Bits Claude Code skills for security research, vulnerability detection, and audit workflows","https:\u002F\u002Fgithub.com\u002Ftrailofbits\u002Fskills\u002Ftree\u002FHEAD\u002Fplugins\u002Ftrailmark\u002Fskills\u002Ftrailmark-variant-neighborhood","---\nname: trailmark-variant-neighborhood\ndescription: \"Expands one confirmed or suspected vulnerability into a Trailmark graph neighborhood of variant candidates by finding sibling functions, shared callers and callees, common sensitive sinks, common entrypoint paths, interface implementations, override relationships, type\u002Freference neighbors, and structurally similar nodes. Use after one issue is found to seed variant-analysis, semgrep-rule-creator, static-analysis, or manual review with graph-derived candidate locations.\"\nallowed-tools:\n  - Bash\n  - Read\n  - Grep\n  - Glob\n  - Write\n---\n\n# Trailmark Variant Neighborhood\n\nExpand one seed issue into graph-derived variant candidates. This skill\ngenerates review targets, not confirmed findings.\n\n## When to Use\n\n- A finding is confirmed or plausible and variants may exist\n- The vulnerable pattern depends on call context\n- The issue involves a shared sink, source, validator, interface, override,\n  trait, hook, handler, adapter, or critical type\n- The next step is to seed `variant-analysis`, `semgrep-rule-creator`,\n  `static-analysis`, or manual review\n\n## When NOT to Use\n\n- No seed issue exists. Use discovery or triage first.\n- The pattern is purely syntactic and already obvious. Use\n  `semgrep-rule-creator` directly.\n- The question is exploit-chain composition across multiple findings. Use a\n  composition workflow.\n- The goal is remediation verification. Use a remediation-review workflow.\n- The seed cannot be bound to a graph node.\n\n## Rationalizations to Reject\n\n| Rationalization | Why It Is Wrong | Required Action |\n|---|---|---|\n| \"Nearby code means variant\" | Proximity is only a candidate reason | Rank it as a review target |\n| \"Only exact same names matter\" | Variants often share sinks or preconditions, not names | Expand across callers, callees, interfaces, and types |\n| \"Every candidate is a finding\" | This skill outputs candidates for review | Avoid vulnerability claims |\n| \"Unreachable candidates can be ignored completely\" | They may become reachable after refactors | Rank lower or list as deferred |\n| \"Graph candidates replace semantic pattern work\" | Graph structure finds locations, not root-cause semantics | Hand off to variant-analysis, Semgrep, CodeQL, or manual review |\n\n## Workflow\n\n```\nVariant Neighborhood Progress:\n- [ ] Step 1: Normalize and bind the seed\n- [ ] Step 2: Expand graph neighborhoods\n- [ ] Step 3: Rank candidates\n- [ ] Step 4: Extract variant pattern guidance\n- [ ] Step 5: Emit handoff packet\n```\n\n### Step 1: Normalize And Bind The Seed\n\nAccept finding text, file\u002Fline, function name, or output from\n`trailmark-finding-triage`. Bind the seed to a Trailmark node and record the\nroot cause in plain language.\n\nIf the seed has no concrete graph binding, stop before inventing variants.\n\n### Step 2: Expand Neighborhoods\n\nUse the dimensions in\n[references\u002Fneighborhood-patterns.md](references\u002Fneighborhood-patterns.md):\n\n- shared callers\n- shared callees and sinks\n- entrypoint path neighbors\n- interface, override, trait, and implementation siblings\n- file or module cluster neighbors\n- taint or privilege-boundary peers\n- type and state-reference neighbors\n\nBound expansion to avoid candidate floods.\n\n### Step 3: Rank Candidates\n\nRank with [references\u002Franking.md](references\u002Franking.md). Prioritize\nentrypoint-reachable, tainted, boundary-adjacent, high-blast-radius, shared\nsink, same-interface, and close-distance candidates. Penalize test, mock,\ngenerated, vendor, unreachable, and trusted-internal-only candidates.\n\n### Step 4: Extract Pattern Guidance\n\nSummarize what should be searched for syntactically and what requires semantic\nreview. Identify whether follow-up belongs in:\n\n- `variant-analysis`\n- `semgrep-rule-creator`\n- `static-analysis` with CodeQL or SARIF-producing tools\n- manual review\n\n### Step 5: Emit Handoff Packet\n\nUse [references\u002Foutput-format.md](references\u002Foutput-format.md). Include\nranked candidates, inclusion reasons, exclusions, limitations, and the\nvariant-analysis handoff.\n\n## Stop Conditions\n\n- No graph binding exists\n- Candidate count is too high and the root cause is underspecified\n- Trailmark cannot analyze the target language\n- The seed is only in test, generated, or vendor code and the user did not say\n  that code is in scope\n",{"data":39,"body":46},{"name":4,"description":6,"allowed-tools":40},[41,42,43,44,45],"Bash","Read","Grep","Glob","Write",{"type":47,"children":48},"root",[49,57,63,70,120,126,161,167,290,296,308,315,328,333,339,352,390,395,401,413,419,424,458,464,476,482],{"type":50,"tag":51,"props":52,"children":53},"element","h1",{"id":4},[54],{"type":55,"value":56},"text","Trailmark Variant Neighborhood",{"type":50,"tag":58,"props":59,"children":60},"p",{},[61],{"type":55,"value":62},"Expand one seed issue into graph-derived variant candidates. This skill\ngenerates review targets, not confirmed findings.",{"type":50,"tag":64,"props":65,"children":67},"h2",{"id":66},"when-to-use",[68],{"type":55,"value":69},"When to Use",{"type":50,"tag":71,"props":72,"children":73},"ul",{},[74,80,85,90],{"type":50,"tag":75,"props":76,"children":77},"li",{},[78],{"type":55,"value":79},"A finding is confirmed or plausible and variants may exist",{"type":50,"tag":75,"props":81,"children":82},{},[83],{"type":55,"value":84},"The vulnerable pattern depends on call context",{"type":50,"tag":75,"props":86,"children":87},{},[88],{"type":55,"value":89},"The issue involves a shared sink, source, validator, interface, override,\ntrait, hook, handler, adapter, or critical type",{"type":50,"tag":75,"props":91,"children":92},{},[93,95,102,104,110,112,118],{"type":55,"value":94},"The next step is to seed ",{"type":50,"tag":96,"props":97,"children":99},"code",{"className":98},[],[100],{"type":55,"value":101},"variant-analysis",{"type":55,"value":103},", ",{"type":50,"tag":96,"props":105,"children":107},{"className":106},[],[108],{"type":55,"value":109},"semgrep-rule-creator",{"type":55,"value":111},",\n",{"type":50,"tag":96,"props":113,"children":115},{"className":114},[],[116],{"type":55,"value":117},"static-analysis",{"type":55,"value":119},", or manual review",{"type":50,"tag":64,"props":121,"children":123},{"id":122},"when-not-to-use",[124],{"type":55,"value":125},"When NOT to Use",{"type":50,"tag":71,"props":127,"children":128},{},[129,134,146,151,156],{"type":50,"tag":75,"props":130,"children":131},{},[132],{"type":55,"value":133},"No seed issue exists. Use discovery or triage first.",{"type":50,"tag":75,"props":135,"children":136},{},[137,139,144],{"type":55,"value":138},"The pattern is purely syntactic and already obvious. Use\n",{"type":50,"tag":96,"props":140,"children":142},{"className":141},[],[143],{"type":55,"value":109},{"type":55,"value":145}," directly.",{"type":50,"tag":75,"props":147,"children":148},{},[149],{"type":55,"value":150},"The question is exploit-chain composition across multiple findings. Use a\ncomposition workflow.",{"type":50,"tag":75,"props":152,"children":153},{},[154],{"type":55,"value":155},"The goal is remediation verification. Use a remediation-review workflow.",{"type":50,"tag":75,"props":157,"children":158},{},[159],{"type":55,"value":160},"The seed cannot be bound to a graph node.",{"type":50,"tag":64,"props":162,"children":164},{"id":163},"rationalizations-to-reject",[165],{"type":55,"value":166},"Rationalizations to Reject",{"type":50,"tag":168,"props":169,"children":170},"table",{},[171,195],{"type":50,"tag":172,"props":173,"children":174},"thead",{},[175],{"type":50,"tag":176,"props":177,"children":178},"tr",{},[179,185,190],{"type":50,"tag":180,"props":181,"children":182},"th",{},[183],{"type":55,"value":184},"Rationalization",{"type":50,"tag":180,"props":186,"children":187},{},[188],{"type":55,"value":189},"Why It Is Wrong",{"type":50,"tag":180,"props":191,"children":192},{},[193],{"type":55,"value":194},"Required Action",{"type":50,"tag":196,"props":197,"children":198},"tbody",{},[199,218,236,254,272],{"type":50,"tag":176,"props":200,"children":201},{},[202,208,213],{"type":50,"tag":203,"props":204,"children":205},"td",{},[206],{"type":55,"value":207},"\"Nearby code means variant\"",{"type":50,"tag":203,"props":209,"children":210},{},[211],{"type":55,"value":212},"Proximity is only a candidate reason",{"type":50,"tag":203,"props":214,"children":215},{},[216],{"type":55,"value":217},"Rank it as a review target",{"type":50,"tag":176,"props":219,"children":220},{},[221,226,231],{"type":50,"tag":203,"props":222,"children":223},{},[224],{"type":55,"value":225},"\"Only exact same names matter\"",{"type":50,"tag":203,"props":227,"children":228},{},[229],{"type":55,"value":230},"Variants often share sinks or preconditions, not names",{"type":50,"tag":203,"props":232,"children":233},{},[234],{"type":55,"value":235},"Expand across callers, callees, interfaces, and types",{"type":50,"tag":176,"props":237,"children":238},{},[239,244,249],{"type":50,"tag":203,"props":240,"children":241},{},[242],{"type":55,"value":243},"\"Every candidate is a finding\"",{"type":50,"tag":203,"props":245,"children":246},{},[247],{"type":55,"value":248},"This skill outputs candidates for review",{"type":50,"tag":203,"props":250,"children":251},{},[252],{"type":55,"value":253},"Avoid vulnerability claims",{"type":50,"tag":176,"props":255,"children":256},{},[257,262,267],{"type":50,"tag":203,"props":258,"children":259},{},[260],{"type":55,"value":261},"\"Unreachable candidates can be ignored completely\"",{"type":50,"tag":203,"props":263,"children":264},{},[265],{"type":55,"value":266},"They may become reachable after refactors",{"type":50,"tag":203,"props":268,"children":269},{},[270],{"type":55,"value":271},"Rank lower or list as deferred",{"type":50,"tag":176,"props":273,"children":274},{},[275,280,285],{"type":50,"tag":203,"props":276,"children":277},{},[278],{"type":55,"value":279},"\"Graph candidates replace semantic pattern work\"",{"type":50,"tag":203,"props":281,"children":282},{},[283],{"type":55,"value":284},"Graph structure finds locations, not root-cause semantics",{"type":50,"tag":203,"props":286,"children":287},{},[288],{"type":55,"value":289},"Hand off to variant-analysis, Semgrep, CodeQL, or manual review",{"type":50,"tag":64,"props":291,"children":293},{"id":292},"workflow",[294],{"type":55,"value":295},"Workflow",{"type":50,"tag":297,"props":298,"children":302},"pre",{"className":299,"code":301,"language":55},[300],"language-text","Variant Neighborhood Progress:\n- [ ] Step 1: Normalize and bind the seed\n- [ ] Step 2: Expand graph neighborhoods\n- [ ] Step 3: Rank candidates\n- [ ] Step 4: Extract variant pattern guidance\n- [ ] Step 5: Emit handoff packet\n",[303],{"type":50,"tag":96,"props":304,"children":306},{"__ignoreMap":305},"",[307],{"type":55,"value":301},{"type":50,"tag":309,"props":310,"children":312},"h3",{"id":311},"step-1-normalize-and-bind-the-seed",[313],{"type":55,"value":314},"Step 1: Normalize And Bind The Seed",{"type":50,"tag":58,"props":316,"children":317},{},[318,320,326],{"type":55,"value":319},"Accept finding text, file\u002Fline, function name, or output from\n",{"type":50,"tag":96,"props":321,"children":323},{"className":322},[],[324],{"type":55,"value":325},"trailmark-finding-triage",{"type":55,"value":327},". Bind the seed to a Trailmark node and record the\nroot cause in plain language.",{"type":50,"tag":58,"props":329,"children":330},{},[331],{"type":55,"value":332},"If the seed has no concrete graph binding, stop before inventing variants.",{"type":50,"tag":309,"props":334,"children":336},{"id":335},"step-2-expand-neighborhoods",[337],{"type":55,"value":338},"Step 2: Expand Neighborhoods",{"type":50,"tag":58,"props":340,"children":341},{},[342,344,350],{"type":55,"value":343},"Use the dimensions in\n",{"type":50,"tag":345,"props":346,"children":348},"a",{"href":347},"references\u002Fneighborhood-patterns.md",[349],{"type":55,"value":347},{"type":55,"value":351},":",{"type":50,"tag":71,"props":353,"children":354},{},[355,360,365,370,375,380,385],{"type":50,"tag":75,"props":356,"children":357},{},[358],{"type":55,"value":359},"shared callers",{"type":50,"tag":75,"props":361,"children":362},{},[363],{"type":55,"value":364},"shared callees and sinks",{"type":50,"tag":75,"props":366,"children":367},{},[368],{"type":55,"value":369},"entrypoint path neighbors",{"type":50,"tag":75,"props":371,"children":372},{},[373],{"type":55,"value":374},"interface, override, trait, and implementation siblings",{"type":50,"tag":75,"props":376,"children":377},{},[378],{"type":55,"value":379},"file or module cluster neighbors",{"type":50,"tag":75,"props":381,"children":382},{},[383],{"type":55,"value":384},"taint or privilege-boundary peers",{"type":50,"tag":75,"props":386,"children":387},{},[388],{"type":55,"value":389},"type and state-reference neighbors",{"type":50,"tag":58,"props":391,"children":392},{},[393],{"type":55,"value":394},"Bound expansion to avoid candidate floods.",{"type":50,"tag":309,"props":396,"children":398},{"id":397},"step-3-rank-candidates",[399],{"type":55,"value":400},"Step 3: Rank Candidates",{"type":50,"tag":58,"props":402,"children":403},{},[404,406,411],{"type":55,"value":405},"Rank with ",{"type":50,"tag":345,"props":407,"children":409},{"href":408},"references\u002Franking.md",[410],{"type":55,"value":408},{"type":55,"value":412},". Prioritize\nentrypoint-reachable, tainted, boundary-adjacent, high-blast-radius, shared\nsink, same-interface, and close-distance candidates. Penalize test, mock,\ngenerated, vendor, unreachable, and trusted-internal-only candidates.",{"type":50,"tag":309,"props":414,"children":416},{"id":415},"step-4-extract-pattern-guidance",[417],{"type":55,"value":418},"Step 4: Extract Pattern Guidance",{"type":50,"tag":58,"props":420,"children":421},{},[422],{"type":55,"value":423},"Summarize what should be searched for syntactically and what requires semantic\nreview. Identify whether follow-up belongs in:",{"type":50,"tag":71,"props":425,"children":426},{},[427,435,443,453],{"type":50,"tag":75,"props":428,"children":429},{},[430],{"type":50,"tag":96,"props":431,"children":433},{"className":432},[],[434],{"type":55,"value":101},{"type":50,"tag":75,"props":436,"children":437},{},[438],{"type":50,"tag":96,"props":439,"children":441},{"className":440},[],[442],{"type":55,"value":109},{"type":50,"tag":75,"props":444,"children":445},{},[446,451],{"type":50,"tag":96,"props":447,"children":449},{"className":448},[],[450],{"type":55,"value":117},{"type":55,"value":452}," with CodeQL or SARIF-producing tools",{"type":50,"tag":75,"props":454,"children":455},{},[456],{"type":55,"value":457},"manual review",{"type":50,"tag":309,"props":459,"children":461},{"id":460},"step-5-emit-handoff-packet",[462],{"type":55,"value":463},"Step 5: Emit Handoff Packet",{"type":50,"tag":58,"props":465,"children":466},{},[467,469,474],{"type":55,"value":468},"Use ",{"type":50,"tag":345,"props":470,"children":472},{"href":471},"references\u002Foutput-format.md",[473],{"type":55,"value":471},{"type":55,"value":475},". Include\nranked candidates, inclusion reasons, exclusions, limitations, and the\nvariant-analysis handoff.",{"type":50,"tag":64,"props":477,"children":479},{"id":478},"stop-conditions",[480],{"type":55,"value":481},"Stop Conditions",{"type":50,"tag":71,"props":483,"children":484},{},[485,490,495,500],{"type":50,"tag":75,"props":486,"children":487},{},[488],{"type":55,"value":489},"No graph binding exists",{"type":50,"tag":75,"props":491,"children":492},{},[493],{"type":55,"value":494},"Candidate count is too high and the root cause is underspecified",{"type":50,"tag":75,"props":496,"children":497},{},[498],{"type":55,"value":499},"Trailmark cannot analyze the target language",{"type":50,"tag":75,"props":501,"children":502},{},[503],{"type":55,"value":504},"The seed is only in test, generated, or vendor code and the user did not say\nthat code is in scope",{"items":506,"total":600},[507,522,532,550,565,578,590],{"slug":508,"name":508,"fn":509,"description":510,"org":511,"tags":512,"stars":26,"repoUrl":27,"updatedAt":521},"address-sanitizer","detect memory errors during fuzzing","AddressSanitizer detects memory errors during fuzzing. Use when fuzzing C\u002FC++ code to find buffer overflows and use-after-free bugs.\n",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[513,516,517,518],{"name":514,"slug":515,"type":16},"C#","c",{"name":24,"slug":25,"type":16},{"name":14,"slug":15,"type":16},{"name":519,"slug":520,"type":16},"Testing","testing","2026-07-17T06:05:14.925095",{"slug":523,"name":523,"fn":524,"description":525,"org":526,"tags":527,"stars":26,"repoUrl":27,"updatedAt":531},"aflpp","perform multi-core fuzzing of C\u002FC++ projects","AFL++ is a fork of AFL with better fuzzing performance and advanced features. Use for multi-core fuzzing of C\u002FC++ projects.\n",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[528,529,530],{"name":514,"slug":515,"type":16},{"name":14,"slug":15,"type":16},{"name":519,"slug":520,"type":16},"2026-07-17T06:05:12.433192",{"slug":533,"name":533,"fn":534,"description":535,"org":536,"tags":537,"stars":26,"repoUrl":27,"updatedAt":549},"agentic-actions-auditor","audit GitHub Actions for security vulnerabilities","Audits GitHub Actions workflows for security vulnerabilities in AI agent integrations including Claude Code Action, Gemini CLI, OpenAI Codex, and GitHub AI Inference. Detects attack vectors where attacker-controlled input reaches AI agents running in CI\u002FCD pipelines, including env var intermediary patterns, direct expression injection, dangerous sandbox configurations, and wildcard user allowlists. Use when reviewing workflow files that invoke AI coding agents, auditing CI\u002FCD pipeline security for prompt injection risks, or evaluating agentic action configurations.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[538,541,544,545,548],{"name":539,"slug":540,"type":16},"Agents","agents",{"name":542,"slug":543,"type":16},"CI\u002FCD","ci-cd",{"name":21,"slug":22,"type":16},{"name":546,"slug":547,"type":16},"GitHub Actions","github-actions",{"name":14,"slug":15,"type":16},"2026-07-18T05:47:48.564744",{"slug":551,"name":551,"fn":552,"description":553,"org":554,"tags":555,"stars":26,"repoUrl":27,"updatedAt":564},"algorand-vulnerability-scanner","scan Algorand smart contracts for vulnerabilities","Scans Algorand smart contracts for 11 common vulnerabilities including rekeying attacks, unchecked transaction fees, missing field validations, and access control issues. Use when auditing Algorand projects (TEAL\u002FPyTeal).",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[556,559,560,561],{"name":557,"slug":558,"type":16},"Audit","audit",{"name":21,"slug":22,"type":16},{"name":14,"slug":15,"type":16},{"name":562,"slug":563,"type":16},"Smart Contracts","smart-contracts","2026-07-18T05:47:43.989063",{"slug":566,"name":566,"fn":567,"description":568,"org":569,"tags":570,"stars":26,"repoUrl":27,"updatedAt":577},"ask-questions-if-underspecified","clarify requirements before implementation","Clarify requirements before implementing. Use when serious doubts arise.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[571,574],{"name":572,"slug":573,"type":16},"Engineering","engineering",{"name":575,"slug":576,"type":16},"Productivity","productivity","2026-07-17T06:05:33.543262",{"slug":579,"name":579,"fn":580,"description":581,"org":582,"tags":583,"stars":26,"repoUrl":27,"updatedAt":589},"atheris","fuzz Python code with Atheris","Atheris is a coverage-guided Python fuzzer based on libFuzzer. Use for fuzzing pure Python code and Python C extensions.\n",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[584,587,588],{"name":585,"slug":586,"type":16},"Python","python",{"name":14,"slug":15,"type":16},{"name":519,"slug":520,"type":16},"2026-07-17T06:05:14.575191",{"slug":591,"name":591,"fn":592,"description":593,"org":594,"tags":595,"stars":26,"repoUrl":27,"updatedAt":599},"audit-augmentation","augment code graphs with audit findings","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.\n",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[596,597,598],{"name":557,"slug":558,"type":16},{"name":21,"slug":22,"type":16},{"name":14,"slug":15,"type":16},"2026-08-01T05:44:54.920542",77,{"items":602,"total":706},[603,610,616,624,631,636,642,648,661,672,684,695],{"slug":508,"name":508,"fn":509,"description":510,"org":604,"tags":605,"stars":26,"repoUrl":27,"updatedAt":521},{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[606,607,608,609],{"name":514,"slug":515,"type":16},{"name":24,"slug":25,"type":16},{"name":14,"slug":15,"type":16},{"name":519,"slug":520,"type":16},{"slug":523,"name":523,"fn":524,"description":525,"org":611,"tags":612,"stars":26,"repoUrl":27,"updatedAt":531},{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[613,614,615],{"name":514,"slug":515,"type":16},{"name":14,"slug":15,"type":16},{"name":519,"slug":520,"type":16},{"slug":533,"name":533,"fn":534,"description":535,"org":617,"tags":618,"stars":26,"repoUrl":27,"updatedAt":549},{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[619,620,621,622,623],{"name":539,"slug":540,"type":16},{"name":542,"slug":543,"type":16},{"name":21,"slug":22,"type":16},{"name":546,"slug":547,"type":16},{"name":14,"slug":15,"type":16},{"slug":551,"name":551,"fn":552,"description":553,"org":625,"tags":626,"stars":26,"repoUrl":27,"updatedAt":564},{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[627,628,629,630],{"name":557,"slug":558,"type":16},{"name":21,"slug":22,"type":16},{"name":14,"slug":15,"type":16},{"name":562,"slug":563,"type":16},{"slug":566,"name":566,"fn":567,"description":568,"org":632,"tags":633,"stars":26,"repoUrl":27,"updatedAt":577},{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[634,635],{"name":572,"slug":573,"type":16},{"name":575,"slug":576,"type":16},{"slug":579,"name":579,"fn":580,"description":581,"org":637,"tags":638,"stars":26,"repoUrl":27,"updatedAt":589},{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[639,640,641],{"name":585,"slug":586,"type":16},{"name":14,"slug":15,"type":16},{"name":519,"slug":520,"type":16},{"slug":591,"name":591,"fn":592,"description":593,"org":643,"tags":644,"stars":26,"repoUrl":27,"updatedAt":599},{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[645,646,647],{"name":557,"slug":558,"type":16},{"name":21,"slug":22,"type":16},{"name":14,"slug":15,"type":16},{"slug":649,"name":649,"fn":650,"description":651,"org":652,"tags":653,"stars":26,"repoUrl":27,"updatedAt":660},"audit-context-building","build architectural context for code analysis","Enables ultra-granular, line-by-line code analysis to build deep architectural context before vulnerability or bug finding.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[654,657,658,659],{"name":655,"slug":656,"type":16},"Architecture","architecture",{"name":557,"slug":558,"type":16},{"name":21,"slug":22,"type":16},{"name":572,"slug":573,"type":16},"2026-07-18T05:47:40.122449",{"slug":662,"name":662,"fn":663,"description":664,"org":665,"tags":666,"stars":26,"repoUrl":27,"updatedAt":671},"audit-prep-assistant","prepare codebases for security audits","Prepares codebases for security review using Trail of Bits' checklist. Helps set review goals, runs static analysis tools, increases test coverage, removes dead code, ensures accessibility, and generates documentation (flowcharts, user stories, inline comments).",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[667,668,669,670],{"name":557,"slug":558,"type":16},{"name":21,"slug":22,"type":16},{"name":572,"slug":573,"type":16},{"name":14,"slug":15,"type":16},"2026-07-18T05:47:39.210985",{"slug":673,"name":673,"fn":674,"description":675,"org":676,"tags":677,"stars":26,"repoUrl":27,"updatedAt":683},"burpsuite-project-parser","parse Burp Suite project files","Searches and explores Burp Suite project files (.burp) from the command line. Use when searching response headers or bodies with regex patterns, extracting security audit findings, dumping proxy history or site map data, or analyzing HTTP traffic captured in a Burp project.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[678,679,682],{"name":557,"slug":558,"type":16},{"name":680,"slug":681,"type":16},"CLI","cli",{"name":14,"slug":15,"type":16},"2026-07-17T06:05:33.198077",{"slug":685,"name":685,"fn":686,"description":687,"org":688,"tags":689,"stars":26,"repoUrl":27,"updatedAt":694},"c-review","audit C and C++ code","Performs comprehensive C\u002FC++ security review for memory corruption, integer overflows, race conditions, and platform-specific vulnerabilities. Use when auditing native C\u002FC++ applications, reviewing daemons or services for memory safety, or hunting integer overflow \u002F use-after-free \u002F race conditions in userspace code.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[690,691,692,693],{"name":557,"slug":558,"type":16},{"name":514,"slug":515,"type":16},{"name":21,"slug":22,"type":16},{"name":14,"slug":15,"type":16},"2026-07-17T06:05:11.333374",{"slug":696,"name":696,"fn":697,"description":698,"org":699,"tags":700,"stars":26,"repoUrl":27,"updatedAt":705},"cairo-vulnerability-scanner","scan Cairo and StarkNet contracts for vulnerabilities","Scans Cairo\u002FStarkNet smart contracts for 6 critical vulnerabilities including felt252 arithmetic overflow, L1-L2 messaging issues, address conversion problems, and signature replay. Use when auditing StarkNet projects.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":11},[701,702,703,704],{"name":557,"slug":558,"type":16},{"name":21,"slug":22,"type":16},{"name":14,"slug":15,"type":16},{"name":562,"slug":563,"type":16},"2026-07-18T05:47:42.84568",111]