Borrowing it
Nothing to install: this file belongs to georgepok/local-llm-mcp-server. Take a copy, put it at the same path in your own repository, and replace the rules that are about this project with yours.
curl -O https://raw.githubusercontent.com/georgepok/local-llm-mcp-server/main/.claude/skills/claim-laddering/SKILL.mdgit clone --depth 1 https://github.com/georgepok/local-llm-mcp-serverWrote 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/georgepok/local-llm-mcp-server/claim-laddering)<a href="https://agentmods.dev/skills/georgepok/local-llm-mcp-server/claim-laddering"><img src="https://agentmods.dev/badge/skills/georgepok/local-llm-mcp-server/claim-laddering/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/georgepok/local-llm-mcp-server/claim-laddering"><img src="https://agentmods.dev/badge/skills/georgepok/local-llm-mcp-server/claim-laddering.svg" alt="Reviewed on agentmods" width="80" 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.1 | $0.00087 | $0.00920 |
| Opus 5.5 | $0.00035 | $0.00368 |
| Sonnet 5.5 | $0.00017 | $0.00184 |
| Haiku 4.5 | $0.00009 | $0.00092 |
Grade A, and why
claim-laddering 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 2mo 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 — 64 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Claim Laddering
Match the strength of the claim to the strength of the evidence. Most research errors here are over-closing (declaring a direction dead) or over-claiming (declaring a capability) from a single run or an unvalidated metric.
The three-rung ladder for a negative result
Before writing "X does not work" / "the route is exhausted", classify which rung you are on:
- Not measured — the test crashed, the control failed, the metric was an artifact, the encoding was illegible, the loss was diluted, or the baseline was contaminated. This is a MEASUREMENT failure. You have learned nothing about X. Fix and re-run.
- Optimization failure — under THIS objective/data/scale, training found a degenerate or shortcut solution (mode collapse, constant bias, memorization). X might work under a different signal. Claim only: "under objective O at scale N, the model learned ."
- Fundamental limit — even a control that DIRECTLY forces the target behavior (e.g. a contrastive/oracle objective) cannot produce it, across seeds and a fair positive control. Only here may you write "X cannot do Y in this regime", and still scope it (n, seeds, model).
Do not jump to rung 3 from rung 1 or 2. A debunked positive returns you to "not measured", NOT to the opposite negative — retract in both directions.
Requirements before a STRONG claim (either sign)
- Content/causal control passed (see
causal-experiment-controls): the effect survives input-scrambling; the metric is not label frequency. - Robustness package: ≥2 seeds, a fair positive control, and either a scale or layer/config sweep. One breakthrough run + one control = signal, not proof.
- Ceiling and floor named: report the trivial baseline (floor) and the information-in-context / oracle result (ceiling); locate the claim between them.
- Scope stated: task, n, seeds, model, and what was NOT tested.
Never close a search space
A negative result narrows the space; it does not exhaust it. Whenever you report a failure, name the next distinct variant (different objective, injection point, representation, adaptation, or environment) and why it could differ. "Architecture/approach doesn't help" is a meaningless framing — architectures are choices in a search, not binary theorems.
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.
- 2mo ago First seen · 64 lines · 87 tokens per session scan A a22d6d52a044
claim-laddering is a skill published in the GitHub repository georgepok/local-llm-mcp-server (0 stars, last pushed 3mo ago), licensed MIT. It adds 87 tokens to every session and 920 once invoked, about $0.0003 per session on Opus 5.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-01.
claim-laddering compared with skills from other repositories
| Mod | Type | Stars | Last push | Licence | Scan | Tokens | Works with |
|---|---|---|---|---|---|---|---|
| claim-ladderinggeorgepok/local-llm-mcp-server | Skill | 0 | 3mo ago | MIT | A | 87 | Claude Code |
| instrument-data-to-allotropeanthropics/knowledge-work-plugins | Skill | 35k | 2d ago | Apache-2.0 | A | 123 | Claude Code |
| exploratory-data-analysisK-Dense-AI/scientific-agent-skills | Skill | 56k | 4d ago | MIT | A | 83 | Claude Code |
| matlabK-Dense-AI/scientific-agent-skills | Skill | 56k | 4d ago | MIT | A | 44 | Claude Code |
| phylogeneticsK-Dense-AI/scientific-agent-skills | Skill | 56k | 4d ago | MIT | A | 71 | Claude Code, Codex |
| research-engineerdavila7/claude-code-templates | Skill | 33k | yesterday | MIT | A | 43 | Claude Code, Codex |
| mapping-to-snomedmaziyarpanahi/openmed | Skill | 5.8k | yesterday | Apache-2.0 | A | 205 | Claude Code |