[AINews] Reality Checks on AI News (Yegge shuts down Gas Town, Databricks’ +60% Astra cost)

What it claims

This is a one-day digest (9/15–16/2026) whose editorial point is that headline cost-efficiency does not survive deployment. Benchmarks often show GPT-6 Astra as cheaper per task than Sol because it uses fewer tokens. Databricks nonetheless saw total coding spend rise about 60% when its engineers switched. Beyond that, the useful content is scattered practitioner numbers, mostly on agent harnesses and local Qwen3.8-27B deployment. The summary names those topics but does not give the figures.

Evidence

Astra in production and on leaderboards

• Databricks rollout. Databricks piloted with about 200 users before rolling out to about 3,500 engineers.
• Astra "unambiguously" beat Opus 5 / Sol 5.6 on high-complexity system design and long-range tasks.
• It may not materially help medium- or low-complexity coding.
• Their response was a dedicated Astra sub-budget to push selective use.
• Arena cost per task. Arena lists two figures per model. The first is an unlabelled delta and the second is cost per task:
• Astra Max: +11.7%, $3.94/task, against Sol xHigh at +7.0%, $1.03/task.
• Fable 5.1 Max: +13.7%, $4.40/task, against Opus 5 High at +10.2%, $2.07/task.
• Epoch. Epoch puts Astra first on its Capabilities Index. Claude Fable 5.1 remains strongest on software engineering.

Harness engineering

• Native harness. Across 21 model-harness pairs, Arena found a model's native harness matters less than often assumed.
• Context trimming. A context-trimming paper reports that protocol-aware retention kept 96.0% task success while saving 56% of tokens.
• Subagents. Practitioner view: subagents earn their cost for parallel research and context management. Deep multi-agent trees mostly do not.

Safety: capability laundering (Microsoft)

• A weaker unaligned model splits a harmful task into innocuous subquestions, asks an aligned frontier model each one, and recombines the answers locally.
• On CyBench, Gemma-4-31B consulting GPT-5.5 recovered 8 of the 14 tasks it had failed alone.
• On a CBRN attack chain, the rubric score rose from 62.3 to 83.1.

RL cost reference (Xiaomi MiMo-V2.6)

• Setup: 1568 prompts × 16 rollouts, fully async, with test-case and rubric-based rewards across multiple harnesses.
• An outside estimate puts cost at about $493k/day for the 1T-class Pro run and $247k/day for Flash.

Local Qwen3.8-27B (r/LocalLlama)

• 30-day run. Unsloth Qwen3.8-27B-UD-Q4_K_XL on an RTX 5070 Ti + RTX 4070 Super.
• 845.1 tok/s prompt processing and 73.8 tok/s generation.
• MTP acceptance 0.481.
• Swift-Qwen3.8-27B (UkisAI). An RL fine-tune that penalises reasoning-marker tokens. On the author's Aider eval at Q8_0:
• Completion tokens fell from 12,547 to 7,301.
• Seconds per case fell from 1,481 to 750.
• Tokens per solve fell from 19.3k to 12.1k.
• Pass1 / Pass2 were 30.8% vs 27.1% and 75.7% vs 77.6%, so quality is roughly comparable.
• Radeon AI Pro R9700 "90.8 tok/s" at Q8. The screenshot shows 49.3 GB VRAM. A later comment suggests three cards were used, so this is not a single-GPU result.

How to use it

Speculative decoding on llama.cpp. The 30-day Qwen poster measured this about 20% faster than MTP+ngram on their hardware:

--spec-type draft-dflash,ngram-mod

Their other mitigations:

• enforced subagents
• per-subagent reasoning-level control
• loop detection that deletes bad tool-call context

Quantization choice. A commenter ran millions of tokens at FP8 up to about 262k context with few looping or tool-call problems. They argue Q4 makes looping worse, so prefer FP8/Q8 if VRAM allows.

Voodoo Dynamic Quant is now MIT-licensed.

• Method. Gradient descent over per-tensor quantization gates chooses GGUF quant levels under a target file size. The objective is KL divergence against a BF16 reference.
• Where it wins. It is strongest at aggressive low sizes. The author concedes Unsloth Dynamic 3.0 may be better at mid and high quant levels.

Other releases with adoption terms

• Union Alpha. Free in Cline, 256k context, multimodal. Claimed near Astra/Opus 5 coding at about 18x lower expected cost. Provenance is unknown.
• RekaDaily-10k processed tier. 10,200 hours, 6.37M clips, 74.2 TB, Apache 2.0.
• Baseten Hosted Tools. Server-side web search for open models, claimed 15% lower latency than client-side execution.
• Apple Foundation Models on macOS 27. Invoked with fm chat. A commenter reports the 3B model at 85+ tok/s on an M4 Pro with 24GB, running on the Neural Engine.

Limits

Sourcing. Nearly everything is second-hand: tweets and Reddit posts relayed by the digest, with no methodology attached.

• Databricks' 60% figure has no baseline period or task mix.
• The Arena delta column is unlabelled.
• The Qwen and Swift numbers come from one person's hardware and eval each.

Ambiguity in the reported numbers

• The Swift Pass1/Pass2 pairs are not clearly ordered as fine-tune vs base.
• The source post itself mislabelled the model as "ThinkingCap."

Known failure modes for Qwen3.8-27B

• Reasoning can consume up to about 50% of context, with attempted traces of about 60k tokens.
• Tool calls get poisoned or repeated beyond 100k context.
• Cache reuse in llama.cpp is fragile.
• Endless reasoning loops were reported even at Q8.
• Commenters note the fixes are harness-dependent and may not transfer.

Voodoo compute cost. A commenter testing a similar layout-optimisation approach reported:

• About 40 minutes per optimisation step on a 6000 Pro at batch 128, for Gemma 3 1B, with uncertain convergence.
• Optimal layouts at 4k context differed substantially from those at 200k, so long-context calibration may be required.

Unverified claims. Altman's math-capability tiers and the Scott Aaronson remark about unreleased results come with no benchmarks or examples.

Truncation. Contrary to the existing summary's truncation note, the fetched text does include the less-technical subreddit recap (risk debates, agentic-coding workflows). The text still ends mid-section.