New benchmarks for approximate nearest neighbors

One of my super nerdy interests include approximate algorithms for nearest neighbors in high-dimensional spaces. You have say 1M points in some high-dimensional space. Now given a query point, can you find the nearest points out of the 1M set? Doing this fast turns out to be tricky. I'm the author of Annoy which has more than 3,000 stars on Github.