Loop skill
Iterative improvement loop — refine a target across multiple Algorithm cycles toward ideal state.
by danielmiessler·MIT license·★ 19,269 Stars on the repo·GitHub ↗
npx degit danielmiessler/LifeOS/LifeOS/install/skills/Loop#main ~/.claude/skills/loop-danielmiesslerChecked ·commit main
Files of Loop
Show the full text81 lines
/loop — Iterative Improvement
What It Does
/loop runs the Algorithm as a loop — multiple full Algorithm cycles on the same target, each iteration building on the last. By default a human reviews and redirects between iterations. Unlike /optimize (an autonomous mutation loop), /loop runs full Algorithm passes with that human review in the seam.
The Problem
Some work doesn't finish in one pass. A skill, a prompt, a diagram, a piece of writing gets meaningfully better each time you run a full cycle on it — but only if each cycle remembers what the last one learned and what it already tried. Run the cycles by hand and you lose that thread: you re-explore dead ends, forget which approaches got rejected, and have no record of whether the score actually moved. /loop carries ISC criteria and a dead-ends ledger across iterations so each pass starts from where the last one ended.
How It Works
Each iteration is a full Algorithm cycle (OBSERVE → LEARN). The LEARN phase of one cycle feeds the OBSERVE phase of the next, the ISA tracks iteration count and cumulative improvements, and a human approves or redirects between iterations unless autoresearch mode is enabled.
Invocation
/loop --target "path/to/target" --iterations 5
/loop --target "~/.claude/skills/Art/Workflows/TechnicalDiagrams.md" --goal "make diagrams more consistent"
/loop --resume # Resume a previous loop
/loop --status # Show iteration history
What Happens
Each iteration is a full Algorithm cycle (articulate → climb → verify → learn) with:
- ISC criteria that evolve between iterations
- Each cycle's learnings inform the next cycle's scaffold
- ISA tracks iteration count and cumulative improvements
- Human approves/redirects between iterations
Arguments
| Argument | Required | Default | Description |
|---|---|---|---|
--target PATH |
yes | What to improve (file, directory, skill) | |
--goal TEXT |
inferred | What "better" means for this target | |
--iterations N |
3 | Maximum number of Algorithm cycles | |
--resume |
Resume a previous loop | ||
--status |
Show iteration history | ||
--autoresearch |
off | Opt-in autonomous mode — see below |
Algorithm Integration
The iteration field tracks cycle count. (mode: is retired — never write it.) Each cycle re-enters the Algorithm with accumulated context from prior iterations.
Autoresearch Mode (opt-in)
--autoresearch switches /loop from supervised multi-pass improvement to autonomous iteration, borrowing three patterns from pi-autoresearch (davebcn87, MIT):
- No human review between cycles — each iteration's LEARN feeds directly into the next OBSERVE. Cycle continues until
--iterationsreached, target met, or explicit interrupt. - Dead-ends ledger — ISA maintains a
## Dead Endssection. Every failed iteration appends one line with the rejected approach and reason. Resumes read this to avoid retrying rejected paths. - MAD confidence on iteration score — if the target has a measurable score, compute
|delta|/MAD(iteration_scores)per cycle. Flag red (<1.0×) iterations as noise-floor and logmarginal; do not update baseline. SeeLIFEOS/ALGORITHM/optimize-loop.md→ Confidence Gating.
Invocation:
/loop --target "path" --goal "X" --iterations 20 --autoresearch
Default /loop behavior is unchanged — autoresearch is opt-in only. Intended for overnight runs on targets where human-in-the-loop review between cycles is too slow.
Examples
/loop --target "~/.claude/skills/Research" --goal "improve output quality" --iterations 5
/loop --target "prompts/summarize.md" --goal "more concise, less filler"
Gotchas
- Loop runs multiple full Algorithm cycles. Each cycle is a complete OBSERVE→LEARN pass. This is expensive in time and tokens.
- Set a clear exit condition. Without one, loops can run indefinitely.
- Human review happens between cycles. Don't skip the review step — it's the feedback mechanism.
| 1 | |
| 2 | name Loop |
| 3 | version 1.0.9 |
| 4 | description "Iterative improvement loop — refine a target across multiple Algorithm cycles toward ideal state. USE WHEN loop, iterate, refine, multiple passes, keep improving, revisit, rework." |
| 5 | disable-model-invocation true |
| 6 | |
| 7 | |
| 8 | # /loop — Iterative Improvement |
| 9 | |
| 10 | ## What It Does |
| 11 | |
| 12 | `/loop` runs the Algorithm as a loop — multiple full Algorithm cycles on the same target, each iteration building on the last. By default a human reviews and redirects between iterations. Unlike `/optimize` (an autonomous mutation loop), `/loop` runs full Algorithm passes with that human review in the seam. |
| 13 | |
| 14 | ## The Problem |
| 15 | |
| 16 | Some work doesn't finish in one pass. A skill, a prompt, a diagram, a piece of writing gets meaningfully better each time you run a full cycle on it — but only if each cycle remembers what the last one learned and what it already tried. Run the cycles by hand and you lose that thread: you re-explore dead ends, forget which approaches got rejected, and have no record of whether the score actually moved. `/loop` carries ISC criteria and a dead-ends ledger across iterations so each pass starts from where the last one ended. |
| 17 | |
| 18 | ## How It Works |
| 19 | |
| 20 | Each iteration is a full Algorithm cycle (OBSERVE → LEARN). The LEARN phase of one cycle feeds the OBSERVE phase of the next, the ISA tracks iteration count and cumulative improvements, and a human approves or redirects between iterations unless autoresearch mode is enabled. |
| 21 | |
| 22 | ## Invocation |
| 23 | |
| 24 | |
| 25 | /loop --target "path/to/target" --iterations 5 |
| 26 | /loop --target "~/.claude/skills/Art/Workflows/TechnicalDiagrams.md" --goal "make diagrams more consistent" |
| 27 | /loop --resume # Resume a previous loop |
| 28 | /loop --status # Show iteration history |
| 29 | |
| 30 | |
| 31 | ## What Happens |
| 32 | |
| 33 | Each iteration is a full Algorithm cycle (articulate → climb → verify → learn) with: |
| 34 | ISC criteria that evolve between iterations |
| 35 | Each cycle's learnings inform the next cycle's scaffold |
| 36 | ISA tracks iteration count and cumulative improvements |
| 37 | Human approves/redirects between iterations |
| 38 | |
| 39 | ## Arguments |
| 40 | |
| 41 | | Argument | Required | Default | Description | |
| 42 | |----------|----------|---------|-------------| |
| 43 | | `--target PATH` | yes | | What to improve (file, directory, skill) | |
| 44 | | `--goal TEXT` | | inferred | What "better" means for this target | |
| 45 | | `--iterations N` | | 3 | Maximum number of Algorithm cycles | |
| 46 | | `--resume` | | | Resume a previous loop | |
| 47 | | `--status` | | | Show iteration history | |
| 48 | | `--autoresearch` | | off | Opt-in autonomous mode — see below | |
| 49 | |
| 50 | ## Algorithm Integration |
| 51 | |
| 52 | The `iteration` field tracks cycle count. (`mode:` is retired — never write it.) Each cycle re-enters the Algorithm with accumulated context from prior iterations. |
| 53 | |
| 54 | ## Autoresearch Mode (opt-in) |
| 55 | |
| 56 | `--autoresearch` switches /loop from supervised multi-pass improvement to autonomous iteration, borrowing three patterns from pi-autoresearch (davebcn87, MIT): |
| 57 | |
| 58 | **No human review between cycles** — each iteration's LEARN feeds directly into the next OBSERVE. Cycle continues until `--iterations` reached, target met, or explicit interrupt. |
| 59 | **Dead-ends ledger** — ISA maintains a `## Dead Ends` section. Every failed iteration appends one line with the rejected approach and reason. Resumes read this to avoid retrying rejected paths. |
| 60 | **MAD confidence on iteration score** — if the target has a measurable score, compute `|delta|/MAD(iteration_scores)` per cycle. Flag red (<1.0×) iterations as noise-floor and log `marginal`; do not update baseline. See `LIFEOS/ALGORITHM/optimize-loop.md` → Confidence Gating. |
| 61 | |
| 62 | Invocation: |
| 63 | |
| 64 | /loop --target "path" --goal "X" --iterations 20 --autoresearch |
| 65 | |
| 66 | |
| 67 | Default /loop behavior is unchanged — autoresearch is opt-in only. Intended for overnight runs on targets where human-in-the-loop review between cycles is too slow. |
| 68 | |
| 69 | ## Examples |
| 70 | |
| 71 | |
| 72 | /loop --target "~/.claude/skills/Research" --goal "improve output quality" --iterations 5 |
| 73 | /loop --target "prompts/summarize.md" --goal "more concise, less filler" |
| 74 | |
| 75 | |
| 76 | ## Gotchas |
| 77 | |
| 78 | **Loop runs multiple full Algorithm cycles.** Each cycle is a complete OBSERVE→LEARN pass. This is expensive in time and tokens. |
| 79 | **Set a clear exit condition.** Without one, loops can run indefinitely. |
| 80 | **Human review happens between cycles.** Don't skip the review step — it's the feedback mechanism. |
| 81 |
Discussion
Browse more free Claude skills.