musk-step-3-simplify-optimize

Step 3: Simplify and Optimize

Only after steps 1 and 2. Optimizing a thing that should not exist is the most common smart-engineer failure.

Part of the [[musk-algorithm]]. Third in the strict order.

Gate

Before this step, verify in the conversation or diff:

• [[musk-step-1-question-requirements]] has produced a list of named, surviving requirements.
• [[musk-step-2-delete-parts]] has produced an explicit deletion list and predicted add-back.

If either is absent, stop. Run the missing step first. This is the most common skip point. Refuse aggressively.

Why this step exists

Schools train convergent logic: answer the question. Engineers instinctively optimize before questioning whether the thing should exist. Musk identifies this as the single most common failure mode in smart engineering teams.

A simplification or optimization of a part that survived steps 1 and 2 is high-leverage. The same work on a part that should have been deleted is wasted, and worse, it hard-codes the unjustified part deeper into the system.

Protocol

For each surviving part:

1. Write the justification sentence. Before any optimization, state in one sentence: "This exists because [named person from step 1] requires [steelmanned requirement] and removing it causes [specific failure]." If you cannot write this sentence, return to [[musk-step-1-question-requirements]]. This is the hard gate.
2. Measure the pre-optimization state. Parts, lines, parameters, branches, dependencies, special cases. Without this baseline, any "optimization" is unverifiable.
3. Reduce. In priority order: parameters, branches, special cases, moving parts, cognitive load, lines.
4. Match existing style. Do not refactor adjacent code that is not in scope. Surgical changes only.
5. Measure the post-optimization state. Report the complexity delta.

Output format

Part: [what is being simplified]
Justification sentence: "This exists because [named person] requires [requirement] and removing it causes [failure]."
Pre-optimization state:
  - Parts: N
  - Lines: N
  - Parameters: N
  - Branches: N
  - Dependencies: N
  - Special cases: N
Optimization moves:
  1. [move + justification]
  2. [move + justification]
Post-optimization state:
  - Parts: N (delta)
  - Lines: N (delta)
  - Parameters: N (delta)
  - Branches: N (delta)
  - Dependencies: N (delta)
  - Special cases: N (delta)
Out-of-scope code touched: [should be empty, or explicitly justified]