Real systems are assembled
Useful search requires data inspection, indexing, retrieval, filtering, reranking, and output validation.
Benchmark · Search-system engineering
Search-SWE evaluates whether a coding agent can autonomously investigate an environment, construct a search workflow, debug it, and deliver a working system under a fixed budget.
01 · Motivation · Why
Useful search requires data inspection, indexing, retrieval, filtering, reranking, and output validation.
The best solution is not always known in advance. Agents must discover packages, models, tools, and constraints.
A convincing explanation is not enough. The final artifact must build, run, and retrieve the right result.
Can a coding agent turn an information need into a working, reproducible search system?
02 · Search-SWE · What
Given a task, data or information sources, a sandbox, public examples, and hidden tests, the agent must deliver an executable search system.
Search-SWE treats every information need as an end-to-end software-engineering problem.
The benchmark does not pre-select BM25, dense retrieval, RAG, reranking, or an agentic workflow. It evaluates the result produced by the agent under the same execution and resource conditions.
Do not score the plan.
Score the executable result.
03 · Task construction · How
A realistic query, corpus, source collection, or multi-step information requirement.
The same compute, storage, software, model, and network budget is available to every run.
Examples support iteration while hidden queries measure whether the delivered system generalizes.
04 · Tasks
The homepage gives a quick view of six selected tasks across implementation, optimization, and repair. Select any card to open its detailed task brief.
Recognize when query rewriting is needed and turn noisy natural language into a retrieval-ready query.
query understanding →Search a 1.5M-vector corpus while balancing memory, index size, quality, and query latency.
large-scale dense search →Improve Cross-Encoder reranking when the relevant evidence lies beyond the first 512 tokens.
reranking →Improve a fixed-backbone code-retrieval embedder on supplied training data.
representation learning →Repair the Pyserini BM25 pipeline so a Korean corpus is indexed and queried correctly.
retrieval debugging →Fix the local FlagEmbedding integration so automatic model loading produces valid retrieval embeddings.
integration debugging →05 · Evaluation setting
Can the system build its index or required assets in a clean sandbox?
Are inputs, outputs, IDs, ordering, and edge cases handled correctly?
Does the returned Top-k list contain a verified positive result?
Does the run stay within the time, memory, disk, GPU, and network budget?
06 · Results
Results will be added as public tasks and baseline submissions become available.
The first release will include task specifications, baseline systems, and reproducible evaluation reports.
Follow developmentSearch-SWE