Continuous-Claude-v3 is a Claude Code development environment that preserves working context between sessions, coordinates specialized agents, and stores project knowledge through ledgers, handoffs, and analysis tools. It is for people using Claude Code on ongoing or complex software work. Its catalogue entries are the skills, agents, hooks, plugin, and setting that provide its workflows and orchestration.
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 skills add parcadei/Continuous-Claude-v3 --skill prime-numbersgit clone --depth 1 https://github.com/parcadei/Continuous-Claude-v3Wrote 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/parcadei/continuous-claude-v3/prime-numbers)<a href="https://agentmods.dev/skills/parcadei/continuous-claude-v3/prime-numbers"><img src="https://agentmods.dev/badge/skills/parcadei/continuous-claude-v3/prime-numbers/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/parcadei/continuous-claude-v3/prime-numbers"><img src="https://agentmods.dev/badge/skills/parcadei/continuous-claude-v3/prime-numbers.svg" alt="Reviewed on agentmods" width="80" height="20"></a>- NVIDIA SkillSpector warn
SkillSpector: 1 finding, up to medium
These are SkillSpector’s own severities. On a checked sample its high-severity flags on skills were ~96% false positives — a documented command, a public API, a “never do X” rule — so we show them as a caution to read, not a verdict. Why →
- medium Agent Snooping · line 70 Skill enumerates or reads other installed skills. Access to other skills' SKILL.md files or the skills directory reveals prompt instructions, capabilities, and secrets that should be invisible to peer skills.Fix: Remove all code or instructions that list or read other skills' files or directories. Skills should operate independently; cross-skill access is a privilege escalation.
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.1 | $0.00014 | $0.00481 |
| Opus 5 | $0.00007 | $0.00241 |
| Sonnet 5 | $0.00003 | $0.00096 |
| Haiku 4.5 | $0.00001 | $0.00048 |
Grade A, and why
prime-numbers 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 9d 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.
What it actually says
Prime Numbers
When to Use
Use this skill when working on prime-numbers problems in graph number theory.
Decision Tree
-
Primality testing hierarchy
- Trial division: O(sqrt(n)), exact
- Miller-Rabin: O(k log^3 n), probabilistic
- AKS: O(log^6 n), deterministic polynomial
-
Factorization
- Trial division for small factors
- Pollard's rho: probabilistic, medium numbers
- Quadratic sieve: large numbers
sympy_compute.py factor "n"
-
Prime distribution
- Prime Number Theorem: pi(x) ~ x/ln(x)
- Prime gaps: p_{n+1} - p_n
sympy_compute.py limit "pi(x) * ln(x) / x"
-
Fermat's Little Theorem
- a^{p-1} = 1 (mod p) for a not divisible by p
- Use for modular exponentiation
z3_solve.py prove "fermat_little"
-
Wilson's Theorem
- (p-1)! = -1 (mod p) iff p is prime
Tool Commands
Sympy_Factor
uv run python -m runtime.harness scripts/sympy_compute.py factor "n"
Z3_Primality
uv run python -m runtime.harness scripts/z3_solve.py prove "no_divisor_between_1_and_sqrt_n"
Sympy_Prime_Count
uv run python -m runtime.harness scripts/sympy_compute.py simplify "pi(x) ~ x/ln(x)"
Z3_Fermat_Little
uv run python -m runtime.harness scripts/z3_solve.py prove "a**(p-1) == 1 mod p"
Key Techniques
From indexed textbooks:
Cognitive Tools Reference
See .claude/skills/math-mode/SKILL.md for full tool documentation.
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.
- 9d ago First seen · 71 lines · 14 tokens per session scan A 68a784896869
prime-numbers is a skill published in the GitHub repository parcadei/Continuous-Claude-v3 (3,938 stars, last pushed 7mo ago), licensed MIT. It adds 14 tokens to every session and 481 once invoked, about $0.0001 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-09-03.
Other skills, from other repositories
tooluniverse-organic-chemistry
Organic chemistry reasoning guide for reaction product prediction, mechanism analysis (electrophilic/nucleophilic substitution, addition, elimination, pericyclic, radical), and spectroscopy interpretation (1H/13C NMR, IR, MS). Reasons from first principles (electron flow, kinetic vs thermodynamic) rather than…
scaffold-exercises
Scaffold a graded problem set with sections, problems, worked solutions, and short "why this matters" explainers across analytical, empirical, and coding types. Use when user says "make a problem set on X", "scaffold exercises for this lecture", "create practice problems", "generate homework with a solution key"…
assess-holistic-health
Conduct temperament-based health assessment from Hildegard von Bingen's Causae et Curae. Evaluates the four temperaments (sanguine, choleric, melancholic, phlegmatic), elemental correspondences (air, fire, earth, water), and provides dietary and lifestyle recommendations for rebalancing. Use when understanding…
analyze-prime-numbers
Analyze prime numbers using primality tests, factorization algorithms, prime distribution analysis, and sieve methods. Covers trial division, Miller-Rabin, Sieve of Eratosthenes, and the Prime Number Theorem. Use when determining whether an integer is prime or composite, finding prime factorizations, counting or…
construct-geometric-figure
Perform a ruler-and-compass construction with step-by-step justification for each operation, producing a constructible geometric figure from given elements. Covers classical Euclidean constructions including perpendicular bisectors, angle bisectors, parallel lines, regular polygons, and tangent lines. Use when given…
derive-theoretical-result
Derive a theoretical result step-by-step from first principles or established theorems, with every step explicitly justified and special cases checked. Use when deriving a formula or theorem from first principles, proving a mathematical statement by logical deduction, re-deriving a textbook result for verification or…