Keep the root parameter s, lambda=ceil(log2 s), degree cap Delta=ceil(s^(9/10)), and leaf threshold H=ceil(s/floor(sqrt(lambda))) fixed throughout recursion. A call has its own wire count M and input precision p. If M<=H, evaluate its contraction by direct summation over 2^M wire assignments. Active calls have M>H. The planned invariant is that each child has at most M/8 wires and degree at most Delta; the child-network construction must still prove it. Replacing s by M in the original entry-evaluation bound would be unjustified.