OpenSearch 3.6, released this month, delivers a massive 32x memory reduction for vector search and introduces the SEISMIC algorithm for neural sparse retrieval—moves that position the open-source platform as the default data layer for AI agents and semantic applications.
The update, following closely on the heels of OpenSearch 3.5 in February, comes as engineering teams increasingly turn to their existing OpenSearch deployments for AI workloads beyond traditional log analytics and enterprise search.
“Most of the engineering teams I work with started with open source OpenSearch for log analytics and enterprise search. But as their requirements have since shifted to semantic retrieval and agent memory, they’re now trying to figure out just how much of that AI application stack they can consolidate onto infrastructure they already run,” said the project’s technical lead.
Background
OpenSearch began as an open-source fork of Elasticsearch, targeting log analysis and enterprise search. Over the past year, as generative AI and agent-based systems demanded efficient vector storage and retrieval, the project accelerated native support for dense and sparse vector search.
Earlier versions introduced the knn_vector field type for approximate nearest neighbor (ANN) search, but scaling to production AI workloads required reducing memory footprint and improving precision for exact-term queries. Version 3.5 laid groundwork; 3.6 delivers the breakthroughs.
What This Means
Better Binary Quantization (BBQ), integrated from the Lucene project in OpenSearch 3.6, compresses high-dimensional float vectors into compact binary representations derived from RaBitQ. The result: a 32x reduction in memory footprint without sacrificing accuracy.
“On the Cohere-768-1M dataset, BBQ recall at 100 results is 0.63, compared to 0.30 for Faiss Binary Quantization. With oversampling and rescoring, it exceeds 0.95 on large production datasets,” the technical lead noted. The project plans to make 32x compression the default, eliminating manual tuning.
For term-level precision, OpenSearch 3.6 adds the SEISMIC algorithm for neural sparse approximate nearest neighbor search. While dense semantic search retrieves by meaning, it can miss exact-term relevance. Sparse vector search stores documents as token-weight pairs, enabling precise matches for identifiers or model numbers.
“Most production AI search applications use both. Hybrid search combines dense semantic recall with sparse neural precision, and both field types are built around that pattern in mind,” the lead added.
Key Features in OpenSearch 3.5 and 3.6
- BBQ flat index support for exact-recall workloads.
- SEISMIC algorithm enabling large-scale sparse retrieval without full index scans.
- Default 32x vector compression (planned) to automate memory savings.
Outlook
Organizations already running OpenSearch can now consolidate AI agent memory and semantic search onto existing infrastructure. The updates reduce hardware costs and simplify operations—critical as enterprises scale retrieval-augmented generation (RAG) and agentic workflows.
“The first quarter of 2026 has been very good news on that front,” the technical lead said. “OpenSearch 3.5 and 3.6 are worth understanding if you inherited an OpenSearch deployment and are now being asked to run agents on it.”