0

BSBench: will your LLM find the largest prime number?

A benchmark for evaluating LLMs on questions without reasonable answers reveals suboptimal performance of existing models.

Year
2025
Venue
arXiv 2025
Authors
1
Hosting
Abstract onlyARXIV-DEFAULT

Cite

Notes

Only stored in your browser.

Attribution

Abstract & full text
arxiv.org/abs/2506.04535ARXIV-DEFAULT
TL;DR
Semantic Scholar
Attribution policy →

Abstract

We propose that benchmarking LLMs on questions which have no reasonable answer actually isn't as silly as it sounds. We also present a benchmark that allows such testing and a method to modify the existing datasets, and discover that existing models demonstrate a performance far from the perfect on such questions. Our code and data artifacts are available at https://github.com/L3G5/impossible-bench

Authors

1