the unit distance problem asks: given $n$ points in $\mathbb r^d$, how many pairs of points can have distance one? this problem can be re-phrased as a question in incidence geometry, and standard machinery from that field leads to certain non-optimal bounds. i will discuss some recent progress on the unit distance problem in three dimensions that goes beyond the standard tools of incidence geometry.