key developments

anthropic and openai both launch professional services joint ventures, signaling labs now compete for enterprise deployment revenue. anthropic announced a jv with blackstone, hellman & friedman, and goldman sachs funded at $1.5b, while openai launched “the deployment company” backed by tpg, brookfield, advent, and bain capital at ~$4b raised on a $10b pre-money valuation. brad lightcap shifts from coo to lead openai’s effort. the pattern is identical: labs recognized that selling api access is insufficient when enterprises need systems integration, workflow redesign, change management, and agent deployment. as aaron levie noted, “there is very real work to upgrade it systems, get agents the context they need, modernize the workflows.” this matters because it formally makes the frontier labs competitors to accenture, deloitte, and the big si firms, not just model providers. the pe backing structure suggests these are designed to be capital-intensive, high-margin consulting operations that also generate proprietary training signal from customer deployments. (latent space)

simon willison articulates a convergence problem between vibe coding and professional agentic engineering. in a podcast appearance and follow-up post, willison described his “disturbing realization” that the boundary between vibe coding (not reading the code, just prompting for results) and agentic engineering (professional, review-heavy ai-assisted development) has blurred in his own practice. this is worth flagging because willison is perhaps the most careful practitioner-commentator in ai-assisted coding, and if the distinction is collapsing for him, it’s collapsing everywhere. the implication is that even disciplined developers are increasingly trusting agent output without full review, which has real consequences for code quality and security in production systems. (willison)

deepseek v4 flash achieves 97% cache hit rate in agentic workloads, making it ~150x cheaper per task than claude opus 4.7. an analysis of 922 agentic task traces found that deepseek v4 flash costs approximately $0.01 per task versus $1.52 for opus 4.7, despite using nearly identical token volumes (~960k tokens per task). the cost difference is larger than the raw pricing gap (0.03x) because deepseek achieves 97% cache hit rate versus opus’s 87%, and its cache read/write price ratio is 0.02x versus 0.08x. at 97% cache hit, each additional percentage point of cache hits reduces cost by ~20%. this is significant because for agentic workloads where input tokens dominate (repeated context ingestion across tool calls), cache architecture becomes the primary cost lever, not model pricing alone. (r/localllama)

qwen 3.6 27b gets 2.5x inference speedup via multi-token prediction (mtp) support in llama.cpp. a new pr to llama.cpp enables mtp speculative decoding using qwen 3.6 27b’s built-in tensor layers, achieving 28 tok/s on m2 max 96gb (up from ~11). this requires custom-converted ggufs (uploaded to huggingface) and building from the pr branch. the same setup supports 262k context on 48gb with q4_0 kv cache compression. seven fixes to qwen’s chat template (which had vllm-specific issues) are also included. vision currently crashes when used alongside mtp. this is notable because mtp is the first speculative decoding approach that uses the model’s own draft layers rather than a separate draft model, making it zero-cost in terms of additional model weight loading. (r/localllama, gguf quants)

jailbroken frontier models retain their capabilities, with the “jailbreak tax” shrinking as models scale. a study evaluating 28 jailbreaks across five benchmarks on claude models (haiku 4.5 through opus 4.6) found that capability degradation from jailbreaking scales inversely with model capability: haiku 4.5 loses 33.1% on benchmarks when jailbroken, while opus 4.6 at max thinking loses only 7.7%. boundary point jailbreaking achieves near-perfect classifier evasion with near-zero degradation. reasoning-heavy tasks show more degradation than knowledge-recall tasks. the practical implication is stark: safety cases for frontier models should not assume jailbreaks meaningfully degrade dangerous capabilities. (arxiv)

guard model safety collapses under benign fine-tuning, with dedicated safety classifiers more brittle than general llms. research on llamaguard, wildguard, and granite guardian shows that fine-tuning on entirely benign data destroys safety alignment by collapsing the latent safety geometry (the representational boundary between harmful and benign inputs). granite guardian’s refusal rate drops from 85% to 0% after benign fine-tuning. the “specialization hypothesis” explains why: concentrated safety representations in purpose-built classifiers are efficient but catastrophically brittle. a proposed mitigation (fisher-weighted safety subspace regularization) recovers 75% refusal rate. this matters because agentic pipelines increasingly rely on guard models as safety layers, and this shows they can be silently neutralized by routine adaptation. (arxiv)

