Codex adaptation

Prefer deletion and the smallest direct change, subject to the real proof gate. Required native capabilities: none; this is instruction-only. No external product dependency is required by the adapted path. No tool is required; unsafe deletion preserves the original. This candidate is promoted for the bounded path described here; unrelated runtime parity remains unproven. This is a guide-only adaptation.

Laziness Protocol

• Consolidate decisions. Do not repeat the same choice in several places. Put it behind one source of truth and pass the result as a simple flag.
• Minimize the diff. Make the smallest change that solves the problem. Fewer lines beat "elegant" boilerplate.