What problem does it solve? Performing nearest-neighbor search over millions or billions of dense embedding vectors is computationally expensive with naive approaches, and this Skill provides guidance for building fast, memory-efficient similarity search indexes with FAISS. ## Core Features & Use Cases - Index Type Selection: Covers Flat, IVF, HNSW, and Product Quantization indexes with guidance on choosing based on dataset size, accuracy, and memory constraints. - GPU Acceleration: Shows how to move indexes to single or multiple GPUs for 10-100x faster search on large datasets. - Framework Integration: Includes LangChain and LlamaIndex integration patterns for RAG pipelines, plus index save/load for persistence. - Use Case: When building a semantic search system over 5 million document embeddings, use this Skill to create an HNSW index, tune efSearch for the right speed/accuracy balance, and persist the trained index to disk. ## Quick Start Ask the AI to create a FAISS index for your embedding vectors and run a k-nearest-neighbor search on a sample query.