Is linear sketching over F2 optimal for one-way XOR communication?
Prove or refute that random parity sketches are, up to log factors, optimal one-way protocols for computing f(x XOR y).
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.