{"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/minimax-m1-scaling-test-time-compute","title":"MiniMax-M1: Scaling Test-Time Compute Efficiently with Lightning Attention","arxiv_id":"2506.13585","date":"2025-06-16","proceeding":null,"authors":["MiniMax",":","Aili Chen","Aonian Li","Bangwei Gong","Binyang Jiang","Bo Fei","Bo Yang","Boji Shan","Changqing Yu","Chao Wang","Cheng Zhu","Chengjun Xiao","Chengyu Du","Chi Zhang","Chu Qiao","Chunhao Zhang","Chunhui Du","Congchao Guo","Da Chen","Deming Ding","Dianjun Sun","Dong Li","Enwei Jiao","Haigang Zhou","Haimo Zhang","Han Ding","Haohai Sun","HaoYu Feng","Huaiguang Cai","Haichao Zhu","Jian Sun","Jiaqi Zhuang","Jiaren Cai","Jiayuan Song","Jin Zhu","Jingyang Li","Jinhao Tian","Jinli Liu","Junhao Xu","Junjie Yan","Junteng Liu","Junxian He","Kaiyi Feng","Ke Yang","Kecheng Xiao","Le Han","Leyang Wang","Lianfei Yu","Liheng Feng","Lin Li","Lin Zheng","Linge Du","Lingyu Yang","Lunbin Zeng","Minghui Yu","Mingliang Tao","Mingyuan Chi","Mozhi Zhang","Mujie Lin","Nan Hu","Nongyu Di","Peng Gao","Pengfei Li","Pengyu Zhao","Qibing Ren","Qidi Xu","Qile Li","Qin Wang","Rong Tian","Ruitao Leng","Shaoxiang Chen","Shaoyu Chen","Shengmin Shi","Shitong Weng","Shuchang Guan","Shuqi Yu","Sichen Li","Songquan Zhu","Tengfei Li","Tianchi Cai","Tianrun Liang","Weiyu Cheng","Weize Kong","Wenkai Li","Xiancai Chen","Xiangjun Song","Xiao Luo","Xiao Su","Xiaobo Li","Xiaodong Han","Xinzhu Hou","Xuan Lu","Xun Zou","Xuyang Shen","Yan Gong","Yan Ma","Yang Wang","Yiqi Shi","Yiran Zhong","Yonghong Duan","Yongxiang Fu","Yongyi Hu","Yu Gao","Yuanxiang Fan","Yufeng Yang","Yuhao Li","Yulin Hu","Yunan Huang","Yunji Li","Yunzhi Xu","Yuxin Mao","Yuxuan Shi","Yuze Wenren","Zehan Li","Zelin Li","Zhanxu Tian","Zhengmao Zhu","Zhenhua Fan","Zhenzhen Wu","Zhichao Xu","Zhihang Yu","Zhiheng Lyu","Zhuo Jiang","Zibo Gao","Zijia Wu","Zijian Song","Zijun Sun"],"abstract":"We introduce MiniMax-M1, the world's first open-weight, large-scale hybrid-attention reasoning model. MiniMax-M1 is powered by a hybrid Mixture-of-Experts (MoE) architecture combined with a lightning attention mechanism. The model is developed based on our previous MiniMax-Text-01 model, which contains a total of 456 billion parameters with 45.9 billion parameters activated per token. The M1 model natively supports a context length of 1 million tokens, 8x the context size of DeepSeek R1. Furthermore, the lightning attention mechanism in MiniMax-M1 enables efficient scaling of test-time compute. These properties make M1 particularly suitable for complex tasks that require processing long inputs and thinking extensively. MiniMax-M1 is trained using large-scale reinforcement learning (RL) on diverse problems including sandbox-based, real-world software engineering environments. In addition to M1's inherent efficiency advantage for RL training, we propose CISPO, a novel RL algorithm to further enhance RL efficiency. CISPO clips importance sampling weights rather than token updates, outperforming other competitive RL variants. Combining hybrid-attention and CISPO enables MiniMax-M1's full RL training on 512 H800 GPUs to complete in only three weeks, with a rental cost of just $534,700. We release two versions of MiniMax-M1 models with 40K and 80K thinking budgets respectively, where the 40K model represents an intermediate phase of the 80K training. Experiments on standard benchmarks show that our models are comparable or superior to strong open-weight models such as the original DeepSeek-R1 and Qwen3-235B, with particular strengths in complex software engineering, tool utilization, and long-context tasks. We publicly release MiniMax-M1 at https://github.com/MiniMax-AI/MiniMax-M1.","url_abs":"https://arxiv.org/abs/2506.13585v1","url_pdf":"https://arxiv.org/pdf/2506.13585v1.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":"minimax-m1-scaling-test-time-compute","repo_url":"https://github.com/minimax-ai/minimax-m1","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"mixture-of-experts","task_name":"Mixture-of-Experts"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2506.13585","atlas_url":"https://app.syntology.ai/?focus=2506.13585","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.13585"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2506.13585"},"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":"2506.13585"},"call":"get_harvested_code_for_paper(arxiv_id=\"2506.13585\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2506.13585"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2506.13585\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2506.13585"},"call":"get_concepts_for_paper(arxiv_id=\"2506.13585\")"}],"by_repo":[{"repo":"minimax-ai/minimax-m1","kind":"official","samples":3,"ran":3,"instrument":2,"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/2506.13585.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/2506.13585.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/minimax-ai/minimax-m1","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"ran_draft_wrong":2,"ran_violates":1},"n_samples":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"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":3,"ran":3,"n_ran_checked":1,"n_instrument":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,"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":2,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-25","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","census_is":"Syntology's function-name census ran implementations with this entry name on one shared input per bucket (the positional rank, kind and dtype of each array argument) and counted the distinct output digests (sha256 of the output rounded to 6 decimals). implementations and papers count the compared samples; distinct_outputs counts digests across all buckets; n_buckets is how many shared inputs were used. It is not a statement that any two samples compute one thing, and the name is a string, not an identity.","samples":[{"code_sha256":"5e3dd6e650adb72c","code_sha256_prefix":"5e3dd6e650adb72c","entry":"get_activation_fn","repo":"minimax-ai/minimax-m1","repo_kind":"official","path":"modeling_minimax_m1.py","file_url":"https://github.com/minimax-ai/minimax-m1/blob/HEAD/modeling_minimax_m1.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"activation:str/0/str","fixture_out_type":"builtin_function_or_method","level_recorded_at":"2026-09-25T16:13:10.526492+00:00","code_page":"/code/get-activation-fn","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5e3dd6e650adb72c"}},{"code_sha256":"2d7fb5c16b69ee87","code_sha256_prefix":"2d7fb5c16b69ee87","entry":"load_balancing_loss_func","repo":"minimax-ai/minimax-m1","repo_kind":"official","path":"modeling_minimax_m1.py","file_url":"https://github.com/minimax-ai/minimax-m1/blob/HEAD/modeling_minimax_m1.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"gate_logits:tuple/1/Tensor, num_experts:int/0/int, top_k:int/0/int, attention_mask:Tensor/2/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T16:13:10.526492+00:00","code_page":"/code/load-balancing-loss-func","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2d7fb5c16b69ee87"}},{"code_sha256":"b99eea6376d1e212","code_sha256_prefix":"b99eea6376d1e212","entry":"rotate_half","repo":"minimax-ai/minimax-m1","repo_kind":"official","path":"modeling_minimax_m1.py","file_url":"https://github.com/minimax-ai/minimax-m1/blob/HEAD/modeling_minimax_m1.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"x:Tensor/2/float","fixture_out_type":"Tensor","retrieve_with":{"tool":"get_code","code_sha256":"b99eea6376d1e212"},"code_page":"/code/rotate-half","census":{"url":"/census/rotate-half","implementations":24,"papers":96,"distinct_outputs":4,"n_buckets":2,"bucket_key":[[2,"float","float32"]],"bucket_index":1,"bucket_label":"arg 1: rank 2, kind float, dtype float32"},"census_bucket_fragment":"bucket-1","licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b99eea6376d1e212"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"dba7acb1b9eee46e54b3da950cc774a8179f5ac9160553ee01d1ff5ffe9079b0","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}