Under the auspices of the Computational Complexity Foundation (CCF)
I give a very simple, apparently new proof of a tight communication lower bound for pointer chasing.