@@ -92,12 +92,16 @@ facts computed from the two closure graphs and the merge-base tree, not by an en
    (renames canonicalized), so nothing was dropped or swapped.
 2. **Added-module novelty:** every module the head closure evaluates that the base closure did
    not is absent from the merge-base tree at its rename-canonicalized path AND carries no code
-   from a source deleted since the merge-base. A module the tree already had, sitting outside
-   the closure, becoming eager — under its own name, a renamed one, or a rewritten move that
-   evades git's `-M` similarity pairing — is a new edge, not re-homed code; and without this
-   fact, weight deleted elsewhere in the closure would fund it. Rename canonicalization
-   preserves modules ALREADY IN the base closure; it is not a pass for an external module
-   moved in, which fails the check at the base path the merge-base necessarily still has.
+   from a source deleted since the merge-base — matched when the added module shares **two or
+   more identical normalized top-level statements** with one deleted source; a single shared
+   statement is treated as coincidence, because short constants (a schema version, a default
+   timeout) repeat across the repo and branding every reuse a move would poison new files).
+   A module the tree already had, sitting outside the closure, becoming eager — under its own
+   name, a renamed one, or a rewritten move that evades git's `-M` similarity pairing — is a
+   new edge, not re-homed code; and without this fact, weight deleted elsewhere in the closure
+   would fund it. Rename canonicalization preserves modules ALREADY IN the base closure; it is
+   not a pass for an external module moved in, which fails the check at the base path the
+   merge-base necessarily still has.
 3. **Flat weight:** the closure's total top-level statement count — wiring lines excluded, so
    re-homing is invisible to it — does not exceed the merge-base closure's.
 
@@ -109,14 +113,19 @@ unrelated shrinkage paying for a smuggled edge — and the three together admit
 while refusing any growth in the closure's module-scope statement weight. Statements were chosen
 over bytes because formatting and comment churn move bytes while statements track the thing being
 preserved: module-scope declarations and calls. The guarantee is exactly **newly evaluated
-modules are new code — new paths carrying no deleted source's statements — and total statement
-weight is flat over a preserved closure**, not equality of eager behavior: a split that REPLACES
-an existing statement with a more expensive top-level call inside an existing file moves no
-count and no weight, so it passes — nothing count-based, in modules or statements, can see a
-like-for-like replacement. That residue is bounded by what the tolerance cannot hide: every
-module the head newly evaluates is a path the merge-base tree did not have AND carries none of
-the statements of any source deleted since the merge-base (so it cannot smuggle pre-existing
-implementation into eager scope, rewritten or not), the hard ADR-0019 checks (façade exactness,
+modules are new code — new paths the gate's deleted-source probe cannot match to any deleted
+source's statement text — and total statement weight is flat over a preserved closure**, not
+equality of eager behavior: a split that REPLACES an existing statement with a more expensive
+top-level call inside an existing file moves no count and no weight, so it passes — nothing
+count-based, in modules or statements, can see a like-for-like replacement. That residue is
+bounded by what the tolerance cannot hide: every module the head newly evaluates is a path the
+merge-base tree did not have AND fails the gate's move probe — its top-level statements do not
+share two or more identical normalized statements with any single source deleted since the
+merge-base (`movedFromDeletedSource`). This probe is deliberately conservative and textual:
+code REWRITTEN or reformulated during a move does not match it and would pass as novel, so what
+is verified is "no verbatim transplant of a deleted source," not "no repurposed logic" (the
+weight fact is what still refuses a transplant made heavier). What keeps the residue small is
+everything around the probe: the hard ADR-0019 checks (façade exactness,
 no platform implementation before binding) stay count- and pattern-based under it, and the
 added-module listing every failure prints is what a reviewer reads. The planted tests in
 `scripts/__tests__/closure-growth-rule.test.ts` pin every failing direction.
 
@@ -14,8 +14,12 @@
 //    (renames canonicalized), so nothing was dropped or swapped -- the growth is purely
 //    addition.
 // 2. ADDED-MODULE NOVELTY: every module the head closure evaluates that the base closure did
-//    not is absent from the merge-base tree AT ITS RENAME-CANONICALIZED PATH and carries no
-//    statement text from a source deleted since the merge-base. A module the merge-base tree
+//    not is absent from the merge-base tree AT ITS RENAME-CANONICALIZED PATH and is not a
+//    verbatim transplant of a deleted source: two or more identical normalized top-level
+//    statements shared with one source deleted since the merge-base mark a move
+//    (`movedFromDeletedSource`); a rewritten transplant evades a textual probe and would pass
+//    as novel, which the flat-weight fact then has to catch if it is heavier. A module the
+//    merge-base tree
 //    already had, sitting outside the closure, becoming eager -- under its own name, a new
 //    one, or a rewritten move `-M` cannot pair -- is a NEW EDGE, not re-homed code; without
 //    this fact, weight deleted elsewhere in the closure would fund it. Canonicalization
@@ -29,8 +33,8 @@
 // pre-existing module in at flat weight; novelty without containment accepts dropping a
 // merge-base module; weight without the other two accepts an unrelated shrinkage paying for a
 // smuggled edge. The guarantee the triple states is exactly "newly evaluated modules are new
-// CODE -- new paths carrying no deleted source's statements -- and total statement weight is
-// flat over a preserved closure" -- a split that REPLACES a statement with a more expensive
+// CODE -- new paths the deleted-source probe cannot match to a deleted source's statements --
+// and total statement weight is flat over a preserved closure" -- a split that REPLACES a statement with a more expensive
 // one inside an existing file is invisible to any count, in modules or in statements, and is
 // not what this tolerance was built to admit. It replaces neither the count comparison (which
 // still fires first: growth must exist to be tolerated) nor the hard ADR-0019 checks (façade
 
@@ -60,8 +60,10 @@ import {
  *   ceilings, the committed-tree reader, rename following, the bounded attribution, recursive
  *   discovery) additionally has its own failing-direction test below, because a real tree that
  *   happens to satisfy its rules cannot distinguish a correct rule from a vacuous one.
- * - Cost: one unit-lane test file plus two data/reader modules; four git processes for the
- *   merge-base side (merge-base, ls-tree, one cat-file batch, one rename diff), no device. The
+ * - Cost: one unit-lane test file plus two data/reader modules; up to five git processes for the
+ *   merge-base side (merge-base, ls-tree, one cat-file batch for the base tree, one rename diff,
+ *   and one further cat-file batch only when the closure loses sources — the deleted-file contents
+ *   the novelty check reads), no device. The
  *   walker memoizes per-file edges per tree and parses each file once per distinct content, so
  *   the base tree pays only for the files the branch changed.
  * - Kill criterion: if two consecutive quarters show no rule ever firing, or