Addendum frozen before screen computations. Retain height through its exact odd-bit count, not through a rounded real number. Check every fixed-length cell through H=22 by independent complete-block and literal bit DPs. The Markov endpoint-factor audit is exhaustive through 12 bits for two rational proxies. For a finite illustration of unfinished Haar paths use n=16,32,64, H=floor(mu n), and a terminal precision T=6n+8. Compare a forward positive-prefix census at H with a backward exact recurrence for eventual success by T. Retain lower resolved and upper unresolved weights and both deficit/height distributions. The illustration has no arithmetic claim about future integer trajectories. CPU only, 90-second budget.
