binary plus rescoring

Also written: binary codes with rescoring

A way to save memory: pick about 100 candidates using tiny 1-bit codes, then re-score only those with the full-precision vectors kept on disk. This can recover the recall of an exact search while storing far less in memory.