self-evolutionlisted

# Self-Evolution (Graph-Planned Procedural Dispatcher) Deterministic self-healing engine based on Stanford graph-planning principles. Mediated exclusively by `scripts/evolution_state.py`. Detailed operational node specs live in `references/evolution-graph-nodes.md`. Exact commands for every stage below are in `references/detailed-reference.md`. ## The 4-Box Qualification Gate Before initiating an evolution cycle, verify: 1. Failure is structural/recurring (not a transient fluke). 2. An objective programmatic verifier command exists (`exit 0` proof). 3. Hard iteration ceiling of 3 attempts is enforced. 4. Permanent Layer 2 persistence sink is defined (`wiki/`, `references/map-debt.md`). ## State Machine Execution Flow ``` [PRIOR ART & DEBT SCAN] (Mandatory Phase 0) | ▼ [TRIAGE] -> [PLAN] -> [AWAITING_APPROVAL] ===(Human Gate)===> [AUTHORIZED] -> [CREATE_WORKTREE] -> [EXECUTE] -> [VERIFY_GATE] |-- Pass ---------------------> [PRE_COMMIT_RECEIPT] -> [COMMIT] -> [FINAL_RECEIPT] -> [COMPLETED] |-- Fail (attempts < 3) ------> [PLAN] (Loop) \-- Fail (attempts == 3) -----> [ROLLBACK] -> [FINAL_RECEIPT] -> [ESCALATED] ``` ### Phase 0: Prior Art & Debt Scan (Mandatory — EVOLUTION tasks only) Before drafting any hypothesis or entering TRIAGE: read `references/map-debt.md` for `Repeat: YES` entries (hard blockers — escalate, don't re-attempt), read `wiki/decisions/` for architectural constraints that rule out candidate hypotheses, and che