111-ooda-loop

An incident-response method based on four repeating steps: observe what is happening, understand the situation, decide what to do, and act.

In plain words
What is it for?
It is for handling outages, security incidents, production failures, and other urgent problems through short cycles of observation, decision-making, action, and feedback.
Why use it?
It gives developers a simple way to make and revisit decisions when an incident is changing quickly and information is incomplete.

Cursor rule

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 rules/hamzaamjad/cursor-rules/111-ooda-loop
Clone the repo
git clone --depth 1 https://github.com/hamzaamjad/cursor-rules
Per session 1,693 This file is loaded in full into every session.
When invoked 1,693 The same file — it is already loaded in full.
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.01693 $0.01693
Opus 5 $0.00847 $0.00847
Sonnet 5 $0.00339 $0.00339
Haiku 4.5 $0.00169 $0.00169

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

Security

Grade A, and why

111-ooda-loop 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 2d 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.

rules/100-cognitive/111-ooda-loop.mdc · 190 lines

How it starts

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

OODA Loop: Observe, Orient, Decide, Act

  • Purpose: Enable rapid decision-making and adaptation through continuous cycles of observation, orientation, decision, and action, achieving competitive advantage by operating inside adversaries' or problems' decision cycles.

  • Requirements:

    • Observe Phase:
      • Gather unfiltered, real-time data from all available sensors
      • Maintain awareness without premature interpretation
      • Prioritize timeliness over completeness for volatile situations
      • Document raw observations separately from analysis
    • Orient Phase:
      • Synthesize observations with existing mental models
      • Apply "destruction and creation" - challenge assumptions
      • Integrate cultural context, experience, and new information
      • Identify mismatches between expectations and reality
    • Decide Phase:
      • Generate hypotheses as falsifiable predictions
      • Favor "good enough" decisions over perfect ones
      • Consider resource constraints and time pressure
      • Maintain decision reversibility where possible
    • Act Phase:
      • Execute decisions with clear measurement criteria
      • Generate observable outcomes for feedback
      • Maintain action tempo to disrupt competitor cycles
      • Capture results for next observation phase
  • Validation:

    • Check: Each phase completed before progressing (no skipping)
    • Check: Feedback from Act phase feeds new Observations
    • Check: Orientation models updated based on outcomes
    • Check: Decision tempo faster than environmental change rate
    • Metric: Complete cycle time < problem evolution time
  • Examples: <example_correct> Description: Incident response using OODA Loop

    class OODAIncidentResponse:
        def __init__(self):
            self.cycle_count = 0
            self.orientation_model = self.load_threat_models()
        
        def observe(self) -> dict:
            """Gather unfiltered sensor data"""
            return {
                "network_traffic": self.collect_netflow(),
                "system_logs": self.aggregate_logs(),
                "user_reports": self.check_tickets(),
                "timestamp": datetime.now(),
                "cycle": self.cycle_count
            }
        
        def orient(self, observations: dict) -> dict:
            """Synthesize data with threat models"""
            # Destruction: Challenge existing assumptions
            anomalies = self.detect_anomalies(observations)
            
            # Creation: Build new understanding
            threat_assessment = {
                "attack_vectors": self.correlate_with_ttps(anomalies),
                "affected_systems": self.map_blast_radius(observations),
                "attacker_tempo": self.estimate_progression_speed(observations)
            }
            
            # Update mental model for next cycle
            self.orientation_model.update(threat_assessment)
            return threat_assessment
        
        def decide(self, orientation: dict) -> dict:
            """Generate actionable hypothesis"""
            if orientation["attacker_tempo"] > self.response_tempo:
                # We're being outmaneuvered - need faster decisions
                return {
                    "action": "automated_containment",
                    "scope": orientation["affected_systems"][:5],  # Limit scope
                    "reversible": True
                }
            else:
                return {
                    "action": "targeted_investigation",
                    "focus": orientation["attack_vectors"][0],
                    "resources": "full_team"
                }
        
        def act(self, decision: dict) -> dict:
            """Execute with measurement"""
            start_time = datetime.now()
            
            if decision["action"] == "automated_containment":
                results = self.isolate_systems(decision["scope"])
            else:
                results = self.deep_dive_investigation(decision["focus"])
            
            return {
                "action_taken": decision["action"],
                "results": results,
                "execution_time": datetime.now() - start_time,
                "new_observables": results.get("indicators", [])
            }
        
        def run_cycle(self):
            """Complete OODA loop iteration"""
            observations = self.observe()
            orientation = self.orient(observations)
            decision = self.decide(orientation)
            action_results = self.act(decision)
            
            # Feedback loop - results become new observations
            self.cycle_count += 1
            self.queue_observations(action_results["new_observables"])
            
            return {
                "cycle": self.cycle_count,
                "tempo": self.calculate_cycle_time(),
                "effectiveness": self.measure_containment()
            }
    

    </example_correct>

Read the full file on GitHub · 190 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. 2d ago First seen · 190 lines · 1,693 tokens per session scan A cdb8bec3c110

Subscribe to this mod's changes

111-ooda-loop is a cursor rule published in the GitHub repository hamzaamjad/cursor-rules (2 stars, last pushed 1y ago), licensed MIT. It adds 1,693 tokens to every session, about $0.0085 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-31.