{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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":{"syntology_url":"https://syntology.ai/paper/2504.11239","atlas_url":"https://app.syntology.ai/?focus=2504.11239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.11239"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2504.11239"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2504.11239"},"call":"get_harvested_code_for_paper(arxiv_id=\"2504.11239\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2504.11239"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2504.11239\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2504.11239"},"call":"get_concepts_for_paper(arxiv_id=\"2504.11239\")"}],"by_repo":[{"repo":"smu-diga/nppc","kind":"official","samples":11,"ran":11,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2504.11239.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2504.11239.svg"},"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":9,"ran_honours":2},"n_samples":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":11,"ran":11,"n_ran_checked":11,"n_instrument":0,"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,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":11,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"461b981a90fb531b","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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"scores:ndarray/2/float","fixture_out_type":"float32","level_recorded_at":"2026-09-25T00:28:05.031210+00:00","code_page":"/code/aggregate-mean","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"461b981a90fb531b"}},{"code_sha256":"fd99e9c04db68232","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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"scores:ndarray/2/float","fixture_out_type":"float32","level_recorded_at":"2026-09-25T04:00:33.621019+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fd99e9c04db68232"}},{"code_sha256":"fc0088dbd27b8a41","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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"scores:ndarray/2/float, gamma:float/0/float","fixture_out_type":"float32","level_recorded_at":"2026-09-25T04:00:33.621019+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fc0088dbd27b8a41"}},{"code_sha256":"5cf86280ac4bfa6d","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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"reasoning_content:str/0/str","fixture_out_type":"int","level_recorded_at":"2026-09-25T04:30:57.282821+00:00","retrieve_with":{"tool":"get_code","code_sha256":"5cf86280ac4bfa6d"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5cf86280ac4bfa6d"}},{"code_sha256":"0c8d0f21f1efaffc","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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"response:str/0/str","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T00:28:05.031210+00:00","retrieve_with":{"tool":"get_code","code_sha256":"0c8d0f21f1efaffc"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0c8d0f21f1efaffc"}},{"code_sha256":"43161e0713078895","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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"response:str/0/str","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T04:00:33.621019+00:00","retrieve_with":{"tool":"get_code","code_sha256":"43161e0713078895"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"43161e0713078895"}},{"code_sha256":"3a130a325421dbbf","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,"signature":"scores:ndarray/2/float, tau:float/0/float","fixture_out_type":"float64","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"3a130a325421dbbf"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3a130a325421dbbf"}},{"code_sha256":"9c1c086fe9a3e62d","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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"point_estimates:dict/0/?, interval_estimates:dict/0/?, metric_names:list/1/str, algorithms:list/1/str, colors:dict/0/?, color_palette:str/0/str, max_ticks:int/0/int, subfigure_width:float/0/float, row_height:float/0/float, xlabel_y_coordinate:float/0/float, xlabel:str/0/str","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T23:57:41.519889+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"9c1c086fe9a3e62d"}},{"code_sha256":"c3dcd4c360344bd2","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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"performance_profiles:dict/0/?, tau_list:ndarray/1/float, performance_profile_cis:dict/0/?, use_non_linear_scaling:bool/0/bool, ax:Axes/0/?, colors:dict/0/?, color_palette:str/0/str, alpha:float/0/float, figsize:tuple/1/int, xticks:NoneType/0/?, yticks:list/1/int, xlabel:str/0/str, ylabel:str/0/str, linestyles:dict/0/?, labelsize:str/0/str, ticklabelsize:str/0/str, legend:bool/0/bool, grid_alpha:float/0/float, legendsize:str/0/str, wrect:int/0/int, hrect:int/0/int","fixture_out_type":"Axes","level_recorded_at":"2026-09-24T23:57:41.519889+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c3dcd4c360344bd2"}},{"code_sha256":"56fdd6b7be13ead4","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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"frames:ndarray/1/int, point_estimates:dict/0/?, interval_estimates:dict/0/?, algorithms:NoneType/0/?, colors:NoneType/0/?, color_palette:str/0/str, figsize:tuple/1/int, xlabel:str/0/str, ylabel:str/0/str, ax:Axes/0/?, labelsize:str/0/str, ticklabelsize:str/0/str, marker:str/0/str, linewidth:int/0/int, legend:bool/0/bool, grid_alpha:float/0/float, legendsize:str/0/str, wrect:int/0/int, hrect:int/0/int","fixture_out_type":"Axes","level_recorded_at":"2026-09-25T00:28:05.031210+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"56fdd6b7be13ead4"}},{"code_sha256":"10c95803c98940ec","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,"signature":"scores:ndarray/1/float, tau:float/0/float","fixture_out_type":"float64","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"10c95803c98940ec"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"10c95803c98940ec"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"baa0e2000f1b664a73794ab90bbe6d8695f0c888e76b390de827448e48e0ec20","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}