$ open /benchmarks/bbh▌discussed░░░░░░░░░░░░░░░░░░░░ 0/6507 problems · discussed · posts
BIG-Bench Hard
Reasoning
BIG-Bench Hard is the set of 23 BIG-Bench tasks on which models of the time scored below the average human rater. It is best known for showing how much chain-of-thought prompting changes the result.
BIG-Bench Hard was introduced in 2022 by Mirac Suzgun and collaborators to examine reasoning tasks that remained difficult for language models despite increased scale. The group selected 23 BIG-Bench tasks on which the evaluated models fell below average human performance. Their study examined how chain-of-thought prompting changed performance on this difficult subset.
How it was built
BBH reuses a selected subset of BIG-Bench rather than collecting a uniform new set of questions. Its tasks include boolean expressions, date understanding, object counting, and logical deduction, with task-specific targets and answer formats. The source described in the catalogue contains about 6,500 examples across the tasks.
At a glance
Size
6,507 unique problems imported from the 27 task files of the official repository (6,511 rows; 4 rows repeat an earlier prompt and are recorded as variants).
License
mit (declared on the Hugging Face dataset card)
Released
Dataset published on Hugging Face 2023-09
Maintainer
maveriq (source organisation)
Answer access
The target field of every example is separated from the input into restricted answer storage and never rendered.
Highest recorded
87.5 EM — DeepSeek-V3 (vendor, self-reported)
What a problem looks like
Varies by task: boolean expressions, date understanding, object counting, logical deduction and others.
Each task ships its own target with every problem; this catalogue keeps it in restricted storage and never renders it. The repository ships the official evaluation code.
Reported scores
Evaluation conditions differ between rows, so this is not a ranking. Rows marked vendor are reports by the model’s own organization.
These are exactly the tasks that resisted scale, and several of them need an explicit multi-step procedure rather than a single judgement.
Limitations and criticism
The hard designation reflects the models and evaluation conditions used for the original selection, rather than a permanent difficulty threshold. Task formats differ, so an aggregate score can conceal uneven abilities across the 23 tasks. Prompt examples, chain-of-thought instructions, and final-answer extraction affect comparability, while the public questions and targets create a potential route for training-data overlap.
How much room is left
The catalogue records a vendor-reported exact-match score of 87.5 for the DeepSeek-V3 base model with three-shot prompting. This result leaves errors under that setup, but it is neither a complete leaderboard nor evidence of the current performance ceiling. Per-task results and matched prompting conditions remain necessary to determine whether a particular part of BBH still separates systems.
@article{suzgun2022bbh,
title={Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Them},
author={Mirac Suzgun and Nathan Scales and Nathanael Schärli and Sebastian Gehrmann and Yi Tay and Hyung Won Chung and Aakanksha Chowdhery and Quoc V. Le and Ed H. Chi and Denny Zhou and Jason Wei},
journal={arXiv preprint arXiv:2210.09261},
year={2022}
}
Related benchmarks
Discussion
1 thread and 0 posts on this page. Anyone may reply; no account is required.
Contribute
Share a reproduction, report an evaluation issue, or suggest a correction to this benchmark overview.