Each leaf has at most 2^H assignments and polynomially many entry evaluations per assignment. Original entries satisfy the theorem input contract; new entries cost exp(O(s^(9/10))) times polynomial work. Since H=O(s/sqrt(log s)) and s^(9/10)=o(s/sqrt(log s)), leaf work fits the claimed exponent. Multiply by the bound on all calls and include polynomial-delay tuple enumeration and exact local arithmetic. The total is (s+description_length)^{O(1)} times 2^{O(s/sqrt(log s))} bit operations. Immutable descriptions keep the description-length polynomial from acquiring a new exponent at each recursion depth.