Prospective post-submission diagnostic, 7 November 15:54 UTC.
Use independently uniform run-length compositions to sample an exact fixed prefix cell, then reject coefficient descents and sources outside the bit-length H shell. H in {128,256,512}, A=ceil(H/log2 3)+floor(sqrt(H)/2), K=round(H/4.15359670285), last=0. For a start1/end0 word, each symbol has K+1 positive runs. Uniform cut sets generate uniform compositions and hence uniform words within the type. Max 240000 proposals or 2048 accepted per H, max total wall 120 seconds. Record deep endpoint bits at offset floor(H^0.8)-3, width3, and one complex cyclic character at modulus2^floor(H^0.8). Compare counts to uniform only descriptively, preserve sample counts and seeds, no fitted rate. Verify source word and endpoint for first12 accepted per H by literal recurrence, verify last bit, odd count and confirmation count. This experiment is separate from the submitted proof and exact supplement.

