Independent proof audit of parent sharpening — PASS

For validated odd-Collatz k-prefix from n>=3, let D_k=2k-S_k. If integerC>=0,
k>=max(1,3C), and D_k<=C, a prefix has descended.

For oddn>=7, 4n/(3n+1)>=14/11 and(14/11)^3=2744/1331>2. Therefore forC>=1,
 2^S*n^k/(3n+1)^k >=2^-C*(14/11)^k >1.
The existing integer source guard certifies descent. ForC0, k>=1 likewise
gives strict ratio>1. Handle smaller sources explicitly: n5descendsat1;
n3descendsat2. Its only potentially premature allowed casek1,C0 hasD1=1>0,
so the antecedent fails. This covers all positive oddn>=3.

Exact2C fails: n11,word(1,2),states11,17,13, k2,S3,D1=D2=1,C1.
There has been no descent at proposed2C=2. Thus3 is the least possible
UNIVERSAL INTEGER coefficient in this particular conditional linear-clock
form. No optimality claim for real coefficients or other clock forms follows.

This improves my earlier4C bound; use3C in the final assembled result.
The missing task remains an independently proved bound on the actual future
deficit. No such global invariant has been supplied.
