A library for efficient similarity search and clustering of dense vectors.

★ 41,706⑂ 4,643👁 496⑃ 2,774● 2,835▤ 30
C++MITCreated 2017-02-07faiss.ai
Download: v1.16.0v1.16.0 ↓1.16.02026-11-10
+46
Daily
+437
Weekly
+583
Monthly
41,706
stars
4,643
forks
496
watchers
2,774
prs
2,835
issues
30
releases

README

Faiss

Faiss is a library for efficient similarity search and clustering of dense vectors. It contains algorithms that search in sets of vectors of any size, up to ones that possibly do not fit in RAM. It also contains supporting code for evaluation and parameter tuning. Faiss is written in C++ with complete wrappers for Python/numpy. Some of the most useful algorithms are implemented on the GPU. It is developed primarily at Meta's Fundamental AI Research group.

 News

See CHANGELOG.md for detailed information about latest features.

 Introduction

Faiss contains several methods for similarity search. It assumes that the instances are represented as vectors and are identified by an integer, and that the vectors can be compared with L2 (Euclidean) distances or dot products. Vectors that are similar to a query vector are those that have the lowest L2 distance or the highest dot product with the query vector. It also supports cosine similarity, since this is a dot product on normalized vectors.

Some of the methods, like those based on binary vectors and compact quantization codes, solely use a compressed representation of the vectors and do not require to keep the original vectors. This generally comes at the cost of a less precise search but these methods can scale to billions of vectors in main memory on a single server. Other methods, like HNSW and NSG add an indexing structure on top of the raw vectors to make searching more efficient.

The GPU implementation can accept input from either CPU or GPU memory. On a server with GPUs, the GPU indexes can be used a drop-in replacement for the CPU indexes (e.g., replace IndexFlatL2 with GpuIndexFlatL2) and copies to/from GPU memory are handled automatically. Results will be faster however if both input and output remain resident on the GPU. Both single and multi-GPU usage is supported.

 Installing

Faiss comes with precompiled libraries for Anaconda in Python, see faiss-cpu, faiss-gpu and faiss-gpu-cuvs. The library is mostly implemented in C++, the only dependency is a BLAS implementation. Optional GPU support is provided via CUDA or AMD ROCm, and the Python interface is also optional. The backend GPU implementations of NVIDIA cuVS can also be enabled optionally. It compiles with cmake. See INSTALL.md for details.

 How Faiss works

Faiss is built around an index type that stores a set of vectors, and provides a function to search in them with L2 and/or dot product vector comparison. Some index types are simple baselines, such as exact search. Most of the available indexing structures correspond to various trade-offs with respect to

- search time
- search quality
- memory used per index vector
- training time
- adding time
- need for external data for unsupervised training

The optional GPU implementation provides what is likely (as of March 2017) the fastest exact and approximate (compressed-domain) nearest neighbor search implementation for high-dimensional vectors, fastest Lloyd's k-means, and f

Top issues

Discussions

Latest release

v1.16.0 v1.16.0 2026-11-10
[1.16.0] - 2026-11-09

Added
- fc1095a9314f892938bf83f59e7ac966b5095def e-means: add benchmarks reproducing the paper (5845)
- 2079677d10e5f6cf0823acd5aea453389cc866a2 e-means: add max_points_per_centroid (5855)
- 8e5843c5ec8697957276401f1acba0ebec58a329 Add regression test for flat search in a nested OpenMP region (5754)
- b80093c5b290578ed7de1975583e295309b4de81 Add DINO resident and SSD streaming e-means demos (5815)
- 97fdfb09848869f0e4bf09537eb814c3bf86bf49 Add optional IVF assignment for centroid-sharded e-means (5817)
- f6a82dc2fa89ebb34ceb7cce8750f9305d2f17db Add centroid-shard

Snapshot: 2026-11-16T09:23:14Z · Data license Apache-2.0 · JSON