What problem does it solve? Searching for nearest neighbors across millions or billions of embedding vectors is too slow with brute-force methods, and this Skill provides guidance for building fast approximate similarity search indexes with FAISS. ## Core Features & Use Cases - Index Selection Guidance: Choose between Flat, IVF, HNSW, and Product Quantization index types based on dataset size, memory limits, and accuracy requirements. - GPU Acceleration: Move indexes to single or multiple GPUs for 10-100x faster search on large vector datasets. - Framework Integration: Connect FAISS indexes with LangChain and LlamaIndex vector stores for RAG pipelines. - Use Case: Build a retrieval-augmented generation system that stores one million document embeddings in an HNSW index, then retrieves the five most relevant chunks for each user query in milliseconds. ## Quick Start Use the faiss skill to create an index for my embedding vectors and find the five nearest neighbors for a query vector.