Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx agentmods add skills/arcadi4/nerdy/np-completenessnpx skills add Arcadi4/nerdy --skill np-completenessgit clone --depth 1 https://github.com/Arcadi4/nerdyWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/arcadi4/nerdy/np-completeness)<a href="https://agentmods.dev/skills/arcadi4/nerdy/np-completeness"><img src="https://agentmods.dev/badge/skills/arcadi4/nerdy/np-completeness.svg" alt="Measured on agentmods" height="20"></a>What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5 | $0.00073 | $0.03679 |
| Opus 5 | $0.00036 | $0.01840 |
| Sonnet 5 | $0.00015 | $0.00736 |
| Haiku 4.5 | $0.00007 | $0.00368 |
Grade A, and why
np-completeness scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 4d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 312 lines — stays where its author put it; the contents beside it link to each section on GitHub.
NP-Completeness
Overview
NP-completeness answers whether an exact polynomial-time algorithm is plausible under the chapter model. Treat every proof as a certificate-and-reduction audit: define the decision language, prove verifiability, reduce from a known hard source in the correct direction, and prove both answer preservation and polynomial construction size.
Core principle: an NP-completeness proof is incomplete unless it separately proves membership in NP, maps arbitrary source instances to target instances without solving them, proves both directions of equivalence, and accounts for encoding length.
Shared CLRS Conventions
- Follow the parent
clrsskill for mathematical formatting: every language definition, reduction relation, asymptotic bound, threshold, and symbolic assignment belongs in display LaTeX blocks. - Keep tables verbal. Put reduction relations, targets, and construction formulas in display blocks near the table instead of inside table cells.
- Use
elementary-graph-algorithmsfor ordinary graph traversal,shortest-pathsfor shortest-path algorithms,linear-programmingfor LP modeling, and this skill when the task asks for NP membership, NP-hardness, reductions, encoding, or exact hardness evidence. - Do not announce that you are using this skill. Deliver the polished classification, reduction, or review directly.
When to Use
Use this skill when a task involves:
- proving a decision problem is in P, in NP, NP-hard, NP-complete, or related to co-NP;
- converting optimization hardness into a bound decision version;
- building or reviewing a polynomial-time reduction;
- choosing among CIRCUIT-SAT, SAT, 3-CNF-SAT, CLIQUE, VERTEX-COVER, HAM-CYCLE, TSP, or SUBSET-SUM as a source problem;
- checking whether a numeric algorithm is pseudo-polynomial rather than polynomial in the input length;
- explaining why an exact polynomial algorithm for one NP-complete problem would imply the standard collapse.
Do not use this skill merely because an algorithm is slow. Use it when the answer must reason about formal decision languages, certificates, reductions, or encoding-sensitive polynomial time.
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 4d ago First seen · 312 lines · 73 tokens per session scan A 797fd5160f8f
np-completeness is a skill published in the GitHub repository Arcadi4/nerdy (7 stars, last pushed 4mo ago), licensed MIT. It adds 73 tokens to every session and 3,679 once invoked, about $0.0004 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.
Other skills, from other repositories
algo-sensei
Your personal DSA & LeetCode mentor. Use for problem explanations, progressive hints, code reviews, mock interviews, pattern recognition, complexity analysis, and custom problem generation. Automatically adapts to your learning style and request type.
campus-dsa-visualizer
Activate when a student, TA, or instructor asks to visualize the execution of a data structure or algorithm rather than just read its code — trigger phrasings include "visualize this binary search tree", "show me how quicksort partitions this array step by step", "trace this BFS/DFS on the whiteboard", "draw the DP…
nerd
Explains any code, system, or flow as ASCII flowcharts that expose the fundamental data structures and algorithms underneath. Use /skill:nerd to get a bird's-eye-view map of how something works, then zoom into any specific algorithm or data structure for a deeper breakdown. Strips jargon, shows the actual machine …
article-writing
Write articles, guides, blog posts, tutorials, newsletter issues, and other long-form content in a distinctive voice derived from supplied examples or brand guidance. Use when the user wants polished written content longer than a paragraph, especially when voice consistency, structure, and credibility matter.
miniapp
Build a tiny interactive HTML playground only when someone asks to see, play with, or step through a mechanism.
eli5
Explain research, papers, or technical ideas in plain English with minimal jargon, concrete analogies, and clear takeaways. Use when the user says "ELI5 this", asks for a simple explanation of a paper or research result, wants jargon removed, or asks what something technically dense actually means.