The hinge problem is that of finding a lower bound on the number of equivalence classes of hinges, pairs of distances relative to a point. In this talk, the method used by Guth and Katz to convert the Erdős distinct distance problem into a series of point-line incidence bounds is applied to the hinge problem. However, some of the controlling quantities for the resulting incidence problems, if known, imply the expected lower bound by themselves.