Let R=[x, y] over an algebraically closed field of characteristic zero, and let q=a u²+2buv+c v² R_² (V^*) be a primitive binary quadratic germ with nonzero discriminant (q) =b²-ac. Iterated point blowups of the coefficient ideal (a, b, c) produce a tree of proper and infinitely-near base points. We refine this classical cluster by recording, on every exceptional component, its discriminant multiplicity, branch or nonbranch status, and repeated-root direction. First, we prove a finite successor-closure theorem for coefficient jets. A blowup at a center of common order loses exactly orders of jet precision. More sharply, on a fixed initial-form stratum, all immediate child jets are determined by principal parts of the higher homogeneous coefficients only at the actual successor directions. The resulting directional packet is the minimal framed linear quotient with this property. Exact exceptional discriminant multiplicity and residual attachment directions require an additional scalar discriminant symbol; explicit examples show that this information is independent of the recursive coefficient cluster. Second, for qₑ, ₒ=xʳ u²+yˢ v², the primitive resolution is the subtractive Euclidean algorithm, with total linear and square costs ᵢᵢ=r+s- (r, s), ᵢᵢ²=rs. For qₑ, ₆=xʳ u²+Gₛ (x, y) v², factorization of the homogeneous form Gₛ turns the chain into a rooted Euclidean forest. Its total square cost remains rs, independent of the splitting type, while coalescing arm multiplicities kⱼ at one proper center contributes the exact interaction 2₈<₉kᵢ kⱼ. Finally, two changes of a constant repeated-root label inside one consecutive branch block cost at least 15. Every constant-root branch--nonbranch--branch return of total square cost at most 12 has the unique multiplicity pattern (2, 2, 1, 1). We derive its leading normal form (t- x) (xL₁²+ (t- x) L₀²) and prove a sharp degree dichotomy. The aligned case =0 requires coefficient degree at least five, whereas every oblique case 0 is realized by an explicit primitive quartic family of square cost ten. Thus the quartic obstruction is alignment, not return itself. These results do not classify all labelled exceptional trees or moving-root branch maps.
Ueoka et al. (Mon,) studied this question.