What problem does it solve? Performing nearest-neighbor search over millions or billions of dense embedding vectors is too slow with brute-force methods, and many vector databases add unnecessary overhead when you only need pure similarity search without metadata filtering. ## Core Features & Use Cases - Multiple Index Types: Choose from Flat (exact), IVF (clustered approximate), HNSW (graph-based), and PQ (memory-compressed) indices to balance speed, accuracy, and memory. - GPU Acceleration: Move indices to single or multiple GPUs for 10-100x faster search on large datasets. - Framework Integration: Works with LangChain and LlamaIndex for RAG pipelines, with save/load support for trained indices. - Use Case: Build a semantic search engine over 10 million document embeddings by training an IVFPQ index, saving it to disk, and serving low-latency k-NN queries. ## Quick Start Use the faiss skill to create an HNSW index over my embedding vectors and find the 5 nearest neighbors for a query vector.