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 orneryd/NornicDB --skill cypher-queriesgit clone --depth 1 https://github.com/orneryd/NornicDBWrote 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/orneryd/nornicdb/cypher-queries)<a href="https://agentmods.dev/skills/orneryd/nornicdb/cypher-queries"><img src="https://agentmods.dev/badge/skills/orneryd/nornicdb/cypher-queries/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/orneryd/nornicdb/cypher-queries"><img src="https://agentmods.dev/badge/skills/orneryd/nornicdb/cypher-queries.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.00079 | $0.05790 |
| Opus 5.5 | $0.00032 | $0.02316 |
| Sonnet 5.5 | $0.00016 | $0.01158 |
| Haiku 4.5 | $0.00008 | $0.00579 |
Grade A, and why
nornicdb-cypher-queries 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 — 620 lines — stays where its author put it; the contents beside it link to each section on GitHub.
NornicDB Cypher Query Shapes (Hot-Path Cookbook)
NornicDB has a set of Cypher patterns that the executor recognizes and routes through specialized hot paths. Writing your queries to match these shapes is the single biggest lever for predictable latency. Outside of these shapes you still get correct results, but you fall onto the generic per-row path.
This skill is a menu of proven shapes plus the rules that decide whether the executor accepts them. The full reference with explanatory commentary lives at docs/performance/hot-path-query-cookbook.md.
Generic schema used in examples
- Node labels:
EntityA,EntityB,Tenant,Event - Relationship types:
KEY_REL,BELONGS_TO,LINKS_TO - Properties:
primaryKey,alternateKey,tenantId,category,status,createdAt,updatedAt,sessionId
Substitute your own labels/types/properties. The shapes do not depend on the names.
Recommended baseline indexes & constraints
CREATE CONSTRAINT entitya_primarykey_uniq IF NOT EXISTS FOR (n:EntityA) REQUIRE n.primaryKey IS UNIQUE;
CREATE INDEX entitya_alternatekey_idx IF NOT EXISTS FOR (n:EntityA) ON (n.alternateKey);
CREATE INDEX entitya_tenantid_idx IF NOT EXISTS FOR (n:EntityA) ON (n.tenantId);
CREATE INDEX entityb_category_status_createdat_idx IF NOT EXISTS FOR (n:EntityB) ON (n.category, n.status, n.createdAt);
CREATE INDEX entityb_tenantid_idx IF NOT EXISTS FOR (n:EntityB) ON (n.tenantId);
CREATE INDEX event_createdat_idx IF NOT EXISTS FOR (e:Event) ON (e.createdAt);
Composite index order matters — list the index columns in the same order the query uses for filtering and sorting.
1. Point lookup & existence
Upsert, then read by stable key
MERGE (n:EntityA {primaryKey: $primaryKey})
SET n.payload = $payload, n.updatedAt = $now;
MATCH (n:EntityA {primaryKey: $primaryKey})
RETURN n
LIMIT 1;
Lookup by either of two keys (OR → UNION)
CALL {
WITH $lookupKey AS k
MATCH (n:EntityA {primaryKey: k}) RETURN n
UNION
WITH $lookupKey AS k
MATCH (n:EntityA {alternateKey: k}) RETURN n
}
RETURN n
LIMIT 1;
Always prefer this over a single WHERE n.primaryKey = $k OR n.alternateKey = $k predicate — the executor cannot use indexes through cross-property OR.
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 · 620 lines · 79 tokens per session scan A 45ea5e755936
nornicdb-cypher-queries is a skill published in the GitHub repository orneryd/NornicDB (917 stars, last pushed today), licensed MIT. It adds 79 tokens to every session and 5,790 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-05.
Other skills, from other repositories
payload
Use when working with Payload projects (payload.config.ts, collections, fields, hooks, access control, Payload API). Use when debugging validation errors, security issues, relationship queries, transactions, or hook behavior.
graphjin-eval
Create, extend, run, baseline, and diagnose GraphJin agent evaluations through the graphjin eval CLI.
graphjin-env
Use when setting up a training or evaluation loop against a GraphJin agent environment — running the container, reading /health, driving episodes hosted or step-by-step or with your own agent over MCP, splitting train from eval, exporting trajectories, and deciding whether two rewards can be compared.
deduplicate
Detect duplicate entities, duplicate groups, and relationship duplicates in VeritasReason using fuzzy matching, schema heuristics, and graph similarity.
change
Track and inspect graph changes, diffs, temporal updates, and the impact of new data on VeritasReason knowledge graphs.
query
Query the VeritasReason knowledge graph using SPARQL, Cypher, keyword search, and structured graph query patterns.