Skip to content
Agentmart
Submit a tool

graph-auditor

Chain-of-reasoning (spoken, ends in a decision) — an orphan node has no reason to exist, an ambiguous arrow is a lie, and invisible feedback is a hidden loop…

Skill by sancovp

IndexedMIT
Write a review

Install

Works with Claude Code, Claude apps, Codex, Cursor, Gemini CLI, GitHub Copilot, VS Code, OpenCode, Goose, Windsurf. Read the repository before you give any tool access to your data.

npx agentmarket install skill/sancovp-graph-auditor

Asks which of your tools to add it to (Claude Code, Codex, Cursor, VS Code, Windsurf, Gemini CLI, Claude Desktop) and shows the change first. See https://agentmart.dev/cli.

Get the weekly diff

The weekly diff: one email a week with new agent tools, notable updates and grade changes, plus security alerts for tools you follow. Double opt-in, one-click unsubscribe.

We use your email only for this newsletter. Privacy

About

Chain-of-reasoning (spoken, ends in a decision) — an orphan node has no reason to exist, an ambiguous arrow is a lie, and invisible feedback is a hidden loop — find them and repair the graph.

Reviews

Write a review

No reviews yet. Installed it? Reviews come from verified installers only. How reviews work

Permissions

What this skill can do and what it asks for, from its SKILL.md. Checked Oct 25, 2026.

Tools
No tools found
Secrets
None asked for
Install scripts
None found

Network hosts it talks to 1

  • codeload.github.com · found in install command

Files it touches

  • ~/.claude/skills/graph-auditor

What's inside

Skill name
graph-auditor
Description
Chain-of-reasoning (spoken, ends in a decision) — an orphan node has no reason to exist, an ambiguous arrow is a lie, and invisible feedback is a hidden loop — find them and repair the graph.
License
MIT
Instructions
23 lines in SKILL.md · view on GitHub

Files (1)

  • SKILL.md

SKILL.md (first lines)

This is a **chain of reasoning (CoR)** — a SPOKEN, paragraphical reasoning chain that ends in a DECISION. Say it as a paragraph; keep the moves in order.

## CoR (custom syntax)
```rune
[Graph] ⇒ [OrphanNodes] ⇒ [AmbiguousEdges] ⇒ [AbstractionCollisions] ⇒ [MissingTransitions] ⇒ [FeedbackVisibility] ⇒ |RepairedGraph|
```

## Say it as a paragraph, in order
State your reasoning as ONE paragraph that performs, in order, 7 moves: Graph, OrphanNodes, AmbiguousEdges, AbstractionCollisions, MissingTransitions, FeedbackVisibility, and finally converges on RepairedGraph.
[Graph: …the constructed graph…] → [OrphanNodes: …nodes nothing reaches…] → [AmbiguousEdges: …an ambiguous arrow is a lie…] → [AbstractionCollisions: …incompatible levels in one chain…] → [MissingTransitions: …the step the diagram skips…] → [FeedbackVisibility: …feedback as a loop, never an implied return…] → [RepairedGraph: …every defect repaired or the distinction kept…]

## Inner attention chain (use silently to generate the above)
# Attention chain — Graph-Auditor
Attend, in order:
  1. Graph
  2. OrphanNodes
  3. AmbiguousEdges
  4. AbstractionCollisions
  5. MissingTransitions
  6. FeedbackVisibility
Hold: RepairedGraph  ← converge attention here, then act

From sancovp/chaincompiler, MIT.

More from sancovp/chaincompiler

Signals

Stars
0
Forks
0
Open issues
0
Last commit (this folder)
Oct 23, 2026 (4 days ago)

From GitHub (fetched Oct 24, 2026).

Details

License
MIT
Repository
github.com/sancovp/chaincompiler
First seen
Oct 24, 2026
Last checked
Oct 24, 2026
Source
GitHubgithub-graphql

More from sancovp

Cite this page

graph-auditor skill. Agent Mart. https://agentmart.dev/skills/sancovp-graph-auditor (last updated 2026-10-24)