At depth d, with root depth zero, set r=64, epsilon=1/(128 times 1024), u_d=floor(epsilon lambda/2^d), and a_d=2 sum_{j=0}^d u_j, with a_(-1)=0. Write u=u_d, a=a_d, L=2^a, and D_arr=r^(2a). L is the number of slots in a packet; D_arr counts ordered pairs of length-a labels over r symbols. At an active call the proof requires u>=1; a range where the required inequalities fail is handled by direct summation. These are asymptotic parameters with extremely small constants, not evidence of practical efficiency.