BrowseComp
BrowseComp is a benchmark of hard-to-find but easy-to-verify questions that require an agent to search the web persistently and creatively, often across many pages, to locate an entangled piece of information.
Description
Answers are short so grading is simple, while finding them can take a person hours. It measures the persistence and search strategy of browsing and deep-research agents rather than knowledge the model already has.
Sources
- Wei et al. (2025). BrowseComp: A Simple Yet Challenging Benchmark for Browsing Agents.
Cite this entry
Protologue. (2026). BrowseComp. In Protologue: A Taxonomy of Prompting and LLM Techniques (v1.4.0, PTL-0207). https://protologue.com/t/browsecomp/
BibTeX
@misc{protologue_browsecomp,
title = {BrowseComp},
author = {{Protologue}},
year = {2026},
howpublished = {Protologue: A Taxonomy of Prompting and LLM Techniques, v1.4.0},
note = {Entry PTL-0207},
url = {https://protologue.com/t/browsecomp/}
}New terms, as they're coined
One email a week with the newest techniques, each defined and sourced like this entry.
Delivered through Beehiiv. Unsubscribe from any issue.