SOTAVerified

BSBench: will your LLM find the largest prime number?

2025-06-05Code Available0· sign in to hype

K. O. T. Erziev

Code Available — Be the first to reproduce this paper.

Reproduce

Code

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

Tasks

Reproductions