Add Terminal-Bench verifiable open problems

#1
by AllenGrahamHart - opened

Adds a curated collection of finite, objectively verifiable open problems developed for Terminal-Bench Challenges.

This contribution:

  • adds 18 new records (TBV-001 through TBV-018);
  • enriches the existing Conway 99-graph and degree-diameter records with dated status information and concrete finite formulations;
  • adds a dedicated dataset set for these records;
  • includes optional exact witness checkers, Lean statements where available, and dated status/source notes under verification/terminal-bench/; and
  • synchronizes both denormalized JSON exports, aggregate statistics, and the dataset card.

The 20 problems span combinatorics, graph theory, coding theory, cryptography, algebraic complexity, lattices, and finite computational challenges. Each was audited against the public literature and record sources on 31 July 2026. The supplementary verification files are isolated from the dataset loader and are included to make the finite formulations and conventions independently auditable.

Validation performed before submission:

  • problems.json exactly matches dataset.json["problems"];
  • all IDs, set links, counters, and aggregate statistics are consistent;
  • the synchronization script is idempotent;
  • all 20 Python checkers parse successfully; and
  • all 15 Lean statements are free of sorry/admit placeholders.
Ready to merge
This branch is ready to get merged automatically.

Sign up or log in to comment