The chained index problem requires Ω(n) bits of communication to solve optimally, irrespective of the number of chained instances.
There is no randomized constant-cost communication problem that is complete for the class of problems with constant-cost randomized protocols (BPP0). Additionally, the k-Hamming Distance problems form an infinite hierarchy within BPP0.