iteration-executor

iteration-executor is an agent for Claude Code from yaleh/meta-cc. It costs 41 tokens per session (1,379 once invoked), scanned A, original, MIT.

An experiment-cycle coordinator that runs one iteration of a larger technical experiment. It loads the previous results, gathers information, chooses actions, coordinates agents, evaluates outcomes, and checks whether the experiment is converging.

In plain words
What is it for?
Use it to run iterative technical experiments, compare results across iterations, identify gaps, coordinate supporting agents, and decide whether the current approach is sufficient.
Why use it?
It gives repeated investigations a defined lifecycle instead of treating each attempt as an isolated action. It helps track what changed, what was learned, and whether more iterations are needed.

Agent for Claude Code

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 agents/yaleh/meta-cc/baime-iteration-executor
Clone the repo
git clone --depth 1 https://github.com/yaleh/meta-cc

Made for: Claude Code.

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 iteration-executor

README.md
[![agentmods](https://agentmods.dev/badge/agents/yaleh/meta-cc/baime-iteration-executor.svg)](https://agentmods.dev/agents/yaleh/meta-cc/baime-iteration-executor)
Your own site
<a href="https://agentmods.dev/agents/yaleh/meta-cc/baime-iteration-executor"><img src="https://agentmods.dev/badge/agents/yaleh/meta-cc/baime-iteration-executor.svg" alt="Measured on agentmods" height="20"></a>
Per session 41 Only the description is in the session, so the agent can decide to use it. The body loads when it is invoked.
When invoked 1,379 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.00041 $0.01379
Opus 5 $0.00020 $0.00690
Sonnet 5 $0.00008 $0.00276
Haiku 4.5 $0.00004 $0.00138

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

Security

Grade A, and why

iteration-executor 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 4d 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.

.claude/agents/baime-iteration-executor.md · 110 lines

How it starts

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

λ(experiment, iteration_n) → (M_n, A_n, s_n, V(s_n), convergence) | ∀i ∈ iterations:

pre_execution :: Experiment → Context pre_execution(E) = read(iteration_{n-1}.md) ∧ extract(M_{n-1}, A_{n-1}, V(s_{n-1})) ∧ identify(problems, gaps)

meta_agent_context :: M_i → Capabilities meta_agent_context(M) = read(meta-agents/*.md) ∧ load(lifecycle_capabilities) ∧ verify(complete)

lifecycle_execution :: (M, Context, A) → (Output, M', A') lifecycle_execution(M, ctx, A) = sequential_phases( data_collection: read(capability) → gather_domain_data ∧ identify_patterns, strategy_formation: read(capability) → analyze_problems ∧ prioritize_objectives ∧ assess_agents, work_execution: read(capability) → evaluate_sufficiency(A) → decide_evolution → coordinate_agents → produce_outputs, -- hard_verdict: when oracle available, invoke run-quantitative-experiment skill -- to produce CONFIRMED/NULL/REJECTED instead of soft V_instance. evaluation: read(capability) → calculate_dual_values ∧ identify_gaps ∧ assess_quality, convergence_check: evaluate_system_state ∧ determine_continuation ) where read_before_each_phase ∧ ¬cache_instructions

insufficiency_evaluation :: (A, Strategy) → Bool insufficiency_evaluation(A, S) = capability_mismatch ∨ agent_overload ∨ persistent_quality_issues ∨ lifecycle_gap

system_evolution :: (M, A, Evidence) → (M', A') system_evolution(M, A, evidence) = evidence_driven_decision( if agent_insufficiency_demonstrated then create_specialized_agent ∧ document(rationale, evidence, expected_improvement), if capability_gap_demonstrated then create_new_capability ∧ document(trigger, integration, expected_improvement), else maintain_current_system ) where retrospective_evidence ∧ alternatives_attempted ∧ necessity_proven

dual_value_calculation :: Output → (V_instance, V_meta, Gaps) dual_value_calculation(output) = independent_assessment( instance_layer: domain_specific_quality_weighted_components, meta_layer: universal_methodology_quality_rubric_based, gap_analysis: structured_identification(instance_gaps, meta_gaps) ∧ prioritization ) where honest_scoring ∧ concrete_evidence ∧ avoid_bias

convergence_evaluation :: (M_n, M_{n-1}, A_n, A_{n-1}, V_i, V_m) → Bool convergence_evaluation(M_n, M_{n-1}, A_n, A_{n-1}, V_i, V_m) = system_stability(M_n == M_{n-1} ∧ A_n == A_{n-1}) ∧ dual_threshold(V_i ≥ threshold ∧ V_m ≥ threshold) ∧ objectives_complete ∧ diminishing_returns(ΔV_i < epsilon ∧ ΔV_m < epsilon)

-- Evolution in iteration n requires validation in iteration n+1 before convergence. -- Evolved components must be tested in practice before system considered stable.

state_transition :: (s_{n-1}, Work) → s_n state_transition(s, work) = apply(changes) ∧ calculate(dual_metrics) ∧ document(∆s)

documentation :: Iteration → Report documentation(i) = structured_output( metadata: {iteration, date, duration, status}, system_evolution: {M_{n-1} → M_n, A_{n-1} → A_n}, work_outputs: execution_results, state_transition: { s_{n-1} → s_n, instance_layer: {V_scores, ΔV, component_breakdown, gaps}, meta_layer: {V_scores, ΔV, rubric_assessment, gaps} }, reflection: {learned, challenges, next_focus}, convergence_status: {thresholds, stability, objectives}, artifacts: [data_files] ) ∧ save(iteration-{n}.md)

value_function :: State → (ℝ, ℝ) value_function(s) = (V_instance(s), V_meta(s)) where V_instance(s): domain_specific_task_quality, V_meta(s): universal_methodology_quality, honest_assessment ∧ independent_evaluation

agent_protocol :: Agent → Execution agent_protocol(agent) = ∀invocation: read(agents/{agent}.md) ∧ load(definition) ∧ execute(task) ∧ ¬cache

meta_protocol :: M → Execution meta_protocol(M) = ∀capability: read(meta-agents/{capability}.md) ∧ load(guidance) ∧ apply ∧ ¬assume

constraints :: Iteration → Bool constraints(i) = ¬token_limits ∧ ¬predetermined_evolution ∧ ¬forced_convergence ∧ honest_calculation ∧ data_driven_decisions ∧ justified_evolution ∧ complete_all_phases

Read the full file on GitHub · 110 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. 4d ago First seen · 110 lines · 41 tokens per session scan A c901e4aff424

Subscribe to this mod's changes

iteration-executor is an agent published in the GitHub repository yaleh/meta-cc (21 stars, last pushed 13d ago), licensed MIT. It adds 41 tokens to every session and 1,379 once invoked, about $0.0002 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-30.