An unreleased Claude model chained five real exploit chains, and every one is already patched.
AspireAI community · Anthropic
Anthropic's Frontier Red Team used an internal research model to find separate bugs in Chrome, Safari, Android, Windows and Linux, chain each into a working exploit, and report them to vendors first.
In Chrome it used four flaws: V8 heap corruption, a V8 sandbox escape defeating ASLR, a CacheStorage race leaking privileged browser memory, and a FedCM use-after-free running code outside the sandbox. The proof of concept launches Calculator on stock macOS Chrome seconds after a page loads, no clicks. Anthropic says 62 CVEs were patched as of Chrome 156, 13 sandbox escapes.
The Safari chain never executes code. It chains a JavaScriptCore use-after-free, a Gigacage escape and a sandbox IPC bug to get read/write on browser memory, then flips one value to disable the same-origin policy. The Linux chain runs commands as root over the network with no credentials: 48 minutes to leak a kernel pointer, five more to a shell.
The honest limit: this is Anthropic's account of its own unreleased model, every number is Anthropic's, and the chains were built in a lab, not seen in the wild.
https://www.anthropic.com/research/discovering-vulnerabilities-with-claude
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.