Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes correcting $pn$ adversarial binary Hamming errors with optimal communication complexity and entropy loss $n(h(p) + o(1))$ bits, where $n$ is the length of the strings and $h( )$...