{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-09-29-lincodeevolve-record-binary-codes/","md":"https://postcutoff.com/e/2026-09-29-lincodeevolve-record-binary-codes/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-09-29-lincodeevolve-record-binary-codes","date":"2026-09-29","date_precision":"day","short_title":"EPFL's LinCodeEvolve (Viazovska, Abbe) finds seven record-breaking binary linear codes with LLM-guided program search","deck":null,"takeaway":null,"category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":[{"n":1,"title":"arXiv 2609.37056: Evolving Towards Better Codes: LLM-Guided Search for High-Distance Binary Linear Codes","url":"https://arxiv.org/abs/2609.37056","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"CodeTables.de (Grassl): bounds on linear codes","url":"http://www.codetables.de","type":"docs","group":"primary","domain":"codetables.de"}],"official":2,"filed":"2026-09-30","updated":"2026-09-30","orgs":["EPFL"],"title":"EPFL's LinCodeEvolve (Viazovska, Abbe) finds seven record-breaking binary linear codes with LLM-guided program search","summary":"On Sept 29, 2026 EPFL researchers Amal Seddas, Vladyslav Shashkov, Maryna Viazovska (Fields Medal 2022) and Emmanuel Abbe posted LinCodeEvolve, an LLM-driven evolutionary program search (built on ShinkaEvolve and EvoTune) that found seven binary linear codes beating the best-known minimum distances in Grassl's CodeTables, e.g. [172,21,66] and [200,21,77]. With standard modifications they improve 22 table entries. Every code was verified by exhaustive enumeration, and the table maintainer checked them. The work applies the FunSearch/AlphaEvolve approach to a classic coding-theory benchmark.","key_facts":["arXiv 2609.37056 [cs.IT], 29 Sep 2026; authors Seddas, Shashkov, Viazovska, Abbe (EPFL)","Seven new record codes: [172,21,66], [173,20,68], [176,21,68], [181,21,70], [184,21,72], [189,22,72], [200,21,77]; six have concise quasi-cyclic descriptions","Standard code modifications extend these to 22 improved entries of the binary tables at codetables.de; 'the results have been checked by the maintainer of the code tables and will be incorporated into them'","Method: an LLM proposes code-construction programs (a chain of oracle, strategist, contract-repair and implementer calls), scored by an exact minimum-distance evaluator; a strategy loop with expert supervision redirects the search when progress plateaus","Comparison: directly prompting GPT-6 Astra at extra-high reasoning effort gave distance 65 for (172,21) vs 66 from LinCodeEvolve; at (200,21) both reached 77, but LinCodeEvolve's code has 25 minimum-weight codewords vs 75","Compute: a single 80 GB H100; each experiment took 3–4 hours on average"],"key_numbers":[],"tags":["math","coding-theory","evolutionary-search","llm-guided-search","ai-for-math","gpt-6-astra"],"science":{"field":"mathematics","subfield":"coding theory","problem":"Improving best-known lower bounds on the minimum distance of binary linear codes (Grassl's CodeTables)","result":"Seven new record binary linear codes (lengths 172–200, dimensions 20–22), improving 22 table entries after standard modifications","open_since":"","ai_system":["LinCodeEvolve","GPT-6 Astra"],"human_role":"Human-designed LLM-guided search with expert supervision of strategies; codes verified by exhaustive enumeration","verification":{"key":"expert","label":"Expert-checked","text":"Exhaustive computer verification; checked by the CodeTables maintainer"},"status":"confirmed","shock":""},"body_md":"## What happened\n\nFinding binary linear codes with large minimum distance is a central coding-theory problem, and certifying minimum distance is NP-hard.\nLinCodeEvolve keeps ShinkaEvolve's island-based archive, novelty judge and model selection. Candidates enter the archive only with an exact\ncertificate (full weight distribution). Among codes with equal distance it prefers fewer minimum-weight codewords.\n\n## Why it matters\n\nViazovska, who solved sphere packing in dimensions 8 and 24, is now co-authoring LLM-search papers. It is another case of FunSearch-style\nsearch improving a long-maintained table of records with modest compute (one H100). The authors note that careful prompting of a frontier\nmodel (GPT-6 Astra) came close on some parameters, but systematic search did better across many parameter pairs.","disputed":[],"related":[{"id":"2026-09-30-ai-assisted-conjecture-wave-summer-2026","url":"https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/","date":"2026-09-30","date_precision":"day","short_title":"Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help","deck":null,"takeaway":"This entry catalogues about 50 of them, with the AI role as the authors state it.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":11,"official":5,"filed":"2026-09-30","updated":"2026-10-19","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]},{"id":"2025-05-14-alphaevolve","url":"https://postcutoff.com/e/2025-05-14-alphaevolve/","date":"2025-05-14","date_precision":"day","short_title":"AlphaEvolve: Gemini-powered agent discovers new algorithms","deck":null,"takeaway":"A concrete example of LLM-based systems making novel discoveries and improving the infrastructure that trains them — an early form of recursive improvement.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":4,"official":4,"filed":"2026-09-29","updated":"2026-09-29","orgs":["Google DeepMind"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-09-30","type":"filed","text":"Created"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-09-30","run":null,"sources_read":null,"updated":"2026-09-30","human_review":null,"version":{"date":"2026-10-04"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":121,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":91,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":182,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":121,"in_training_data":false}],"short_url":null}