Codex should develop a tree-based pattern where it iteratively self-manages tasks. Each round draws three cards, then performs TDD + logging trace closed-loop benchmarking. Starting from three cards drawn to nine cards, it begins proliferating, deleting and merging garbage tree paths. It continuously optimizes based on benchmark targets infinitely, automatically performs git tag upon reaching critical performance nodes, gradually converges from divergent models, and ultimately delivers a non-overfitted program that meets completion objectives.