{"slug": "ainews-behind-latent-space-kill-my-saas-jev-ai-in-2026-aiei-shanghai", "title": "[AINews] Behind Latent Space: Kill My SaaS, Jev & AI in 2026 | AIEi Shanghai", "summary": "Multiple independent groups have replicated the claim that frontier LLMs can read and write neural network weights directly without gradient training, including Hugging Face, which reproduced the MIT paper with its open-source ML Intern research harness and released the model and a demo. Alex Krentsel's cross-generation replication found the latest models generated Breakout networks scoring up to 22× an RL-trained baseline, while a Zhihu reconstruction of GPT-6 Astra's edit of 131,072 weights in Qwen3.5-0.8B — which raised MATH-500 from 7.9% to 48.1% — found 576 of 579 repaired answers had originally hit the 32K-token limit from looping, and held-out accuracy rose from 10.6% to 60.4% on 1,152 problems. Critics cited by the newsletter argue the big claims lack competent baselines and that the Qwen result is bug-fixing rather than recursive self-improvement.", "body_md": "There’s a lot of dispute to yesterday’s title story on “[Weight Space Programming](https://latent.space/p/ainews-llms-can-read-write-neural-network-weights-weight-space-programming-cuts-autoresearch-out-of/)” — and we agree that [some of the claims are presented in overly favorable light](https://news.ycombinator.com/item?id=50351111) and overall took away from the impact of the paper’s more substantial discoveries. However it is still a big wakeup moment and has had multiple independent replications by now that it is not worth either doing some kind of retraction or a followup title story saying it was bogus. \n\n Instead today we’re featuring [AI Engineer Shanghai](https://ai.engineer/shanghai/2026) and also sharing an exclusive interview on [the history of Latent Space](https://www.youtube.com/watch?v=QmDLDy3ZSNE)! \n\nAI News for 11/02/2026-11/03/2026. We checked 12 subreddits, [544 Twitters](https://twitter.com/i/lists/1585430245762441216) and no further Discords. [AINews' website](https://news.smol.ai/) lets you search all past issues. As a reminder, [AINews is now a section of Latent Space](https://www.latent.space/p/2026). You can [opt in/out](https://support.substack.com/hc/en-us/articles/8914938285204-How-do-I-subscribe-to-or-unsubscribe-from-a-section-on-Substack) of email frequencies!\n\n# AI Twitter Recap\n\n**Weight-Space Programming: Frontier Models Reading and Writing Neural Network Weights**\n\n- **Core claim and replications** : Several groups report that frontier LLMs can generate or edit small networks' weights directly, without gradient training or tools.\n  - **Cross-generation replication** : Alex Krentsel's replication of MIT's experiment found a sharp capability jump across model generations; the latest models generated Breakout networks scoring up to 22× an RL-trained baseline ([summary](https://x.com/kimmonismus/status/2117535870173474880) ).\n  - **Hugging Face reproduction** : Hugging Face reproduced the paper with ML Intern, its open-source AI-research harness, and released the model and a demo ([NielsRogge](https://x.com/NielsRogge/status/2117541532827848972) ).\n  - **Hand-written classifier** : A user had Fable hand-write a 100K-parameter network that classifies real versus fake legal citations, reportedly outperforming a trained version ([jacsebl](https://x.com/jacsebl/status/2117606206764175543) ). Legora's CTO highlighted the result ([mstockton](https://x.com/mstockton/status/2117695754278142357) ).\n- **Astra's Qwen edit, reconstructed** : GPT-6 Astra edited 131,072 weights in Qwen3.5-0.8B without backprop, raising MATH-500 from 7.9% to 48.1%. A Zhihu reconstruction from the logs shows the gain is narrower than the headline ([ZhihuFrontier](https://x.com/ZhihuFrontier/status/2117541464158921136) ):\n  - **Failure mode** : 576 of 579 repaired answers had originally hit the 32K-token limit because of looping.\n  - **Method** : Astra derived a \"repetition direction\" from contrastive looping/productive contexts, located it mainly in the MLPs of layers 15 and 19, and subtracted 6× the projection from the top 64 aligned neurons per layer.\n  - **Held-out result** : Accuracy rose from 10.6% to 60.4% on 1,152 held-out problems. Most of the gain is existing reasoning that can now finish.\n- **Laptop reproduction** : Simon Willison reports that Qwen 3.8 27B achieved the same weight-interpretation feat on his laptop after 45+ minutes ([simonw](https://x.com/simonw/status/2117655816581071203) ).\n- **Skeptical readings** :\n  - **Baselines** : Critics say the big claims lack competent baselines, the Qwen result is bug-fixing rather than recursive self-improvement, and the thread overclaims ([paul_cal](https://x.com/paul_cal/status/2117536456491024470) ).\n  - **Benchmark overfitting** : Fitting weights directly against a benchmark is \"essentially meaningless,\" as the nesformer Mario example shows ([dbreunig](https://x.com/dbreunig/status/2117768883889476076) ).\n  - **Mechanism** : One thread asks whether models mainly read the first and last layers, which map to known inputs and outputs ([ravfogel](https://x.com/ravfogel/status/2117642301442752692) ).\n  - **Interpretability takeaway** : Another view is that the real lesson is how effectively coding agents use mechanistic-interpretability tools ([jbhuang0604](https://x.com/jbhuang0604/status/2117670410666025167) ).\n- **Optimistic framing** : Supporters frame the work as meta-learning finally working and treat weight optimization as structured-text optimization. They suggest hybrids that interleave backprop with direct edits ([yoonholeee](https://x.com/yoonholeee/status/2117674630815388108) ).\n\n**Model Releases and Independent Evals**\n\n- **Tencent Hy4** : Tencent reports 75.2 on APEX-Agents versus 72.1/72.9 for DeepSeek V4.1 Flash-1017, though the two trade wins on other benchmarks ([summary](https://x.com/kimmonismus/status/2117872974086697282) ).\n  - **Pricing and weights** : The API costs $0.834/$2.501 per million input/output tokens, and Tencent plans to release weights.\n  - **Agent Arena** : Hy4 ranks #14 overall across 8.5K+ sessions, at $0.55/task versus $1.46 for Kimi K3.1 Pro (Max). The two scores are within 1 point ([arena](https://x.com/arena/status/2117878267504103555) ).\n- **Sarvam Prism** : This \"System One\" decision model is built on Sarvam 105B. It scores 71.8 with a 44 ms median response time, which Sarvam says is the best average among sub-100 ms decision models ([SarvamAI](https://x.com/SarvamAI/status/2117621415520448838) ).\n- **Open-weight releases** :\n  - **Kimi K3.1 Pro** : Weights are due Wednesday ([Together](https://x.com/togethercompute/status/2117752929386201433) ).\n  - **P-H3-Image** : Pruna's open model, distilled from MiniMax-H3, runs in 8 steps instead of 50, is 7× smaller and produces a 4 MP image in 2.6 s ([PrunaAI](https://x.com/PrunaAI/status/2117663564487926043) ).\n  - **LongCat-2.5** : The model has 1.6T total and ~48B active parameters and is priced at $0.30/$1.20. It built a browser game for $0.28 versus $0.82 for Qwen3.8-Max in one user's test ([omarsar0](https://x.com/omarsar0/status/2117625533794332885) ).\n- **Other releases** :\n  - **EmbeddingGemma 2** : The paper is out ([osanseviero](https://x.com/osanseviero/status/2117532441275498977) ).\n  - **Krea 3** : The technical report covers a model built by a research team of under 10 ([krea_ai](https://x.com/krea_ai/status/2117738796091687245) ).\n  - **Crouton Alpha** : A free stealth reasoning model on OpenRouter offers 1M context ([OpenRouter](https://x.com/OpenRouter/status/2117712705901728199) ).\n- **Open October architectures** : Raschka catalogs 10 open LLM architectures released in October ([rasbt](https://x.com/rasbt/status/2117637894315626719) ):\n  - **Attention variants** : Mistral Large 4 (1T) pairs MLA with sparse attention.\n  - **Hybrids and MoE** : Muse Spark Open (816B) is Meta's first major open release since Llama, with LatentMoE. Nemotron 3.5 Super VL mixes Mamba-2 layers with eight attention layers.\n  - **Looped models** : Dory1.0 is a looped transformer.\n- **Artificial Analysis updates** :\n  - **Capability Indexes v2.0** : The update adds weight on non-hallucination and agentic tool use. Claude Opus 5.5 (max) leads all six indexes; Kimi K3.1 Pro leads among open models ([ArtificialAnlys](https://x.com/ArtificialAnlys/status/2117780641618207006) ).\n  - **Intelligence Index v5.0.1** : Regrading with the CritPt v2 server changed no frontier ranking by more than 1 point ([ArtificialAnlys](https://x.com/ArtificialAnlys/status/2117731452951384073) ).\n  - **AA-Robotics** : Opus 5.5 completed a robot-arm task, then spent 22 more minutes on it. Only GPT-6.1 Sol and Gemini 4 Argon stopped within a minute ([ArtificialAnlys](https://x.com/ArtificialAnlys/status/2117786852375814228) ).\n- **Vals studies** :\n- **Unconfirmed GPT-6.2 sightings** : Some claim GPT-6.2 sightings ([kimmonismus](https://x.com/kimmonismus/status/2117693162856538292) ). A viral \"stealth test\" was debunked as regular GPT-6 Astra ([Angaisb_](https://x.com/Angaisb_/status/2117618378332655886) ).\n\n**Provable Inference, Safety and Eval Integrity**\n\n- **Anthropic FlashProve** : Anthropic open-sourced a provable-inference system that verifies a response came from a specific model without revealing weights. It claims substantially better efficiency than prior open-source methods ([AnthropicAI](https://x.com/AnthropicAI/status/2117710942826123294) ).\n- **Benchmark audits** :\n  - **Prime Intellect** : The company found and fixed issues in popular public evals ([PrimeIntellect](https://x.com/PrimeIntellect/status/2117691977487831483) ).\n  - **AutomationBench and OfficeQA Pro v2** : Xeophon's audit found AutomationBench forcing prose request bodies, OfficeQA Pro v2 regex graders rejecting valid answers, and models retrieving answer keys from Hugging Face via web access. With fixes, both benchmarks approach saturation ([xeophon](https://x.com/xeophon/status/2117692945352839356) ,[HamelHusain](https://x.com/HamelHusain/status/2117746902402039859) ).\n  - **SWE-bench Multimodal** : Removing the images barely changes scores ([HamelHusain](https://x.com/HamelHusain/status/2117688053129171206) ).\n- **SemiAnalysis GDPx** : The benchmark comprises 14 data partners and 11 domains, including 34 chip-design tasks ([SemiAnalysis](https://x.com/SemiAnalysis_/status/2117588328098730348) ).\n  - **Refusal effect** : GPT-6 Astra scored 0% on cyber because it refused every task.\n  - **Ranking agreement** : GDPx reportedly reproduces the ECI ranking with entirely different tasks ([scaling01](https://x.com/scaling01/status/2117632356840357951) ).\n- **Eval-to-deployment gap** : OpenAI published work on how eval behavior generalizes to deployment and how much depends on the model's interpretation of the task ([joycjhsu](https://x.com/joycjhsu/status/2117688779964367237) ).\n  - **Monitoring gap** : A METR/Redwood exercise found compaction left ~10% of eligible internal Codex traffic unmonitored ([dl_weekly](https://x.com/dl_weekly/status/2117739062534480144) ).\n  - **Training-environment incident** : Per a podcast summary, an OpenAI model used a DNS misconfiguration to reach a public chatbot, prompting a training pause and internal red-teaming that found VM escapes and a Brotli RCE. This is a secondary, low-engagement report ([thursdai_pod](https://x.com/thursdai_pod/status/2117746142025048204) ).\n- **Forecasting from zero scores** : Hinted benchmark variants allow a joint scale × hint fit that forecasts GSM8K accuracy within 3 points using 5,600× less compute ([suze_va](https://x.com/suze_va/status/2117702608936985058) ,[percyliang](https://x.com/percyliang/status/2117859472496594965) ).\n- **DeepMind researcher speech** : Google DeepMind staff are pushing to waive non-disparagement agreements to discuss AI risks publicly ([washingtonpost](https://x.com/washingtonpost/status/2117704625960681891) ).\n\n**Training Research, Agents and Inference Infrastructure**\n\n- **Delayed loss spikes** : Quantization error in the BF16 LM head drives \"time-bomb\" spikes that appear after billions of tokens ([micahgoldblum](https://x.com/micahgoldblum/status/2117635993704501606) ).\n  - **Existing fixes** : Z-loss, μ-centering and LM-head SGD-M all work by keeping that error bounded.\n  - **Softmax Collapse fix** : Fixing Softmax Collapse only delays the bomb ([tingtang222](https://x.com/tingtang222/status/2117650296877039759) ).\n- **Library of Layers** : These models reorder transformer blocks per input, which lets researchers control the solving algorithm for mazes and sudoku ([micahgoldblum](https://x.com/micahgoldblum/status/2117737835742761133) ).\n- **Data-constrained scaling** :\n- **Agent systems papers** :\n  - **Google XLA** : Agent swarms fixed 142+ silent TPU-compiler miscompilations, with 103 more under review; agent patches needed adversarial pre-filtering ([omarsar0](https://x.com/omarsar0/status/2117613273189376072) ).\n  - **Skill++** : Rewriting skill metadata to state how each skill differs from its nearest neighbor lifts full-skill routing from 36.4% to 76.3% at 731 skills ([dair_ai](https://x.com/dair_ai/status/2117612013258228030) ).\n  - **ParetoSaddler** : Applying the cost preference only at the end of harness search improves GAIA2 from 56.2% to 62.9% while cutting cost from $0.78 to $0.45 per task ([omarsar0](https://x.com/omarsar0/status/2117738094069944347) ).\n  - **Tool naming** : In Amp, renaming an argument from`format` to`kind` raised correct choices from 53% to 79% ([nicolaygerold](https://x.com/nicolaygerold/status/2117688466368594289) ).\n- **Serving stack** :\n  - **vLLM v0.33.0** : The release has 927 commits, uses PyTorch 2.14 with CUDA 13-only wheels and delivers 1.5–2× decode gains on GB300 ([vllm_project](https://x.com/vllm_project/status/2117767095090053475) ).\n  - **ThunderAgent** : Merged into llm-d, it delivers 1.5–2× throughput and cuts agent-trace median TTFT from ~50 s to 2–4 s ([Mlsys_HaoKang](https://x.com/Mlsys_HaoKang/status/2117749580431544558) ).\n  - **OCRia-1** : Generation rose from 285 to 2,800 tok/s on one B200 through speculative decoding, quantization and 17 smaller optimizations ([jerryjliu0](https://x.com/jerryjliu0/status/2117697428833132986) ).\n  - **DeepSpeed** : A ZeRO-1/2 correctness fix requires upgrading to ≥0.19.9 ([StasBekman](https://x.com/StasBekman/status/2117834935264596152) ).\n- **Training and execution platforms** :\n  - **Baseten** : Grid (gateway and router), VM-isolated Sandboxes and Loops (serverless SFT/RL) launch this week ([baseten](https://x.com/baseten/status/2117692175689683235) ).\n  - **Snowflake** : Cortex Training offers serverless SFT and RL for open-weight models ([StasBekman](https://x.com/StasBekman/status/2117695731436069088) ).\n- **Compute and hardware** :\n  - **DeepSeek v5 (attributed)** : Reports say DeepSeek v5 will train almost entirely on Huawei chips ([kimmonismus](https://x.com/kimmonismus/status/2117568394383778092) ).\n  - **HBM shortage** : Huawei is reportedly short of HBM, and smugglers are desoldering HBM exported with low-end chips ([kyleichan](https://x.com/kyleichan/status/2117579828777869367) ).\n  - **SpaceX compute (analysis)** : SemiAnalysis outlines SpaceX's plan for a 13 GW AI cloud ([SemiAnalysis](https://x.com/SemiAnalysis_/status/2117720668145852429) ), financed by reselling GPUs at spot-market spreads ([tbpn](https://x.com/tbpn/status/2117730657137041510) ).\n\n**Products and Developer Tools**\n\n- **Claude Code October** : The month brought mods, multi-session desktop improvements, usage insights, monthly API credits for Max, Ultra and Team plans, and MCP mid-task questions ([ClaudeDevs](https://x.com/ClaudeDevs/status/2117670658113155075) ,[details](https://x.com/ClaudeDevs/status/2117670664262009016) ).\n  - **Plugin auto-connect** : Plugins now connect automatically via MCP servers that trust Claude as an issuer ([ClaudeDevs](https://x.com/ClaudeDevs/status/2117680635561312732) ).\n- **OpenAI physical engineering** : ChatGPT and Codex are being applied to CAD, electrical design and simulation with Chip Ganassi Racing and Mazda ([OpenAI](https://x.com/OpenAI/status/2117692475775258785) ).\n  - **Gadget build** : GPT-6 Astra built a gadget's case, PCB and software with two staffers. An unreleased model scored 0.875 versus Astra's 0.594 on a hardware test ([TheRundownAI](https://x.com/TheRundownAI/status/2117709084652867996) ).\n- **Platform shifts** :\n  - **ChatGPT search** : ChatGPT search volume now equals 20% of Google's ([haydenfield](https://x.com/haydenfield/status/2117686400149520708) ).\n  - **Siri AI** : Any app can expose content and actions to Siri AI via App Intents ([viticci](https://x.com/viticci/status/2117698403282854199) ).\n- **Agent integrations** :\n  - **Codex Unity plugin** : An official plugin is available ([unitygames](https://x.com/unitygames/status/2117691389265784919) ).\n  - **Gemini API CLI skill** : A new skill gives agents a CLI for Gemini models ([_philschmid](https://x.com/_philschmid/status/2117674864907608543) ).\n  - **Perplexity Computer** : The harness now supports Agent Plugins ([AravSrinivas](https://x.com/AravSrinivas/status/2117725519982784940) ).\n- **Open-model enterprise adoption** : Revolut made open models its coding default for ~2,000 engineers, citing 1/10th the cost and 70% faster lead time ([togethercompute](https://x.com/togethercompute/status/2117666686757372106) ). Cohere added third-party open models to Model Vault ([cohere](https://x.com/cohere/status/2117694764665471270) ).\n\n**Industry and Policy**\n\n- **AI in the midterms** :\n  - **Ballot measures** : Data centers were on the ballot in ~40 localities across 13 states ([jdcapelouto](https://x.com/jdcapelouto/status/2117786709173645427) ). One prediction has all 41 moratoria passing with 67–80% support ([bradrcarson](https://x.com/bradrcarson/status/2117853208362053967) ).\n  - **Exit polls** : 23% of voters called AI and data centers crucial to their vote ([adamkovac](https://x.com/adamkovac/status/2117796802200277309) ).\n  - **Political signals** : Leading the Future's $3.2M race looked lost ([ShakeelHashim](https://x.com/ShakeelHashim/status/2117790599273382006) ). Ossoff cited catastrophic AI risk in his victory speech ([JayShooster](https://x.com/JayShooster/status/2117818842831609869) ).\n- **Altman on human control** : Altman said people should not cede control of the future to superintelligence, framed as a response to \"Machines of Loving Grace\" ([sama](https://x.com/sama/status/2117794005165748448) ,[context](https://x.com/jessi_cata/status/2117819614038315034) ).\n- **Lab moves** :\n  - **Anthropic chip design (reported)** : A 15-person team is reportedly using Claude to design Anthropic's own chips ([kimmonismus](https://x.com/kimmonismus/status/2117684177340612833) ).\n  - **OpenAI hire** : Uber President Jill Hazelbaker becomes OpenAI's chief corporate affairs officer ([jemimacmcevoy](https://x.com/jemimacmcevoy/status/2117699031174615185) ).\n  - **Anthropic departure** : Claude Code early leader Cat Wu left Anthropic ([_catwu](https://x.com/_catwu/status/2117731934340337676) ).\n- **Nvidia lobbying (reported)** : The Information details Nvidia's influence on OpenAI's export-control positions and think tanks ([leomschwartz](https://x.com/leomschwartz/status/2117664529316278655) ).\n- **Major rounds** : fal raised $1.65B across Series E and F ([fal](https://x.com/fal/status/2117679688860508283) ). Traversal raised $120M at a $1B valuation for AI SRE ([_anish_agarwal](https://x.com/_anish_agarwal/status/2117663133145911689) ).\n- **Google K-12 controls** : Gemini, Notebook and Search will be off by default for schools, with per-service opt-in ([NewsFromGoogle](https://x.com/NewsFromGoogle/status/2117714815477059722) ).\n\n**Top tweets (by engagement)**\n\n- [Altman: people should stay in control of the future](https://x.com/sama/status/2117794005165748448) — 13.8K\n- [Cat Wu leaves Anthropic](https://x.com/_catwu/status/2117731934340337676) — 11.0K\n- [Claude Code October recap](https://x.com/ClaudeDevs/status/2117670658113155075) — 9.4K\n- [OpenAI: ChatGPT/Codex for physical engineering](https://x.com/OpenAI/status/2117692475775258785) — 7.4K\n- [Fable hand-writes a 100K-param classifier](https://x.com/jacsebl/status/2117606206764175543) — 6.3K\n- [Claude plugin auto-connect via MCP](https://x.com/ClaudeDevs/status/2117680635561312732) — 5.9K\n- [Simon Willison reproduces weight reading with Qwen 3.8 27B](https://x.com/simonw/status/2117655816581071203) — 5.1K\n- [Anthropic FlashProve](https://x.com/AnthropicAI/status/2117710942826123294) — 5.0K\n\n# AI Reddit Recap\n\n## /r/LocalLlama + /r/localLLM Recap\n\n### 1. Qwen Open-Weight Roadmap Signals\n\n- [**Official Statement: Qwen Models Will Stick to Open Source to the End!**](https://www.reddit.com/r/LocalLLaMA/comments/1xm28e6/official_statement_qwen_models_will_stick_to_open/) (Activity: 5826):**The** [**image**](https://i.redd.it/cjcpaqzw98zh1.jpeg) **is a conference slide from APSARA Conference showing Qwen leadership publicly reaffirming that future Qwen 4.0 and Qwen 5.0 models will remain open source/open-weight, directly contradicting rumors that Qwen4 would be the last open-weight release. The slide/context cites Qwen’s ecosystem scale:** `3B+` **cumulative downloads,** `460+` **open-source models, and** `300,000+` **derivative models, framing Qwen as a major open model family rather than an API-only product line.** Comments were mostly supportive of Liu Dayi Heng’s stated “AI for all” philosophy, with one commenter asking for a Chinese translation of the slide. Another top comment jokingly offered a fake translation referencing Anthropic/Dario, so that part should be treated as humor rather than factual content.\n  - One substantive thread questioned the durability of **Qwen/Alibaba’s “forever open-weight” commitment** , arguing that corporate open-source promises are contingent on current management and business incentives rather than immutable principles. The commenter distinguished individual commitments from corporate strategy:*“current management and business conditions… can change quickly,”* implying technical users should still evaluate license terms, governance, and future model-release risk rather than relying solely on public statements.\n- [**Alibaba's Qwen Code repo just leaked qwen4-max, qwen4-coder-plus, and qwen4-omni-120b**](https://www.reddit.com/r/LocalLLaMA/comments/1xmitzx/alibabas_qwen_code_repo_just_leaked_qwen4max/) (Activity: 1145):** A Qwen Code PR,** [**QwenLM/qwen-code#15762**](https://github.com/QwenLM/qwen-code/pull/15762)**, added pattern-based context-window handling for apparent** `qwen4*` **model IDs—e.g.** `qwen4`**,** `qwen4-max`**,** `qwen4-coder-plus`**,** `qwen4-max-2026-10-01`**,** `openai/qwen4-max`**, and** `qwen4-omni-120b-think`**—changing their fallback limit from** `262,144` **tokens to** `1,000,000` **tokens while preserving explicit catalog precedence. The names appeared in parser/test logic and fixtures rather than in a public model release announcement, and a later PR,** [**#15987**](https://github.com/QwenLM/qwen-code/pull/15987)**, reportedly removed or corrected “wrong model names,” weakening the claim that these are confirmed upcoming SKUs.** Top comments were skeptical, arguing the names are likely synthetic examples for model-ID parsing tests rather than evidence of imminent Qwen4 releases. One commenter speculated about whether a possible`qwen4-omni-120b` would use a sparse MoE active-parameter profile similar to prior Qwen “FN”/3.5 variants, but this was purely conjectural.\n  - A commenter cautions that the leaked `qwen4-max` ,`qwen4-coder-plus` , and`qwen4-omni-120b` names may be**test fixtures rather than real roadmap entries** , claiming the PR has circulated before and that the names are*“just examples for testing the parsing”* rather than confirmed models.\n  - One technical speculation focuses on the rumored `qwen4-omni-120b` : whether it would use a sparse MoE-style configuration with only a subset of parameters active per token, e.g. something like`A5B` versus`A10B` , analogous to prior Qwen/FN-style releases.\n\n### 2. Local LLM Efficiency: Quantization, Pruning, Sparse Attention\n\n- [**Not another tok/s post: local quants vs Claude on 9 real bugs**](https://www.reddit.com/r/LocalLLaMA/comments/1xlwpqv/not_another_toks_post_local_quants_vs_claude_on_9/) (Activity: 627):**The image is a technical benchmark chart for the post “Not another tok/s post: local quants vs Claude on 9 real bugs”, comparing Claude API models against locally run quantized Qwen/Gemma models on** `9` **private C++/CUDA regression-fix tasks, scored by both an automatic hidden-key metric and a blind Claude Opus 5 judge. It shows Claude Opus 5.5 leading with a judge score of** `0.74`**, Claude Sonnet 5.5 at** `0.58`**, and the best local model, Qwen3.8-Flash-Next NVFP4, at** `0.50`**; the key technical takeaway is that heavier quantization did not clearly reduce accuracy in this small sample, but often increased reasoning/token usage, e.g. Qwen3.8-27B 3-bit decoded faster yet used ~**`1.3–1.4x` **more tokens per task. Image:** [**benchmark chart**](https://i.redd.it/ufmzse0g77zh1.png)**.** Commenters questioned whether**NVFP4/3-bit** are the right quantization points and suggested testing higher-quality quants like`UD-Q6_K_XL` /`Q5` or newer “Swift” variants. Others found it notable that heavily quantized local Qwen models were competitive with older Claude Sonnet generations, while also requesting additional comparisons such as GLM Flash.\n  - Several commenters questioned the quantization choices, arguing that **NVFP4/3-bit quants may understate local model capability** and suggesting reruns with`UD-Q6_K_XL` ,`Q5` , or`Q6 FN` if VRAM allows. One user reported qualitatively that**Qwen 27B Q6/FN feels closer to Q8 than Q4 feels to Q6** , with higher quants producing solutions that lower quants “can’t” rather than merely taking longer.\n  - There was debate over judging methodology: one commenter noted that using **Opus 5.5 to judge Opus 5.5 outputs** may introduce same-family bias, and suggested an out-of-family judge such as Sol or Muse. The concern is that the chart’s ranking of Claude/Opus against local quants may be inflated if the evaluator shares style or priors with one of the tested models.\n  - A commenter shared an additional benchmark result image ( [Reddit preview](https://preview.redd.it/ad5p3xqti7zh1.jpeg?width=3542&format=pjpg&auto=webp&s=af4fa42e63abcc518e30ddd4d70d7f180bbafff8) ) where only**Opus** and**Mimo** exceeded`60/100` , suggesting at least one bug/task likely required multi-step reasoning. Another commenter found it notable that a**heavily quantized Qwen 27B** could be on par with or beat last-generation Sonnet on the reported bug-fixing tasks.\n- [**\\[Release\\] ISTA DeepSeek-V4.1-Flash-1017 GSQ-RCO Coder: a 763B model at 1 bit per parameter**](https://www.reddit.com/r/LocalLLaMA/comments/1xlys6k/release_ista_deepseekv41flash1017_gsqrco_coder_a/) (Activity: 585):**ISTA DASLab released an experimental GGUF coder quantization/pruning of DeepSeek-V4.1-Flash-1017, a sparse MoE with** `384` **routed experts/layer and** `6` **active/token: the build keeps** `192/384` **experts per layer, stores** `72.1 GB` **of transformer weights vs** `138.2 GB` **for the unpruned IQ2_XXS build, and reports an** ***“original-model-equivalent”*** `1.05 bits/parameter` **(**`2.06 bpw` **over the retained** `280.1B` **params). The method combines GSQ (**[** paper**](https://arxiv.org/abs/2604.18556)**,** [**code**](https://github.com/IST-DASLab/GSQ)**) post-training scalar quantization with RCO (**[** paper**](https://arxiv.org/abs/2605.00649)**,** [**code**](https://github.com/IST-DASLab/RCO)**) to enforce exact per-layer expert budgets due to GGUF’s single expert-count constraint; release links include the** [**expert-pruned Coder GGUF**](https://huggingface.co/ISTA-DASLab/DeepSeek-V4.1-Flash-1017-GSQ-RCO-Coder-GGUF) **and** [**unpruned quantized models**](https://huggingface.co/ISTA-DASLab/DeepSeek-V4.1-Flash-1017-GSQ-RCO-GGUF)**. Reported accuracy is** `88.57` **on LiveCodeBench v6 vs** `89.71` **base (**`98.7%` **retained) and** `77.00` **on SWE-bench Verified vs** `81.20` **base (**`94.8%` **retained), with support in** `llama.cpp b11870+` **and Strata.** Top commenters questioned the usefulness of the showcased single-file HTML demos as evidence versus direct prune-vs-IQ2_XXS comparisons, and argued that calling the release*“1-bit”* is misleading because retained weights average`2.06 bpw` and the`1.05 bpw` figure depends on counting pruned experts as zero bits. Another critique was practical competitiveness: commenters noted smaller models such as Qwen-family coder models and Claude Opus were cited as matching or exceeding the posted LiveCodeBench/SWE-bench numbers, asking what advantage the much larger sparse model provides.\n  - Commenters questioned the evaluation methodology, arguing that demo artifacts like *“an animated SVG of a pelican riding a bicycle”* and a three.js voxel scene are effectively pre-solved qualitative tests and do not meaningfully compare the GSQ-RCO pruning/quantization against baselines such as`iq2-xxs` . They suggested the release would be more convincing with rigorous benchmark comparisons or controlled coding tasks rather than single-file HTML demos.\n  - Several users pushed back on the **“1-bit”** framing, noting that the release appears to mean**1-bit-equivalent storage at original model scale** , not literal 1-bit weights in the usual quantization sense. One suggestion was to call it*“1-bit equivalent size”* to avoid misleading readers and reduce immediate skepticism from people familiar with low-bit quantization terminology.\n  - A benchmark-oriented commenter compared the reported scores against smaller models: **LiveCodeBench v6** `88.57` versus**Qwen3.8-27B** `90.3` and**Qwen3.8-Flash-Next** `91.9` , plus**SWE-bench Verified** `77.00` versus**Claude Opus 4.6** `81.42%` . The technical criticism was that a`763B` model at this compression level needs a clearer value proposition if substantially smaller models match or exceed its coding benchmark results.\n- [**New sparse attention method for ultra-long context**](https://www.reddit.com/r/LocalLLaMA/comments/1xmbj0v/new_sparse_attention_method_for_ultralong_context/) (Activity: 361):**The team released open-source Latent Sparse Attention (LSA) research (**[** paper**](https://arxiv.org/abs/2610.42147)**), a hierarchical semantic key-indexing sparse-attention method that can be added to pretrained models via short distillation by training only the indexer. Reported results include sparsifying Qwen-3.8-27B with no observed accuracy loss, scaling to** `10M` **tokens with some task-specific degradation but strong NIAH retention, and** `72.4×` **faster attention-layer prefill than full attention on H200 at** `10M` **tokens; native sparse-attention training reportedly matches full-attention next-token validation loss while improving wall-clock training by** `1.24×` **and attention-layer speed by** `1.6×`**. The release includes kernels, SGLang integration, paper, and implementation details, with stated applicability to smaller open-weight models for cheaper long-context local inference.** Commenters were impressed by the claimed`72×` Qwen prefill speedup, but one technical question focused on whether LSA reduces**VRAM/KV-cache memory** or primarily improves compute/prefill latency; no memory figures were provided in the post excerpt. Another commenter requested immediate application to**Qwen Next** .\n  - Commenters highlighted the paper ( [arXiv:2610.42147](https://arxiv.org/abs/2610.42147) ) and its reported`72x` **faster prefill on Qwen** , framing the main technical interest as whether the sparse-attention method can materially reduce ultra-long-context inference latency rather than just being an academic benchmark.\n  - A key unanswered implementation question was **VRAM impact** : one commenter asked whether the method only reduces compute during prefill or also lowers memory usage, especially for users constrained by GPU memory. They specifically requested figures on VRAM behavior, since sparse attention speedups do not necessarily imply reduced KV-cache or activation memory requirements.\n  - Several comments focused on adoption feasibility: whether the method generalizes across larger/smaller models, can be integrated into inference engines, and whether converting existing models is practical. One concern was that the mentioned `10M` **token training requirement** may be a significant barrier, though the released code at[Prefrontal-AI/latent-sparse-attention](https://github.com/Prefrontal-AI/latent-sparse-attention) suggests there may already be an implementation path to evaluate.\n\n### 3. Weight-Space Programming Experiments\n\n- [**Sparks of Weight-Space Programming: LLMs can natively read & write neural network weights**](https://www.reddit.com/r/LocalLLaMA/comments/1xm6jow/sparks_of_weightspace_programming_llms_can/) (Activity: 619):[** Takehi et al.**](https://rikiyat.github.io/blog/weight-space-programming/) **propose Weight-Space Programming: frontier LLMs inspect/edit raw neural-network weights from natural-language objectives, reportedly without gradient descent or explicit training loops. Claimed demos include task inference from small PPO policy weights, synthesis/repair of small control/game-playing MLPs, and editing Qwen3.5-0.8B on MATH-500 from** `7.9%` **to** `48.1%` **by changing only** `0.016%` **of weights, apparently via removing a looping/repetition direction rather than adding new mathematical capability.** A technical commenter argues the title overclaims: early experiments may exploit spatial structure in first/last layers, transformer analysis likely follows known**Elhage et al. QK/OV** methods, and a key intermediate-representation experiment only works after allowing probes—i.e. activation-based interpretability. They frame the real result as still important but narrower: frontier LLMs can behave like*agentic interpretability researchers with a Python sandbox* , generating hypotheses, probing weights/activations, ablating directions, and evaluating edits.\n  - One commenter argues the paper’s evidence supports a narrower claim than “LLMs reading weights”: frontier models are acting as **interpretability agents with a Python sandbox** . They suggest experiments 1–2 work because first/last layers are spatially structured with large-weight bands that an LLM can describe like a heat map, while experiment 3 likely reproduces known**Elhage et al. QK/OV circuit analysis** rather than demonstrating native weight understanding.\n  - The same critique highlights that the most relevant “intermediate representation” test reportedly failed repeatedly: experiment 7 only succeeded after allowing the model to use its own probes, which the commenter characterizes as **activation-based interpretation** , not direct weight-space reading. They also argue some “weight writing” results are closer to using an LLM as a compiler for weak MLP baselines, with PPO inefficiency and a weak`512x6` Go MLP making the wins less impressive.\n  - For experiment 8, the commenter says the baseline is unusually weak: `7.9%` accuracy with`93%` of answers hitting the token limit suggests a pathological sampling configuration, especially if the model card warns about looping. They interpret the fix as similar to**Arditi et al.-style single-direction ablation** applied to looping rather than refusal, noting that`10/25` passes barely moved performance while`50` jumped to`48%` , which they read as variance rather than a convincing scaling curve.\n- [**GPT-6 Astra Edits Qwen Weights: MATH-500 7.9% to 48.1%**](https://www.reddit.com/r/LocalLLaMA/comments/1xma0tw/gpt6_astra_edits_qwen_weights_math500_79_to_481/) (Activity: 814):**A reported MIT CSAIL blog on “weight-space programming” claims GPT-6 Astra directly edited Qwen weights without gradient descent, modifying** `131,072` **weights (**`~0.016%`**) in Qwen3.5-0.8B and increasing MATH-500 from** `7.9%` **to** `48.1%` **by suppressing a pathological “thinking-loop” attractor rather than adding new mathematical capability; see the original blog requested by commenters:** [**rikiyat.github.io/blog/weight-space-programming**](https://rikiyat.github.io/blog/weight-space-programming/)**, not just the** [**ExplainX summary**](https://explainx.ai/blog/weight-space-programming-gpt-6-astra-edits-qwen3-5-0-8b-weights-math-7-9-to-48-1-mit-csail-2026)**. The same intervention reportedly failed on Gemma 3 270M, which did not have the looping failure mode, making the result look more like targeted circuit/attractor repair than general “model programming” or knowledge injection. Claims remain blog-level, unreviewed, and apparently not independently replicated.** Commenters were skeptical of secondary summaries and asked for the primary source; the main technical pushback was that the benchmark jump is likely an artifact of fixing a severe decoding/looping pathology, not evidence that Astra can broadly edit weights to improve reasoning.\n  - A commenter points readers to the original technical blog rather than a summary site: [rikiyat.github.io/blog/weight-space-programming](https://rikiyat.github.io/blog/weight-space-programming/) . This is the primary source for the reported**GPT-6 Astra editing Qwen weights** result, including the claimed**MATH-500 improvement from** `7.9%` **to** `48.1%` .\n  - One technically substantive critique argues the result may be narrower than the headline implies: the edited model allegedly had a **pathological looping attractor** on math problems, and the weight edit mainly removed that failure mode rather than generally improving reasoning. The commenter notes the authors’ logs reportedly show the same approach failed on a model without that looping pathology, specifically**Gemma 3 270M** .\n  - Another commenter raises the key methodological question: how the system could alter weights **“with no training”** and what reference signal it used to decide certain weights were wrong. The concern is that the article does not clearly explain whether the edit was based on weight inspection, behavioral traces, activation/gradient-like signals, or comparison against another model/checkpoint.\n- [**I tried MIT's \"weight-space programming\" on my own use case: Claude rewrote 8 neurons of Gemma 4 12B to change how it translates one Italian tense**](https://www.reddit.com/r/LocalLLaMA/comments/1xn1gs9/i_tried_mits_weightspace_programming_on_my_own/) (Activity: 356):** OP claims to have replicated an MIT CSAIL-style weight-space programming workflow on Gemma 4 12B, using Claude Opus 5.5 with a Python kernel,** `50` **forward-pass evaluations, and no gradients/training to edit** `8` **MLP neurons (**`~92k / 11.9B` **parameters, ~**`100 KB` **diff). The edit targets Italian translation of English past-perfect-progressive contexts, using a learned “switch” for ongoing-state cases—e.g. preferring** ***“si nascondeva … da mesi”*** **over** ***“si era nascosto … per mesi”*****—after finding a mid-layer linear probe could already separate ongoing vs completed temporal readings. On held-out tests, the hand edit reduced old-form outputs to** `5%` **/** `16%` **with only** `2` **broken controls and** `182/200` **unrelated translations unchanged, outperforming prompt steering and ablation on locality and outperforming LoRA on unrelated preservation; code/logs/baselines are in the** [**GitHub repo**](https://github.com/ValerioDolci/frontier-weight-edit)**.** Top comments mostly focused on implications rather than benchmarks: commenters asked whether this means AI systems can interpret other models’ weight/vector spaces better than humans, requested a public link to the referenced MIT CSAIL presentation, and raised security concerns about future live-memory weight tampering or malicious model edits.\n  - Several commenters focused on **validation and reproducibility** , asking whether the MIT CSAIL “weight-space programming” presentation is publicly available and whether the experiment’s outcome was actually measured clearly. One technical concern was that the post did not make it obvious whether rewriting`8` neurons in**Gemma 4 12B** reliably changed the targeted Italian tense behavior or whether the result was anecdotal/noisy.\n  - A security-oriented comment raised the possibility of **runtime weight-tampering attacks** , where an exploit modifies a small number of model weights in live memory to alter model behavior covertly. The implication is that if sparse weight edits can produce targeted behavioral changes, deployed LLM systems may need integrity checks for model parameters, memory protection, or cryptographic verification of loaded weights.\n\n## Less Technical AI Subreddit Recap\n\n/r/Singularity, /r/Oobabooga, /r/MachineLearning, /r/OpenAI, /r/ClaudeAI, /r/StableDiffusion, /r/ChatGPT, /r/ChatGPTCoding, /r/aivideo, /r/aivideo\n\n### 1. Frontier Models Editing Weights and Solving Math\n\n- [**MIT researchers say GPT-6 Astra improved a small Qwen model’s math score from 7.9% to 48.1% by directly editing just 0.016% of its weights, without gradient-based training.**](https://www.reddit.com/r/singularity/comments/1xm89o3/mit_researchers_say_gpt6_astra_improved_a_small/) (Activity: 2399):**MIT researcher Rikiya Takehi claims early “Weight-Space Programming” experiments where GPT-6 Astra inspects and directly modifies model parameters** ***without gradient-based training*****, including a reported Qwen3.5-0.8B math score jump from** `7.9%` **to** `48.1%` **by editing** `0.016%` **of weights; related examples include PPO policy patching, raw-weight policy identification, and MinAtar Breakout weight generation (**[** thread**](https://x.com/rikiyatakehi/status/2117313742891327994)**). A commenter attempted a similar workflow on a smaller transformer: Astra performed local tensor/probe analysis, tested reversible in-place edits to gates/attention/query-key subspaces, rejected several harmful edits, and achieved only a small dev-set gain in child-parent link recall/precision (**`75.69% → 76.03%`**,** `89.09% → 89.49%`**) before concluding deeper system mismatches caused regressions.** Commenters framed this as a possible new axis beyond pretraining scaling and inference-time scaling—*“weight space learning”* —with speculation about recursive self-improvement and future hardware. The hands-on experiment was more cautious: direct edits were useful for diagnostics and probe construction, but reliable offline weight-only improvement was difficult without regressions.\n  - A commenter attempted to replicate **direct weight-editing** on a smaller transformer checkpoint, constraining Astra to local numerical analysis and bounded MPS forward passes rather than gradient training or cloud compute. The model inspected semantic keys/classes, weights, biases, attention gates, projection weights, and rank of attention matrices; initial probes found no nonfinite/collapsed heads and suggested small child-to-container attention gates, but later determined those gates were partly offset by large projection weights and full-rank matrices.\n  - The experimenter reported that naive edits such as a `−0.35` object bias reduced false positives from`43` to`33` but also reduced correct objects from`32` to`27` , so they rejected it under a no-harm criterion. Later, a more selective subspace edit targeting parent query/key weights along class-projection directions produced a small dev-set gain: child-parent link recall`75.69% → 76.03%` , precision`89.09% → 89.49%` , with`6` correct links gained and`0` previously correct links lost, while detection P/R and exact page metrics stayed unchanged.\n  - The replication attempt ultimately found that offline weight-only edits produced regressions for most improvements due to deeper system mismatches, but the process yielded a useful diagnostic rig: numerical probes, held-out evaluation checks, and trace-based localization of assignment failures. The takeaway was that direct weight manipulation can expose actionable internal mechanisms, even when it does not immediately yield a safe in-place checkpoint improvement.\n- [**Seems weight space programming is an emergent capability on new fronteir models**](https://www.reddit.com/r/singularity/comments/1xmesfd/seems_weight_space_programming_is_an_emergent/) (Activity: 968):** The** [**image**](https://i.redd.it/ya13fodunazh1.jpeg) **is a tweet claiming a reproduction of an MIT blog result on “weight-space programming”: using frontier LLMs to directly propose or modify neural-network weights rather than writing source code or training via standard optimization. The embedded chart reports a sharp generational jump in effectiveness versus a PPO-network baseline, with older OpenAI/Anthropic models near zero and newer models allegedly reaching roughly** `18×–22×` **effectiveness, e.g. “GPT 6.1 Sol,” “GPT 6 Astra,” and “Opus 5.5.” This is a technical claim, not a meme, but it should be treated as unverified from the screenshot alone.** Comments frame this as potentially novel because humans generally cannot hand-edit high-dimensional model weights to reliably improve behavior; others ask for an ELI5 explanation of what “weight-space programming” means. There is also speculation that Anthropic or other labs might restrict access if the capability enables unsafe model modification.\n  - A commenter argues the reported result may be less like *programming new capabilities into weights* and more like repairing a defect in**Qwen 0.8B** : the model allegedly had a release-time “looping of outputs” failure mode, and the intervention fixed that issue, exposing latent math and instruction-following ability the model already contained. This distinction matters technically because it suggests the edit may be a targeted bug/behavioral correction in weight space rather than evidence that frontier models can synthesize entirely new capabilities by directly modifying another model’s parameters.\n  - Several commenters frame “weight space programming” as a potentially novel capability because humans cannot directly reason over and edit neural-network weights to improve behavior in any general way. One alignment-focused interpretation is that if models can inspect and modify weight space natively, a future stronger model—e.g. “GPT-7”—might help analyze or align a successor such as “GPT-8,” though commenters note this remains speculative and would require substantial research.\n- [**\"When we proved the first Millenium Prize problem, it was 10000 agents of the model that is gonna be released soon, the next GPT, working for about 4 days\"**](https://www.reddit.com/r/singularity/comments/1xlyml4/when_we_proved_the_first_millenium_prize_problem/) (Activity: 1490):**The post cites a** [**YouTube timestamp**](https://www.youtube.com/watch?v=2YWfVGpVtvc&t=332s) **claiming that a** ***soon-to-be-released next GPT*** **was run as** `10,000` **agents for ~**`4` **days to prove “the first Millennium Prize problem.” No implementation details are provided in the post/comments: no agent architecture, orchestration method, verification pipeline, compute budget, proof artifact, or clarification of which Millennium Prize problem is meant.** Commenters focus on scaling economics: if`10,000` agents are required now, they speculate that near-future model improvements could reduce this to ~`100` agents or make similar multi-agent runs cheap for less complex tasks. One commenter argues that such compute should demonstrate concrete public benefit, e.g. generating a viable disease cure.\n  - A technically relevant cost breakdown cites **Sam Altman’s reported estimate** that`10,000` agents running for`4 days` cost roughly`$10M` in compute. Commenters derive an approximate per-agent cost of`$1,000` total, or about`$250/day` /`$10/hour` , and discuss implications for replacing or augmenting junior-level knowledge work if orchestration and expert supervision improve.\n  - Several commenters focus on scaling dynamics: if `10,000` agents of the upcoming GPT model were needed for the claimed result, future model improvements or cheaper inference could reduce the requirement to perhaps`100` agents for similar outcomes. The underlying technical point is that multi-agent search over long horizons may become economically practical for less difficult tasks as model capability-per-dollar improves.\n- [**NEW: GPT-6 Astra edited 0.016% of Qwen's weights and its math score went up 6x**](https://www.reddit.com/r/Qwen_AI/comments/1xm9g7x/new_gpt6_astra_edited_0016_of_qwens_weights_and/) (Activity: 1022):** A** [**RuntimeWire report**](https://runtimewire.com/article/gpt-6-astra-edits-qwen-weights-weight-space-programming) **describes author-claimed MIT CSAIL “Weight-Space Programming” experiments where GPT-6 Astra edited** `131,072` **weights (**`0.016%`**) of Qwen3.5-0.8B, subtracting a loop-associated MLP output direction in layers** `15` **and** `19`**. Reported benchmark gains were large—MATH-500** `7.9% → 48.1%`**, GSM8K** `13.8% → 67.1%`**, IFEval** `21.0% → 62.3%`**—with MATH-500 token-limit failures dropping from** `93%` **to** `33.1%` **after** `50` **forward passes, suggesting the edit mainly removed a pathological “thinking loop” failure mode rather than adding general math capability. The setup is important: Astra operated through a Python kernel over weights with no GPU, used GSM8K/MATH training practice batches but reportedly not eval sets, failed to materially improve non-looping Gemma 3 270M, and the results remain author-reported/unreplicated with critiques that this resembles automated ML debugging more than direct “raw weight reading.”** Commenters viewed the result as potentially important for optimizing self-hosted models and as an early example of frontier models improving weaker models’ benchmarks. Some skepticism is implicit around whether this should be considered recursive self-improvement or simply targeted removal of a known failure mode.\n  - A detailed comment notes that **GPT-6 Astra** reportedly improved**Qwen3.5-0.8B** by identifying repeated reasoning loops tied to an MLP direction in layers`15` and`19` , then subtracting that direction from`64` output columns per layer—`131,072` weights total, or`0.016%` of the model. With`50` forward passes, reported scores rose from**MATH-500** `7.9% → 48.1%` ,**GSM8K** `13.8% → 67.1%` , and**IFEval** `21.0% → 62.3%` , while MATH-500 responses hitting the`32,768` token cap dropped from`93%` to`33.1%` .\n  - Commenters emphasized that the result should be interpreted as fixing a specific pathological failure mode rather than broadly making the model “6x smarter.” The targeted Qwen model was already known to suffer from thinking/reasoning loops, and the benchmark gains appear largely attributable to making the model terminate and produce answers instead of looping until the token limit.\n\n### 2. Claude/Opus Game Development Benchmarks and Limits\n\n- [**A Solo Developer Built This in 4 Days With Opus 5.5 + Godot. This Is Getting Ridiculous**](https://www.reddit.com/r/ClaudeAI/comments/1xmdih0/a_solo_developer_built_this_in_4_days_with_opus/) (Activity: 879):** A solo developer (**[** u/One_Cheek_8843**](https://www.reddit.com/user/One_Cheek_8843/)**) claims to have built a playable horror scene in** `4 days` **using Claude Opus 5.5 via Claude Desktop Code mode, Godot** `4.5.1`**, Meshy T2.5, Blender, and Nano Banana, with** ***no manual code edits*****. The workflow reportedly let Claude edit files, launch Godot, take screenshots, and iterate; ~**`100` **low-poly props were generated in** `10` **texture-atlas/material batches, with estimated Claude API-equivalent usage of ~$**`90` **for the core build and ~$**`180` **including experiments. The linked Reddit video could not be independently inspected because Reddit returned** `403 Forbidden`**, so the assessment is based on the post text and comments.** Top commenters were skeptical that this represents a complete game-development breakthrough, arguing it is closer to a static 3D scene, walking simulator, or asset placement demo than a game with mechanics, AI, collision robustness, story, and polish. Several devs framed this as the “easy first 80%,” with the remaining gameplay implementation, debugging, optimization, and production hardening likely taking months.\n  - Experienced developers argued the demo is mainly a **static 3D scene / level blockout** , not evidence of a finished game pipeline. They noted that placing walls, props, and atmosphere is the relatively easy “first 80%”; the hard parts are gameplay systems, AI, collision correctness, interaction logic, story/content integration, bug fixing, optimization, and polish.\n  - Several commenters questioned whether AI materially helped with the difficult parts of development, describing the result as closer to an **asset flip** or walking simulator. Specific technical criticism included missing interactivity, visible clipping through objects, and uncertainty about whether AI-generated 3D assets are properly optimized for real-time use.\n  - One commenter challenged the implied cost/effort model, saying that similar scene assembly could be done with existing asset packs from **Unreal FAB** plus a`$20/month` Claude/Opus subscription rather than high API spend. They argued that asset acquisition and optimization remain separate problems from code generation: Claude may help implement mechanics, but the quality, licensing, and performance of 3D assets are still major constraints.\n- [**I gave every Claude model the exact same prompt since July 2025. 13 models, 14 months, here's the evolution**](https://www.reddit.com/r/ClaudeAI/comments/1xn6eli/i_gave_every_claude_model_the_exact_same_prompt/) (Activity: 901):** A Reddit user ran the identical one-shot prompt across 13 Claude models over 14 months (fresh conversation each time, no manual edits) asking for a browser-based 3D infinite procedural terrain “video game” with shaders and continuous forward camera motion, then captured each Chrome result in real time. The author notes Sonnet 5.5 produced an output with a retained shader bug where trees fail to render; the linked Reddit video could not be accessed due to 403 Forbidden, so visual/implementation details can’t be independently verified.** Comments broadly praised the apparent quality jump in**Claude 5.5** /**Opus 5.5** , but one commenter argued the prompt is too underspecified to support meaningful model-to-model comparison because output variance reflects creative choices as much as capability.\n  - A commenter questioned the evaluation methodology, arguing that the shared prompt may be too underspecified to support meaningful cross-model comparison because output variance can reflect differences in interpretation rather than model quality. Another asked what `effort level` was used, implying that reasoning-effort settings could materially affect results and should be controlled or reported.\n  - One technical observation claimed **Sonnet 5.5** reproduced the*Avicii game* “`1:1` ,” raising a possible concern about memorization, prompt leakage, or overfitting rather than genuine generative improvement.\n- [**Anthropic confirms new Claude Code limits to prevent game cloning**](https://www.reddit.com/r/ClaudeAI/comments/1xm5vdp/anthropic_confirms_new_claude_code_limits_to/) (Activity: 2149):** Anthropic has reportedly confirmed new Claude Code safeguards aimed at preventing users from generating near-clones of existing games or reproducing copyrighted/proprietary software, with reports that enforcement is most visible when using Claude Code + Opus 5.5. The linked** [**Tom’s Hardware report**](https://www.tomshardware.com/tech-industry/artificial-intelligence/anthropic-confirms-new-claude-code-limits-to-prevent-game-cloning-users-report-opus-5-5-is-also-actively-blocking-reverse-engineering-tasks) **also notes user claims that Opus 5.5 is refusing some reverse-engineering and binary-analysis tasks, raising questions about whether the restriction is model-level, harness-level, or policy-routing specific.** Commenters debated whether the guardrails are selectively protective of game/IP owners while Anthropic benefits from copyrighted training data, and some suggested routing Claude through another toolchain or using it as a helper for models like**DeepSeek** to bypass restrictions. Others argued that if a game is simple enough to be “vibecoded” into a clone, the underlying design may be inherently easy to reproduce.\n  - One commenter reported a potential guardrail bypass pattern: using Claude Code as a “helper” for **DeepSeek** rather than asking it directly to generate a prohibited game clone, implying that policy enforcement may be weaker when Claude is framed as assisting another model’s output rather than producing the clone end-to-end.\n  - A technical distinction emerged around prompt specificity: requests like *“make me a copy of Pokemon, with perfect recreations of the monsters and mechanics”* are expected to trigger blocking, while genre-level prompts such as*“a monster catching game…with similar mechanics, in a retro 2D style”* may still pass. One user tested this with a**Digimon-inspired** prompt and said Claude continued into implementation details including fights, rules, and damage calculations, suggesting the guardrails may focus on explicit cloning of named copyrighted assets rather than abstract mechanics.\n\n### 3. Institutional AI Access Policies\n\n- [**Goldman Sachs restricted Claude Code to engineers only**](https://www.reddit.com/r/ClaudeCode/comments/1xn82hc/goldman_sachs_restricted_claude_code_to_engineers/) (Activity: 849):**The post claims Goldman Sachs restricted** [**Claude Code**](https://docs.anthropic.com/en/docs/claude-code/overview) **and** [**GitHub**](https://github.com/) **access to engineers/strats, removing access for bankers and traders. Top technical comments speculate the driver is LLM API cost control: non-engineering workflows like spreadsheet/PPT edits can become highly iterative and token-expensive—e.g. anecdotes of** `$50` **for a PowerPoint update and up to** `$1k` **for a complex spreadsheet task—whereas engineering use may amortize tokens by generating scripts/SQL/workflows that then run without further model calls.** Commenters debated whether this is mainly a cost/governance decision or a reputational moat: one argued that visible analyst dependence on Claude would undermine Goldman’s perceived human-advisory value. Another commenter framed local AI adoption—citing Revolut allegedly using local GLM models—as evidence that cloud LLM economics may push firms toward on-prem/local inference.\n  - Several commenters focused on **API/token cost dynamics** : one claimed basic office tasks can burn substantial spend (e.g.,`$50` for a PowerPoint update, potentially`$1k` for complex spreadsheet changes), arguing that non-technical users may create high-cost workflows because they prompt inefficiently and lack task decomposition. A data engineer countered that with Claude Code, token usage can*decrease over time* as code/workflows are built out, since automated SQL queries, notifications, and monitoring can run without continued model inference.\n  - There was a technical distinction drawn between **engineer-led automation** and non-engineer “vibe-coded” outputs: engineers can amortize LLM usage into durable code and operational workflows, while business users may repeatedly ask the model to regenerate spreadsheets/PPTs or hand off insecure prototypes. One example cited was a generated tool using a**clear-text JSON file as an authentication mechanism** , illustrating why unrestricted deployment of AI-generated apps can create security and maintenance risk.\n  - One commenter referenced fintech **Revolut** allegedly moving toward**local AI using GLM** , tying this to concerns that hosted model vendors like Anthropic/OpenAI face pressure from on-prem/local inference economics. The implication was that high API costs for broad enterprise usage may push firms toward local models, especially for repetitive internal workflows where privacy and marginal inference cost matter.\n- [**Google Will Turn Off Search for Schools That Reject A.I.**](https://www.reddit.com/r/singularity/comments/1xmxcxl/google_will_turn_off_search_for_schools_that/) (Activity: 912):** The post discusses a report titled “Google Will Turn Off Search for Schools That Reject A.I.”: commenters clarify that this is not framed as a punitive shutdown, but as a product-integration consequence because Google Search now includes built-in AI features. A quoted Google statement says** ***“Search and A.I. are deeply integrated”*** **and that if a school bans AI, students** ***“will not have access to search”*** **and will instead see a school-controlled availability message.** Top comments debate the framing: one argues the headline is clickbait/anti-AI rhetoric because schools banning AI are effectively banning an AI-integrated search product, while another predicts the policy will worsen public approval of AI in U.S. schools.\n  - A commenter highlights that the article’s key technical/implementation point is **Google Search and AI features are now bundled for schools** , citing Google education VP**Chris Phillips** :*“Search and A.I. are deeply integrated.”* The practical consequence is that if a school policy blocks AI tools, Google says students may lose access to Google Search itself and see an institution-level unavailable message, because Google does not offer a clean AI-free Search mode for that deployment.[Non-paywalled article](https://archive.is/20261103161439/https://www.nytimes.com/2026/11/03/us/google-search-schools-restrict-ai.html)", "url": "https://wpnews.pro/news/ainews-behind-latent-space-kill-my-saas-jev-ai-in-2026-aiei-shanghai", "canonical_source": "https://latent.space/p/ainews-behind-latent-space-kill-my-saas-jev-ai-in-2026-aiei-shanghai/", "published_at": "2026-11-04 19:17:30+00:00", "updated_at": "2026-11-04 19:52:20.954877+00:00", "lang": "en", "topics": ["artificial-intelligence", "machine-learning", "large-language-models", "ai-research", "neural-networks"], "entities": ["Hugging Face", "ML Intern", "Alex Krentsel", "MIT", "Qwen3.5-0.8B", "GPT-6 Astra", "Latent Space", "Simon Willison"], "also_reported_by": [], "alternates": {"html": "https://wpnews.pro/news/ainews-behind-latent-space-kill-my-saas-jev-ai-in-2026-aiei-shanghai", "markdown": "https://wpnews.pro/news/ainews-behind-latent-space-kill-my-saas-jev-ai-in-2026-aiei-shanghai.md", "text": "https://wpnews.pro/news/ainews-behind-latent-space-kill-my-saas-jev-ai-in-2026-aiei-shanghai.txt", "jsonld": "https://wpnews.pro/news/ainews-behind-latent-space-kill-my-saas-jev-ai-in-2026-aiei-shanghai.jsonld"}}