Iteration 9 of the fold optimization loop
(docs/research/optimization-loop-2026-07-30.md).
Iteration 9 targeted the control-walk condition-fact cost (35.1s of
the sql-injection profile). Measurement-first: a scratch patch (never
committed) counted duplicate feasibility queries in a live scan —
1314 total, 1268 distinct (3.5% duplicate) — so a memo cache caps out
at ~1.2s of 35.1s, far below the >=20% KPI. The checks are genuine,
distinct SMT solving; memoization is a measured dead end. Scratch
patch fully reverted; production byte-identical.
Viable future directions recorded for the next campaign: fast-path
widening beyond affine parameter comparisons, incremental solving over
the pushed path stack, dual-walk (CFG/AST fallback) elimination.
This commit folds the formatting normalization applied to two
campaign-authored files after their initial commit.
Iteration 5 of the fold optimization loop
(docs/research/optimization-loop-2026-07-30.md).
The load-sensitivity flake in symbolic summary recomputation
(observed once: empty return_post in a 7/10-run burst under CPU
saturation) did not reproduce in three bounded rig attempts:
- 8 subshell busy-loops + 10 filtered runs: 10/10 PASS
- 8 verified 'yes' workers + 10 full runs: 10/10 PASS
- concurrent real fold sql-injection+uninit-read scan (-j 4)
+ 10 full runs: 10/10 PASS
No defect reproduced, so no fix ships; the rig is committed as the
standing recipe with the suspect documented (isValidPredicate's 100ms
Z3 solver timeout in summary_encoder.cpp — check() returning unknown
under CPU starvation flips predicate-record decisions). Production
code byte-identical.
