Volkswagen's UNYX 08 puts a VLA 2.0 driving model on 1,500 TOPS
China's EV price war now runs on model names, and Volkswagen's Chinese joint venture just added one to the list. Volkswagen Anhui launched the refreshed ID. UNYX 08 lineup on September 12, headlined by a new range-topping edition that debuts the latest generation of the VLA 2.0 driver-assistance model, backed by standard dual Turing AI chips rated at 1,500 TOPS. Limited-time prices run from 189,900 yuan for the UNYX 08 Pure to 249,900 yuan for the top all-wheel-drive variants. The demo feature is mapless navigation-on-autopilot that can be triggered from a standstill, with the car using vision alone to find its way out of an unmapped parking garage or tunnel while stepping around obstacles.
Why it matters is the standardization, not the trickle-down. A legacy automaker is now bundling high-end driver-assistance compute into a roughly $26,000 car — the same move Chinese startups spent two years making fashionable. VW's pitch with UNYX has always been an awkward pairing, foreign brand cachet plus local software speed, and this launch tilts the balance further toward the local half of that bargain. The VLA framing — vision-language-action, the same architecture family Chinese rivals use to describe their end-to-end driving stacks — signals Volkswagen is no longer marketing its own driving assistance in isolation, but competing inside a naming convention set by its Chinese competitors. The real test is behavior in traffic, not compute on a spec sheet. What to watch: whether the 1,500-TOPS hardware is actually used by later model releases, and how quickly rivals answer at the same price point.
A memory researcher sealed two AI agents in a room together and a true fact disappeared. In a post to r/AI_Agents, the author of an open-source agent-memory layer wired two instances to talk only to each other: one had heard 18 true facts, the other one falsehood plus five true facts. Each round, each instance asked the other about every pair it knew and overwrote its own view whenever the answer cleared a confidence gate. In the first round the instance holding the truth answered at confidence 17.7, and the instance holding the falsehood answered at 47.0 — the less informed agent was nearly three times as sure. Then both claims cancelled out: neither cleared the gate anymore, and from round two onward both agents went silent on that pair. The loop cost one fact out of eighteen, and median confidence barely moved across the entire run, from 14.10 to 14.99, with or without the loop.
The catch, stated by the author, matters as much as the result: the corpus is synthetic, the store is the author's own, and this is a benchmark written by the person whose product it tests. Treat it as a well-described anecdote, not a published finding. Still, the mechanism is uncomfortable and general — a two-agent system where agreement is the retrieval path can delete correct memories as easily as it spreads wrong ones, and confidence scores won't show it happening. Anyone running peer-to-peer agent memory should assume the interesting failure mode is silent subtraction, not visible corruption.
If two of your agents disagreed, would you trust either one's confidence score? Tell us in the comments.
Sources: membench / holomem (GitHub)
