Asymptotic full revelation in cheap talk with many senders

I construct an equilibrium in a cheap talk game with multiple senders that converges to full revelation exponentially fast as the number of senders increases. The senders' biases can be relatively large (comparable to the size of the state space) and have any signs. The equilibrium is robust to replacement noise and exists even if the senders can send only two types of messages.