Open
Description
Binary quantization and hamming distance are critical for scaling multi-vector representations (i.e., Colbert).
It looks as though hamming for binary vectors has already been implemented.
While a hamming-based maxsim can be implemented over this with a postgres function per approach here, is this something that might be supported/optimized within the library?
Beyond this, is an unpack_bits operation to convert a binary vector into a float representation (to improve accuracy in a subsequent rerank step) something contemplated?