Warning: This build has drifted.
The coverage report for this pull request build may be inaccurate because its base commit is no longer the HEAD of its target branch.
This means it includes changes from outside the original pull request, including, potentially, unrelated coverage changes.

    • Learn more: For more information on this, see Tracking coverage changes for pull request builds.
    • Fix now: For a quick fix, rebase this PR at GitHub. Your next report should be accurate.
    • Prevent going forward: To avoid this issue with future PRs, see these Recommended CI Configurations.

Distinguish algebraic vs enumeration claims, exhaustive DFS for churn chains, show k in events

- State space: make enumeration bounds explicit (max disruption = 4 pods x 10 = 40),
  distinguish algebraic properties (hold for any pod count) from empirical results
  (bounded by enumerated state space)
- P8 churn chains: replace greedy "least aggressive step" heuristic with exhaustive
  DFS over all approved replacement paths. Confirms same max chain lengths (4 at k=2,
  9 at k=4) — greedy happened to find the true max, now proven exhaustively
- Event format: include consolidationThreshold (k) alongside the 1/k threshold so
  users see their configured value

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>