{"schema":"postcutoff/event@1","as_of":"2026-10-12T07:22:00+02:00","url":"https://postcutoff.com/e/2026-10-08-lyapunov-spectrum-random-neural-networks-gpt-6-astra/","md":"https://postcutoff.com/e/2026-10-08-lyapunov-spectrum-random-neural-networks-gpt-6-astra/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"Adam Bicz","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-10-08-lyapunov-spectrum-random-neural-networks-gpt-6-astra","date":"2026-10-08","date_precision":"day","short_title":"Full Lyapunov spectrum of the Sompolinsky–Crisanti–Sommers random neural network derived, a problem named open in 1988; GPT-6 Astra produced the first derivation (David G. Clark, Flatiron)","deck":null,"takeaway":"A theoretical-neuroscience problem posed in the 1988 paper that founded the field's chaos theory now has an analytic answer. The first derivation came from GPT-6 Astra working alone for 100 minutes; Claude Opus 5.5 wrote all code and figures.","category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"Clark: Lyapunov spectrum of random neural networks (arXiv 2610.12426)","url":"https://arxiv.org/abs/2610.12426","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"Code and data (davidclark1/rnn-lyapunov)","url":"https://github.com/davidclark1/rnn-lyapunov","type":"code","group":"primary","domain":"github.com"},{"n":3,"title":"Sompolinsky, Crisanti & Sommers (1988): Chaos in random neural networks (Phys. Rev. Lett. 61, 259)","url":"https://doi.org/10.1103/PhysRevLett.61.259","type":"paper","group":"primary","domain":"doi.org"}],"official":3,"filed":"2026-10-11","updated":"2026-10-11","orgs":["Flatiron Institute","OpenAI","Anthropic"],"title":"Full Lyapunov spectrum of the Sompolinsky–Crisanti–Sommers random neural network derived, a problem named open in 1988; GPT-6 Astra produced the first derivation (David G. Clark, Flatiron)","summary":"On 8 Oct 2026 David G. Clark (Center for Computational Neuroscience, Flatiron Institute) posted arXiv 2610.12426, which computes the full Lyapunov spectrum of the random recurrent neural network of Sompolinsky, Crisanti and Sommers in the N → ∞ limit. The 1988 paper had named \"evaluation of the whole distribution of Lyapunov exponents\" as an open problem. The paper says the work \"was done in collaboration with the AI models GPT-6 Astra and Claude Opus 5.5\": GPT-6 Astra produced the initial derivation after working alone for 100 minutes, and Claude Opus 5.5 wrote all code and figures. It is a physics-style (non-rigorous) derivation checked against large-N simulations; an unrefereed preprint.","key_facts":["Paper: 'Lyapunov spectrum of random neural networks', David G. Clark (Flatiron Institute), arXiv 2610.12426 [cond-mat.dis-nn], 8 Oct 2026; code and data at github.com/davidclark1/rnn-lyapunov","Claim (introduction): Sompolinsky et al. 'named the \"evaluation of the whole distribution of Lyapunov exponents\" of this network as an open problem nearly four decades ago. The present work solves this problem.'","Method: a finite-N identity expresses the cumulative distribution of Lyapunov exponents as a response function of the tangent-space dynamics (tangent trajectory chosen by a minimum-norm condition); a cavity method then reduces it at large N to a self-consistent single-site problem. Result: the chaos is extensive","Use of AI: 'GPT-6 Astra produced an initial derivation. Working with both models, the author then arrived at the more physically transparent derivation presented in Sec. 2. Claude Opus 5.5 wrote all code and generated all figures, under the direction of the author, and assisted in writing and revision of the text.'","AI methodology appendix: 'The author had previously assumed that the present problem was analytically intractable.' GPT-6 Astra (Max thinking), in a session where it had already derived other results on random recurrent networks, 'worked independently for 100 minutes' after the prompt 'Derive the full N → ∞ Lyapunov spectrum of the SCS model (see Engelken for numerics)… Do not stop until you have nailed the answer.' Its derivation used a theorem of Deninger equating the sum of positive Lyapunov exponents with a Fuglede–Kadison log-determinant","Rigour: the exchange of the large-N limit with the long-time and zero-regularizer limits 'was assumed' (in both the AI and the final derivation); the theory is checked against known results (maximum exponent, Sompolinsky et al.'s δ → 0 result) and against numerics of Engelken, Wolf and Abbott","Acknowledgments: Ashok Litwin-Kumar proposed 'this problem as a target for AI-assisted solution'","Not found: expert reactions or press coverage as of 11 Oct 2026"],"key_numbers":[],"tags":["physics","theoretical-neuroscience","chaos","random-neural-networks","lyapunov-exponents","cavity-method","gpt-6-astra","claude-opus-5-5"],"science":{"field":"physics","subfield":"theoretical neuroscience / statistical physics of disordered systems","problem":"Full distribution of Lyapunov exponents of the Sompolinsky–Crisanti–Sommers random recurrent neural network (named open in 1988)","result":"Large-N self-consistent single-site theory for the cumulative distribution of Lyapunov exponents, via a finite-N response-function identity and a cavity method; shows the chaos is extensive.","open_since":"1988","ai_system":["GPT-6 Astra","Claude Opus 5.5"],"human_role":"AI-assisted: GPT-6 Astra produced the first derivation autonomously (100 minutes); the author, working with both models, found the more transparent derivation in the paper; Claude Opus 5.5 wrote all code and figures","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint; physics-level derivation (limit exchanges assumed) checked against simulations and known special cases"},"status":"pending","shock":"The author had assumed the problem was analytically intractable; a frontier model produced a derivation matching simulations in under two hours.","short":"Lyapunov spectrum of the SCS random network"},"body_md":"## What happened\n\nIn 1988 Haim Sompolinsky, Andrea Crisanti and Hans-Jürgen Sommers showed that a large network of randomly coupled neurons becomes\nchaotic, which became a standard model for chaos in neural circuits. Their paper listed the full distribution of Lyapunov exponents\n(how fast nearby trajectories separate in every direction) as an open problem. Engelken, Wolf and Abbott later computed it\nnumerically, but no analytic theory existed.\n\nDavid G. Clark's preprint gives a large-N theory for the whole spectrum. Its \"Use of AI\" section and appendix describe the process.\nAshok Litwin-Kumar suggested the problem as a target for AI. GPT-6 Astra, prompted inside a session where it had already derived\nother results on random networks, worked alone for 100 minutes and produced a derivation that matched simulations, using a theorem\nof Deninger on Fuglede–Kadison determinants. Working with GPT-6 Astra and Claude Opus 5.5, Clark then found the more physically\ntransparent cavity-method derivation presented in the paper. Claude Opus 5.5 wrote all code and figures.\n\n## Why it matters\n\nIt is a long-standing problem in theoretical neuroscience and statistical physics, not pure mathematics, settled with an AI-first\nderivation and an unusually explicit methodology appendix, including the prompt. It extends the 2026 wave of AI-assisted results\nbeyond mathematics. Like most physics derivations, it is not a rigorous proof: limit exchanges are assumed.","disputed":[{"label":"Verification","text":"Unrefereed preprint; physics-level derivation (limit exchanges assumed) checked against simulations and known special cases","sources":[]}],"related":[{"id":"2026-10-07-exact-overlaps-conjecture-gpt-6-astra","url":"https://postcutoff.com/e/2026-10-07-exact-overlaps-conjecture-gpt-6-astra/","date":"2026-10-07","date_precision":"day","short_title":"Exact overlaps conjecture for self-similar measures on the line proved","deck":"GPT-6 Astra found the first proof (Kittle & Kogler), 47,000-line Lean formalization; OpenAI's catalogue claims it independently","takeaway":"A central conjecture of fractal geometry, open in general since Hochman's 2014 breakthrough, now has a proof whose key part came from a GPT-6 Astra session. The authors rewrote and formalized it in Lean, and OpenAI's own release claims the same theorem.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":5,"official":5,"filed":"2026-10-08","updated":"2026-10-08","orgs":["University College London","Institute for Advanced Study","OpenAI"]},{"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":9,"official":4,"filed":"2026-09-30","updated":"2026-10-12","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-11","type":"filed","text":"Created from the arXiv PDF (abstract, AI methodology appendix, acknowledgments) found by the 2026-10-11 sweep"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-11","run":null,"sources_read":"The arXiv PDF (abstract, AI methodology appendix, acknowledgments) found by the 2026-10-11 sweep","updated":"2026-10-11","human_review":null,"version":{"date":"2026-10-11"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":161,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":100,"in_training_data":false},{"model_id":"gemini-3-8-flash","name":"Gemini 3.8 Flash","cutoff":"2026-03","days_after":191,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":130,"in_training_data":false}],"short_url":null}