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 bibinprathap/VeritasGraph --skill reasongit clone --depth 1 https://github.com/bibinprathap/VeritasGraphWrote 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/bibinprathap/veritasgraph/reason)<a href="https://agentmods.dev/skills/bibinprathap/veritasgraph/reason"><img src="https://agentmods.dev/badge/skills/bibinprathap/veritasgraph/reason/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/bibinprathap/veritasgraph/reason"><img src="https://agentmods.dev/badge/skills/bibinprathap/veritasgraph/reason.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.00000 | $0.01329 |
| Opus 5.5 | $0.00000 | $0.00532 |
| Sonnet 5.5 | $0.00000 | $0.00266 |
| Haiku 4.5 | $0.00000 | $0.00133 |
Grade A, and why
reason 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 1mo 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.
This is a copy
88% identical to reason — 24 lines differ, which has more behind it and is treated as the original. This page carries a canonical link to it rather than competing with it.
How it starts
The opening of the file, as written. The whole thing — 202 lines — stays where its author put it; the contents beside it link to each section on GitHub.
/veritasreason:reason
Apply reasoning over the knowledge graph. Usage: /veritasreason:reason <mode> [args]
$ARGUMENTS = reasoning mode + rules/observations/query.
deductive [--facts '<json-list>'] [--rules '<rule1>|<rule2>']
Apply deductive rules to known facts to derive new conclusions.
from veritasreason.reasoning.deductive_reasoner import DeductiveReasoner, Premise
reasoner = DeductiveReasoner()
# Add base facts to working memory
# Facts can be strings like "Person(John)" or structured dicts
import json
facts = json.loads(facts_json) if facts_json else []
reasoner.add_facts(facts)
# Apply logic with explicit premises
# Premise objects have: statement, confidence, source
premises = [
Premise(statement=fact, confidence=1.0)
for fact in facts
]
conclusions = reasoner.apply_logic(premises=premises)
Return: | Conclusion | Triggering Premises | Confidence | Rule Applied |
If zero rules given, run reasoner.prove_theorem() on any provided theorem:
proof = reasoner.prove_theorem(theorem=theorem_text)
Output: Proof: <proof.steps> | Valid: YES / NO
prove <theorem> [--facts '<json-list>']
Prove or disprove a theorem against known facts.
from veritasreason.reasoning.deductive_reasoner import DeductiveReasoner
reasoner = DeductiveReasoner()
import json
reasoner.add_facts(json.loads(facts_json) if facts_json else [])
proof = reasoner.prove_theorem(theorem=theorem)
Output:
Theorem: "<theorem>"
Result: PROVED ✓ | DISPROVED ✗ | UNDECIDABLE ⚠
Proof steps:
1. <premise> — <justification>
2. ...
→ QED: <theorem>
Confidence: <proof.confidence>
abductive <observation> [--knowledge '<json-list>'] [--top N]
Generate and rank hypotheses that explain an observation.
from veritasreason.reasoning.abductive_reasoner import (
AbductiveReasoner, Observation
)
reasoner = AbductiveReasoner()
import json
if knowledge_json:
reasoner.add_knowledge(json.loads(knowledge_json))
obs = Observation(description=observation)
# Generate all hypotheses then rank them
hypotheses = reasoner.generate_hypotheses(observations=[obs])
ranked = reasoner.rank_hypotheses(hypotheses)
best = reasoner.get_best_explanation(obs)
# Also get full explanations with evidence
explanations = reasoner.find_explanations(observations=[obs])
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.
- 1mo ago First seen · 202 lines · 0 tokens per session scan A 42b897f3e165
reason is a skill published in the GitHub repository bibinprathap/VeritasGraph (326 stars, last pushed today), licensed MIT. It costs nothing until one of its globs matches a file; then it loads 1,329 tokens. A static security scan graded it A with 0 findings. It is 88% identical to reason, differing in 24 lines, and is treated as a copy.
Other skills, from other repositories
huggingface-transformers
Use when running or fine-tuning Hugging Face Transformers models in Python — pipeline() inference for text classification and generation, loading weights with AutoModel/AutoTokenizer, devicemap and dtype memory management, tokenizer usage, Trainer fine-tuning, and BGE embeddings for Chinese RAG. Covers transformers…
document-chunker
Split documents into overlapping token chunks for RAG pipelines and LLM context windows. Zero dependencies.
qdrant
Vector search engine for production RAG systems.
dspy
DSPy: declarative LM programs, auto-optimize prompts, RAG.
chroma
Embedding database for RAG and semantic search.
pinecone
Managed vector DB for production RAG and search.