repovine-workflow

repovine-workflow is a cursor rule for Cursor from legann/repovine. It costs 14 tokens per session (2,307 once invoked), scanned A, original, MIT.

A repository-navigation workflow based on three stages: orienting with search, mapping the codebase, and inspecting specific files or modules. It also defines checks for using repository annotations during implementation.

In plain words
What is it for?
Use it to find relevant code, understand repository structure, inspect modules and entry points, trace service flows, and apply annotation-related checks.
Why use it?
It helps agents narrow their investigation systematically before editing code and reduces the chance of acting on weak or incomplete matches. It keeps implementation delegation separate from navigation.

Cursor rule for Cursor

Install

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.

agentmods
npx agentmods add rules/legann/repovine/repovine-workflow
Clone the repo
git clone --depth 1 https://github.com/legann/repovine

Made for: Cursor.

Wrote 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.

agentmods badge for repovine-workflow

README.md
[![agentmods](https://agentmods.dev/badge/rules/legann/repovine/repovine-workflow.svg)](https://agentmods.dev/rules/legann/repovine/repovine-workflow)
Your own site
<a href="https://agentmods.dev/rules/legann/repovine/repovine-workflow"><img src="https://agentmods.dev/badge/rules/legann/repovine/repovine-workflow.svg" alt="Measured on agentmods" height="20"></a>
Per session 14 Only the description is in the session, so the agent can decide to use it. The body loads when it is invoked.
When invoked 2,307 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. Scan, not verified.
Origin original No closer match found in the catalogue.
Token cost

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.

ModelPer sessionOnce invoked
Fable 5 $0.00014 $0.02307
Opus 5 $0.00007 $0.01154
Sonnet 5 $0.00003 $0.00461
Haiku 4.5 $0.00001 $0.00231

Measured 3d ago against content hash ad194e1de84b, method: parsed. Prices are Anthropic first-party input rates as of 2026-08-30, from the pricing page.

Security

Grade A, and why

repovine-workflow 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 3d 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.

.cursor/rules/repovine-workflow.mdc · 79 lines

How it starts

The opening of the file, as written. The whole thing — 79 lines — stays where its author put it; the contents beside it link to each section on GitHub.

repovine -- Navigation Workflow

The narrowing loop

Use the public tools as a flexible context loop. You can go deep, branch sideways, return up, or jump cross-layer.

  1. Orient: search_context({ "query": "...", "match": "auto", "limit": 15 }) — default match is auto (AND then bounded OR). Use match: "and" when you need every token on one node; use match: "or" only when you intentionally want per-token union (may surface weak tokens like package/route). Filter with types and tune breadth with perTokenLimit. Before inspect_node, read result.matches.strategy (used, relaxedFrom, strongTokens, weakTokenOnlySuppressed), gaps, summary, confidence, and topResults[].matchedTokenCount — OR-relax hits omit emptyDiagnostic and are not strong anchors when relaxedFrom: "and" with low matchedTokenCount or confidence: "low".
  2. Map: map_context({ "scope": "...", "view": "summary" })
  3. Inspect: inspect_node({ "nodeId": "mod:pkg/path/module", "exportLimit": 20 })
  4. Annotation constraints: when implementation will touch inspected nodes, apply this checkpoint before editing:

Annotations hint and constrain; they do not bound inspect scope. Locality: annotation on nodeId X is evidence about X only — not about other nodeIds, including mod: refs in integrationPoints, links, or drillDown. Absence: no annotation and no inspect_node on a nodeId means no conclusion about that node. Unchanged: stating a nodeId is unchanged, verified, or already-correct requires inspect_node on that nodeId in this session. Closure: before leaving related nodes unedited, follow links, navigation.*, and task-relevant integrationPoints mod: refs. Boundary or discovery tasks (find every surface exposing an affordance class) inspect the affordance-class consumers/importers before treating them unchanged — breadth is the task. Refactor or architecture tasks bound closure with one analyze_dependencies impact pass and need not inspect every ref. Investigate channel: a links/drillDown/investigatePointers ref returned with investigate is must-inspect; inspect that node and close the flag as fixed or scoped-out with a code citation before reporting this node unchanged. Tags: risk (consumer-scoped risk on the target), boundary (off-limits surface — published contract, frozen migration, or structural slot — not edited in place), effect (target declares a persistent side effect), wiring (deployed runtime topology dispatches into or binds from the target), co-change (implements relation — contract and implementations move together), hub (target has many importers; impact-check before editing). Same-node citation: that code citation must be on the affordance path of the flagged node itself; gating by a sibling control, a parent or badge, or a different mount does not close the flag unless this affordance is shown to route through that gate. Enumerate-before-unchanged: reviewing a node means listing each mutation affordance, exported action, and protected side effect on it (mutation = anything that creates, changes, or removes state — including but not limited to writes, deletes, dispatches, and lifecycle callbacks) with its capability gate; a single gated affordance does not close a multi-affordance node — affordanceCount reports how many to enumerate. These are floors, not ceilings: the investigate tags and affordanceCount are minimums to check, their absence is not absence of work, and closing every delivered flag or enumerating one node is per-node completeness, never task completeness. Derived flags: a capability, permission, or feature flag is consumed at mount and render predicates and at importers, not only the hook that derives it — boundary tasks inspect those consumers. Weak context: while confidence is low, gaps is non-empty, or emptyDiagnostic is present, the scope is not complete.

Read the full file on GitHub · 79 lines

Changes

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.

  1. 3d ago First seen · 79 lines · 14 tokens per session scan A ad194e1de84b

Subscribe to this mod's changes

repovine-workflow is a cursor rule published in the GitHub repository legann/repovine (0 stars, last pushed 1mo ago), licensed MIT. It adds 14 tokens to every session and 2,307 once invoked, about $0.0001 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-08-31.