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 promotion-policiesgit 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/promotion-policies)<a href="https://agentmods.dev/skills/orneryd/nornicdb/promotion-policies"><img src="https://agentmods.dev/badge/skills/orneryd/nornicdb/promotion-policies/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/promotion-policies"><img src="https://agentmods.dev/badge/skills/orneryd/nornicdb/promotion-policies.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.00075 | $0.02764 |
| Opus 5 | $0.00037 | $0.01382 |
| Sonnet 5 | $0.00015 | $0.00553 |
| Haiku 4.5 | $0.00007 | $0.00276 |
Grade A, and why
nornicdb-promotion-policies 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 6d 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 — 235 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Promotion Profiles & Policies (Cypher API)
Promotion is the optional second half of NornicDB's scoring pipeline. Decay handles time-based fade and runs entirely on its own (see nornicdb-knowledge-policies and nornicdb-decay-tuning). Promotion does two distinct things:
- Tracks access —
ON ACCESSmutations write to per-entity access metadata (counters, last-access timestamps, smoothed signals). This is the only mechanism that updates access metadata. - Changes scores conditionally —
WHEN <predicate> APPLY PROFILE '<name>'causes a promotion profile'smultiplier/scoreFloor/scoreCapto be applied to the decayed score when the predicate is true.
These two responsibilities are independent:
- A policy with
ON ACCESSbut noWHENclauses only tracks. Scores are not promoted, butLAST_ACCESSEDdecay bindings on the same target can rely on the tracking. - A policy with
WHENbut noON ACCESSonly promotes. It evaluates predicates against existing properties / metadata at score time. - A policy with both does both.
Two objects
- Promotion profile —
CREATE PROMOTION PROFILE <name> OPTIONS { ... }: a named, untargeted parameter set. Inert until referenced by aWHEN ... APPLY PROFILE '<name>'clause.CREATE PROMOTION PROFILE <name> OPTIONS { multiplier: <float>, -- < 1.0 dampens, > 1.0 boosts, 1.0 neutral scoreFloor: <float>, -- promoted-score floor, applied before scoreCap scoreCap: <float>, -- promoted-score ceiling, applied after multiplier scope: 'NODE' -- NODE | EDGE } - Promotion policy —
CREATE PROMOTION POLICY <name> FOR (...) APPLY { ON ACCESS { ... } WHEN ... APPLY PROFILE '...' }: targets entities withFORand contains the access mutations and/orWHENclauses. TheFORclause uses the same target shapes as decay bindings (label, multi-label, edge type, wildcard).
How promotion enters the score
baseScore = baseDecay(t) // from the decay binding
promoted = baseScore * multiplier // multiplier from the matched WHEN's profile
clampedPromo = min(scoreCap, max(scoreFloor, promoted)) // promotion profile's floor/cap
finalScore = max(decayBindingFloor, clampedPromo) // decay binding's floor (independent)
suppressed = finalScore < visibilityThreshold // decay binding's threshold
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.
- 6d ago First seen · 235 lines · 75 tokens per session scan A 92df0597620c
nornicdb-promotion-policies is a skill published in the GitHub repository orneryd/NornicDB (866 stars, last pushed yesterday), licensed MIT. It adds 75 tokens to every session and 2,764 once invoked, about $0.0004 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-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.
infrahub-sot
OpsMill Infrahub — infrastructure source of truth with schema-driven nodes, GraphQL queries, and branch-isolated changes. Use when querying Infrahub for device/IPAM inventory, browsing infrastructure schemas, running GraphQL queries, or making infrastructure changes safely via an auto-created session branch and a…
dkg-importer
Bulk-import a large RDF graph (code graph, corpus, GitHub history, etc.) into a DKG node's working memory. Use this skill when you need to push more than a few thousand triples in a single import — it codifies the chunking budgets, the assertion-loop shape, the resumability manifest, and the canonical URI rules so…
pydantic-resolve-3step
A three-stage development method for Python projects built with pydantic-resolve, starting with agreed data models and ending with application interfaces. It uses an ER diagram, which shows database entities and their relationships, plus ORM models that represent database records in code.