With a valid layout, each point has at most 2*tau*n integer measurement rows, range bound B=D, and groups of at most 2n/r variables. The two-scan bound gives at most 2*r*(2D+1)^(2*tau*n)*2^(2n/r) local vectors per pair (E,U). Multiplying by Q points and C_q pairs gives 2*Q*r*C_q*(2D+1)^(2*tau*n)*2^(2n/r). If d=sum of factor degree bounds is O(n), then d_H<=d*R and q=floor(d_H/Q)=O(nR/Q). The three exponential costs are controlled by (R/Q)*log2(2Q/R), tau*log2(2D+1), and 1/r. Factor evaluations and bit arithmetic are additional costs, not free operations.