benchmarks-and-tests · 2026-09-10

How Deskworth defines a valid benchmark

Eleven conditions, written before we have a single score, so that no score can be published without them.

Primary sources, read and citedDeskworth · published · updated · 4 sources

Publishing the conditions before the result is the only way to keep them honest. Once a number exists, every missing condition becomes negotiable.

#The line that gets skipped most often

“Which model?” is usually answered with a family name. A family name is not a model. Endpoints change under a stable label, so the exact identifier and the date of the run are two separate requirements, and both are mandatory.

#The line that hides the most variance

Retrieval. On an open-book financial benchmark, most of the spread between two reported results comes from how the passage was found, not from the model that read it. A result that does not describe its retrieval component is a result about an undisclosed system.

#Licences are part of the protocol

Two of the four sets we catalogue are non-commercial, and one forbids derivative works. That constrains what may be redistributed and what may be adapted, and it has to be checked before a run rather than after publication.

Still missingDeskworth has not run any benchmark. The catalogue publishes the protocol the next core pass will follow.

#Sources

  1. czyssrs/FinQA — official repositoryZhiyu Chen et al.official repository · read 2026-09-10 · MIThttps://github.com/czyssrs/FinQA
  2. NExTplusplus/TAT-QA — official repositoryNExT++, National University of Singaporeofficial repository · read 2026-09-10 · dataset CC BY 4.0 · code MIThttps://github.com/NExTplusplus/TAT-QA
  3. PatronusAI/financebench — dataset cardPatronus AIdataset card · read 2026-09-10 · CC BY-NC-ND 4.0https://huggingface.co/datasets/PatronusAI/financebench
  4. BizBench: A Quantitative Reasoning Benchmark for Business and FinanceRik Koncel-Kedziorski, Michael Krumdick, Viet Lai, Varshini Reddy, Charles Lovering, Chris Tannerpeer-reviewed paper · arXiv:2311.06602v2 · revised 2024-03-12 · published 2023-11-11 · read 2026-09-10 · CC BY-NC-SA 4.0https://arxiv.org/abs/2311.06602

Read next