graph-executionlisted

# Graph-Planned Execution (Deterministic State Machine Protocol) Provides a deterministic, graph-planned execution primitive for tasks requiring formal state tracking, non-negotiable human approval gates, isolated worktree sandboxing, and guaranteed safe rollback. --- ## 1. Overview: Loops vs. Graphs While standard agent loops rely on conversational context to decide next steps, **Graph Execution** models tasks as a formal Directed Acyclic Graph (DAG) or finite state machine: ```mermaid stateDiagram-v2 [*] --> TRIAGE: Task / Error Trigger TRIAGE --> PLAN: 4-Box Automation Gate Passed PLAN --> AWAITING_APPROVAL: Transaction Manifest Formulated AWAITING_APPROVAL --> AUTHORIZED: User Explicit Approval ("Proceed") AUTHORIZED --> CREATE_WORKTREE: Worktree Sandbox Initialized CREATE_WORKTREE --> EXECUTE: Mutation Attempt (1-3) EXECUTE --> VERIFY_GATE: Objective Verifier Run VERIFY_GATE --> PRE_COMMIT_RECEIPT: Verifier Passed (exit 0) VERIFY_GATE --> PLAN: Verifier Failed (Attempts < 3) VERIFY_GATE --> ROLLBACK: Verifier Failed (Attempts == 3) PRE_COMMIT_RECEIPT --> COMMIT: Staged Tree Validated & Committed ROLLBACK --> FINAL_RECEIPT: Layer 2 Transferred & Worktree Removed COMMIT --> FINAL_RECEIPT: Local Cycle Successful FINAL_RECEIPT --> [*]: Terminal Receipt Logged ``` --- ## 2. The Core Invariants 1. **State in Files, Not Prompts:** The active node, attempt count, and operation bounds are stored in `.agent/learnin