{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/nondeterministic-polynomial-time-problem","title":"Nondeterministic Polynomial-time Problem Challenge: An Ever-Scaling Reasoning Benchmark for LLMs","arxiv_id":"2504.11239","date":"2025-04-15","proceeding":null,"authors":["Chang Yang","Ruiyu Wang","Junzhe Jiang","Qi Jiang","Qinggang Zhang","Yanchen Deng","Shuxin Li","Shuyue Hu","Bo Li","Florian T. Pokorny","Xiao Huang","Xinrun Wang"],"abstract":"Reasoning is the fundamental capability of large language models (LLMs). Due to the rapid progress of LLMs, there are two main issues of current benchmarks: i) these benchmarks can be crushed in a short time (less than 1 year), and ii) these benchmarks may be easily hacked. To handle these issues, we propose the ever-scalingness for building the benchmarks which are uncrushable, unhackable, auto-verifiable and general. This paper presents Nondeterministic Polynomial-time Problem Challenge (NPPC), an ever-scaling reasoning benchmark for LLMs. Specifically, the NPPC has three main modules: i) npgym, which provides a unified interface of 25 well-known NP-complete problems and can generate any number of instances with any levels of complexities, ii) npsolver: which provides a unified interface to evaluate the problem instances with both online and offline models via APIs and local deployments, respectively, and iii) npeval: which provides the comprehensive and ready-to-use tools to analyze the performances of LLMs over different problems, the number of tokens, the aha moments, the reasoning errors and the solution errors. Extensive experiments over widely-used LLMs demonstrate: i) NPPC can successfully decrease the performances of advanced LLMs' performances to below 10%, demonstrating that NPPC is uncrushable, ii) DeepSeek-R1, Claude-3.7-Sonnet, and o1/o3-mini are the most powerful LLMs, where DeepSeek-R1 outperforms Claude-3.7-Sonnet and o1/o3-mini in most NP-complete problems considered, and iii) the numbers of tokens, aha moments in the advanced LLMs, e.g., Claude-3.7-Sonnet and DeepSeek-R1, are observed first to increase and then decrease when the problem instances become more and more difficult. We believe that NPPC is the first ever-scaling reasoning benchmark, serving as the uncrushable and unhackable testbed for LLMs toward artificial general intelligence (AGI).","url_abs":"https://arxiv.org/abs/2504.11239v1","url_pdf":"https://arxiv.org/pdf/2504.11239v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"nondeterministic-polynomial-time-problem","repo_url":"https://github.com/smu-diga/nppc","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2504.11239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.11239"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/smu-diga/nppc","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_honours":2,"unverified":9},"by_repo_kind":{"official":{"samples":11,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"3a130a325421dbbf","entry":"mean_score_deviation","repo":"smu-diga/nppc","repo_kind":"official","path":"npeval/library.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npeval/library.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3a130a325421dbbf"}},{"code_sha256_prefix":"10c95803c98940ec","entry":"run_score_deviation","repo":"smu-diga/nppc","repo_kind":"official","path":"npeval/library.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npeval/library.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"10c95803c98940ec"}},{"code_sha256_prefix":"461b981a90fb531b","entry":"aggregate_mean","repo":"smu-diga/nppc","repo_kind":"official","path":"npeval/metrics.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npeval/metrics.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"461b981a90fb531b"}},{"code_sha256_prefix":"fd99e9c04db68232","entry":"aggregate_median","repo":"smu-diga/nppc","repo_kind":"official","path":"npeval/metrics.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npeval/metrics.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fd99e9c04db68232"}},{"code_sha256_prefix":"fc0088dbd27b8a41","entry":"aggregate_optimality_gap","repo":"smu-diga/nppc","repo_kind":"official","path":"npeval/metrics.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npeval/metrics.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fc0088dbd27b8a41"}},{"code_sha256_prefix":"5cf86280ac4bfa6d","entry":"check_aha_number","repo":"smu-diga/nppc","repo_kind":"official","path":"plottings/main_aha.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/plottings/main_aha.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5cf86280ac4bfa6d"}},{"code_sha256_prefix":"0c8d0f21f1efaffc","entry":"extract_solution_from_response","repo":"smu-diga/nppc","repo_kind":"official","path":"npsolver/solver.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npsolver/solver.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0c8d0f21f1efaffc"}},{"code_sha256_prefix":"43161e0713078895","entry":"extract_solution_from_response_old","repo":"smu-diga/nppc","repo_kind":"official","path":"npsolver/solver.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npsolver/solver.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"43161e0713078895"}},{"code_sha256_prefix":"9c1c086fe9a3e62d","entry":"plot_interval_estimates","repo":"smu-diga/nppc","repo_kind":"official","path":"npeval/plot_utils.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npeval/plot_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9c1c086fe9a3e62d"}},{"code_sha256_prefix":"c3dcd4c360344bd2","entry":"plot_performance_profiles","repo":"smu-diga/nppc","repo_kind":"official","path":"npeval/plot_utils.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npeval/plot_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c3dcd4c360344bd2"}},{"code_sha256_prefix":"56fdd6b7be13ead4","entry":"plot_sample_efficiency_curve","repo":"smu-diga/nppc","repo_kind":"official","path":"npeval/plot_utils.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npeval/plot_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"56fdd6b7be13ead4"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}