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.
git clone --depth 1 https://github.com/mathiasbourgoin/rosterWrote 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/commands/mathiasbourgoin/roster/kb-search)<a href="https://agentmods.dev/commands/mathiasbourgoin/roster/kb-search"><img src="https://agentmods.dev/badge/commands/mathiasbourgoin/roster/kb-search/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/commands/mathiasbourgoin/roster/kb-search"><img src="https://agentmods.dev/badge/commands/mathiasbourgoin/roster/kb-search.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.00017 | $0.00798 |
| Opus 5.5 | $0.00007 | $0.00319 |
| Sonnet 5.5 | $0.00003 | $0.00160 |
| Haiku 4.5 | $0.00002 | $0.00080 |
Grade A, and why
kb-search 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.
How it starts
The opening of the file, as written. The whole thing — 83 lines — stays where its author put it; the contents beside it link to each section on GitHub.
KB Search
You perform hybrid semantic and keyword search over the project KB's LanceDB index. Use this skill instead of loading all KB files when searching for a specific concept, term, or constraint.
Prerequisite: kb/.index/ must exist. Run /kb-reindex first if not.
Steps
Step 1 — Pre-condition check
[ -d kb/.index ] && echo "index: present" || echo "index: absent"
If absent:
⛔ No KB index found at
kb/.index/. Run/kb-reindexto build the index first.
Step 2 — Execute hybrid search
Accept:
query(string): the search querytop_k(int, default: 5): number of results to returninclude_all_statuses(bool, default: false): if false, filter outhistoricalandsupersededchunks
Hybrid search algorithm:
-
Vector search: embed
querywith the same model used for indexing. Compute cosine similarity against all chunks inkb_chunks. Retrieve toptop_k * 3candidates. -
Keyword search: tokenize
query. Score each candidate with BM25 against itscontentfield. -
Score fusion: combine vector score (weight 0.7) and BM25 score (weight 0.3). Re-rank by fused score.
-
Status filter: if
include_all_statuses = false, remove chunks wherestatusishistoricalorsuperseded. Apply this as a pre-filter on the vector query (not post-fusion) so thattop_k * 3candidates are drawn only from live-doctrine and derived chunks, ensuringtop_kresults are always available when they exist. -
Return top
top_kresults.
Step 3 — Format results
Return a ranked list:
KB Search Results for: "<query>"
Showing top N results (historical/superseded filtered)
1. [score: 0.92] kb/properties.md § "Invariants"
> "All database writes must be wrapped in explicit transactions..."
Status: live-doctrine
2. [score: 0.87] kb/spec.md § "API Contract"
> "The API must return errors in the format {error: string, code: int}..."
Status: live-doctrine
3. [score: 0.61] kb/architecture.md § "Storage Layer"
> "PostgreSQL is the primary storage backend..."
Status: live-doctrine
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 Changed · -1 lines · -9 tokens per session a52b5358882b
- 1mo ago First seen · 84 lines · 26 tokens per session scan A 0e199b9595b1
kb-search is a command published in the GitHub repository mathiasbourgoin/roster (2 stars, last pushed 2d ago), licensed MIT. It adds 17 tokens to every session and 798 once invoked, about $0.0001 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-07.
Other commands, from other repositories
minutes-ideas
Surface recent voice memos and ideas captured from any device. Use when the user asks "what ideas did I have?", "what were my recent memos?", "what did I record while walking?", or wants to recall a captured thought.
learn
Force claude-smart to extract learnings from this session now.
memory-store
Store an insight, decision, or pattern to memory.
analyze-context
USE WHEN you want to analyze project context before starting work on a task. Calls context + recall, then synthesizes goals, decisions, gotchas, and relevant memories into a pre-task brief.
cc-memory
Configure persistent memory that survives across sessions using a layered approach: split rule files for always-loaded context, auto-memory for organic learning, and optional MCP-backed long-term memory for large codebases.
lians-recall
Recall current (non-stale) facts from Lians memory, optionally as-of a past date.