This article proves strong lower bounds for distributed computing in the congest model, by presenting bit-gadget : a new technique constructing graphs with small cuts. The contribution of bit-gadgets is twofold. First, developing careful sparse graph constructions cuts extends known techniques to show near-linear bound diameter, result previously only dense graphs. Moreover, sparseness construc...