Memory optimization workflow
Skill yeaight7/agent-powerups/plugins/memory-optimization/skills/memory-optimization-workflow
Curated power-ups for coding agents: skills, slash commands, MCP configs, hooks, AGENTS.md templates, and workflows for serious software engineering. Claude Code, Codex, Antigravity CLI, Cursor and more
npx -y skills add yeaight7/agent-powerups --skill memory-optimization-workflowAssembled from the repository path, not quoted from the project. Check it against their README if it does not work.
One thing to look at
- 6 stars6 stars. Stars are a popularity signal and not a quality one, but at this level it is likely that nobody has read this closely except its author, and you would be relying on your own review.
What its author says it does
Copied from the file, not written here
Use when deciding the lowest-cost context path for a mixed corpus, especially when choosing among direct reading, helper conversion, graph build, graph update, or graph query.
SKILL.md
2.9 KB, as published. Nobody here has run it
Memory Optimization Workflow
Overview
Minimize token spend, reread cost, and unnecessary rebuilds.
graphify is the main optimization path for repeated work. Helper tools exist to make hard sources cheaper before graph or direct reading.
When to Use
- mixed corpus and the cheapest inspection path is unclear
- repeated questions over the same files
- need to choose between direct read, conversion, graph build, update, or query
- want to reduce repeated large-context rereads
Do not use for:
- tiny single-file questions where direct reading is already cheapest
- cases where the user explicitly wants raw-file inspection only
Required Checks
apx check graphify
apx check markitdown-file-intake
apx check defuddle
Stop and report missing tools. Do not auto-install without approval.
Fast Routing
| Situation | Cheapest path |
|---|---|
| small readable text corpus, one question | read directly |
| PDF, Office doc, or other binary-like source | markitdown-file-intake |
| noisy web page or article | defuddle |
| repeated questions across same corpus | build with graphify |
| existing graph plus changed sources | graphify --update |
| existing graph plus new question | query graph first |
Decision Rules
- prefer direct reading for small plain-text scope
- prefer Markdown over binary or chrome-heavy formats
- prefer graph query over full reread when a graph already exists
- prefer incremental update over rebuild
- keep helper tools secondary to the main graph path
- keep Obsidian optional; it is not part of the optimization decision unless the user wants vault browsing
Escalation Ladder
- Direct read if scope is already small and readable.
- Convert only if format is the main source of waste.
- Build graph memory when questions will repeat or corpus is broad.
- Update existing graph when sources changed.
- Query existing graph before any broad reread.
Common Failure Modes
- building a graph for a tiny one-shot question
- rereading large corpora after a graph already exists
- converting already-readable Markdown or code
- rebuilding instead of updating
- making helper tools feel primary instead of supportive
Verification
- Required tool checks ran; missing tools were reported, not auto-installed
- The chosen path matches the routing table — direct read for small readable scope
- No graph was built for a tiny one-shot question
- An existing graph was queried or updated instead of rereading the corpus
- Helpers stayed secondary to the main graph path