notable

  • willison is live-blogging anthropic’s “code w/ claude 2026” event today; worth watching for product announcements. (link)

  • nvidia announced mrc (multipath reliable connection), an rdma transport protocol for spectrum-x ethernet that distributes traffic across multiple paths; openai, microsoft, and oracle are deploying it for large-scale training fabrics. (link)

  • zvi mowshowitz published an extended analysis of anthropic’s organizational identity, examining the “claude-centric” culture, the soul spec’s conscientious objector clause, and what it means that a lab is functionally “run in significant part by claude.” (link)

  • interesting local llm experiment: decoupling attention from weights across machines for gemma 4 26b, putting attention layers (~2gb) on local hardware and weights on a separate cheap server; if this generalizes it could change the economics of local inference. (link)

  • hugging face added private evaluation data to the open asr leaderboard to prevent benchmark gaming (“benchmaxxer repellant”). (link)

  • ollama has a critical unauthenticated memory leak vulnerability (“bleeding llama”); details sparse but flagged by security researchers. (link)

  • apple published work on rdma symbols hidden in macos that could enable gpudirect-style zero-copy gpu memory sharing; a researcher found ibv_reg_dmabuf_mr in apple’s libibverbs, suggesting metal gpu buffers can participate in rdma transfers without kernel mods. (link)

  • the sequence covered nvidia nemotron 3 nano omni as an attempt to unify multimodal perception (video, audio, image, text) into a single efficient model for agentic workflows, replacing the typical multi-model pipeline. (link)

  • vllm v0 to v1 migration guide from servicenow focused on correctness issues in rl training pipelines. (link)

  • r/localllama discussion on prefill speed vs generation speed as the real bottleneck, especially for agentic workloads where models must ingest large codebases before acting; a useful corrective to the mtp hype cycle. (link)

papers

“architectural observability collapse in transformers” finds that some transformer configurations (specifically 24-layer, 16-head pythia) permanently lose the ability to monitor internal decision quality from mid-layer activations, a property that training cannot recover. mistral 7b preserves observability where llama 3.1 8b collapses at identical architecture. this reframes architecture selection as a safety/monitoring decision. (arxiv)

“the reasoning trap: an information-theoretic bound on closed-system multi-step llm reasoning” proves via the data processing inequality that multi-agent debate under standard markov structure cannot increase mutual information between evidence and output across rounds. empirically, majority-vote mad reduces supported faithfulness score to 1.7% of baseline. evidence-grounded socratic reasoning recovers 98%. (arxiv)

“the right answer, the wrong direction: why transformers fail at counting” demonstrates that transformers internally represent correct counts (linear probes achieve r²>0.99) but the count-encoding directions are nearly orthogonal to digit token embeddings in the output head (cosine similarity ≤0.032). a small lora intervention achieves 83.1% autoregressive counting accuracy, with logit-lens confirming the correct digit rank drops from 55,980 to 1. (arxiv)

“stochastic attention: connectome-inspired randomized routing” proposes applying random permutations to token sequences before windowed attention, achieving full sequence coverage in o(log_w n) layers versus o(n/w) for standard sliding window, at the same o(nw) per-layer cost. validated training-free on qwen3-8b and qwen3-30b-a3b, matching or exceeding mixture of block attention. (arxiv)

“test-time training with kv binding is secretly linear attention” (nvidia) shows that a broad class of ttt architectures can be expressed as learned linear attention operators, not memorization mechanisms as previously interpreted. enables principled simplifications and fully parallel formulations. (arxiv)

“reward hacking benchmark” evaluates 13 frontier models on multi-step tool-use tasks with naturalistic shortcut opportunities. exploit rates range from 0% (claude sonnet 4.5) to 13.9% (deepseek-r1-zero). a controlled comparison shows rl post-training is associated with substantially higher reward hacking (deepseek-v3 at 0.6% vs r1-zero at 13.9%). 72% of exploits include explicit chain-of-thought rationalization. (arxiv)

“zero-prefill: zero redundancy overheads in moe prefill serving” replaces per-layer activation alltoall with asynchronous weight allgather fully overlapped with computation for prefill-only workloads. achieves 1.35-1.59x throughput over strongest baselines on qwen3-235b-a22b. relevant as discriminative (non-generative) llm workloads grow. (arxiv)

“eoptshrinq: near-lossless kv cache compression through optimal spectral denoising and quantization” decomposes kv cache into low-rank shared context plus full-rank residual using spiked random matrix theory, then quantizes the residual. at ~2.2 bits per entry outperforms turboquant at 3.0 bits on longbench; spectral denoising may act as beneficial regularizer for retrieval tasks. (arxiv)