That this works is fascinating but also hugely useful.
In-between solutions probably work too. Quantize data to arbitrary complexity /
Compute trade offs —> manage accuracy and speed in vector search
TIL about binary vector search... apparently there's a trick where you can take an embedding vector like [0.0051, 0.017, -0.0186, -0.0185...] and turn that into a binary vector just reflecting if each value is > 0 - so [1, 1, -1, -1, ...] and still get useful cosine similarities!