Handwave another optimum congestion proof in the sandbox

I have to show that the optimum queued channel, as defined by the compact tree results in a quotient ring, something that prices. , But, my proof includes a catch and release bit error. Much simpler.  I can show that as the stable significance distribution centers, it become twos bit arithmetic, and that can integer divide with half point bit error carried as a remainder.  But I hand waved the former earlier, and my hands are tired.  Look, the mathematicians will agree with me, we have the automatic S&L nailed, push the go fund me button.