Morning Brief, October 12th 2026
Amazon is reportedly negotiating to buy Decart for about $7 billion. Cheaper Jev decisions failed to deliver consistent savings on completed tasks. McDonald's faces an AI pricing lawsuit. A new coding learns to spot more failed runs.
Amazon reportedly enters talks to buy Decart for about $7 billion
Amazon is discussing a possible acquisition of Decart worth about $7 billion, according to Sunday reporting attributed to The Wall Street Journal and people familiar with the talks. The prospective buyer is new; Anthropic's abandoned pursuit was reported in September. No signed agreement or completed acquisition has been established.
Decart develops software that helps models run on different processors, alongside generative world models. That makes the reported interest more than a bid for another chatbot: software that eases a move between chips can make a cloud provider's own hardware easier to sell. Whether Amazon would preserve that portability for competing platforms remains unanswered. The reported price describes negotiations, not a transaction investors can treat as settled. SourcesB
Cheaper Jev decisions do not consistently make agents cheaper to finish
A study submitted Friday tested Jev across five and 4,500 task executions in ALFWorld and AndroidWorld. Individual decisions became cheaper and faster in every agent. Completed work did not improve as consistently: success stayed near the baseline in the household simulation but fell for two mobile agents.
Extra interactions and auxiliary reasoning consumed part of the saving. One agent became more expensive per successful outcome even though each attempt cost less. Failed recovery and premature declarations of completion were recurring problems. These are author-reported results. They identify the invoice a buyer should request: total spending divided by successfully finished tasks, with abandoned attempts included. SourcesA
McDonald's AI pricing lawsuit tests whether franchises can coordinate through software
A lawsuit alleges that McDonald's used an AI pricing system to coordinate prices across independently owned franchises, Reuters reported Thursday. McDonald's disputes the allegations and says franchisees control their prices. The dispute has not produced a judicial finding that the system fixed prices.
The consequential question is organizational: when separate franchise owners use a common pricing engine, is that a brand setting its commercial strategy or competitors coordinating? The answer cannot be inferred merely from the presence of AI. The case puts software recommendations, franchise independence and actual control over final prices into the same argument. Similar recommendations alone cannot establish coercion. SourcesB
Nadella calls for an emergency brake on AI systems
Satya Nadella proposed an emergency brake for AI models in an essay published Saturday. His argument treats models with privileged access as potentially compromised insiders and places permission controls and interruption mechanisms outside the model's own judgment.
That is a proposal for how systems should be governed, not an announcement that Microsoft has shipped a universal shutdown mechanism. The useful test is whether an operator can revoke authority during a task, including authority delegated to other services. A stop button on a chat window would not answer that question. The original social-media post was not retrievable during this run; the account here relies on published reporting. SourcesBC
X-AgentRed tests harms that emerge across connected services
X-AgentRed, submitted Friday, searches for harmful sequences across multiple services. It represents tools through their prerequisites and effects, then uses execution feedback to refine the paths it tests.
Across four frontier agent systems, the authors report finding harmful paths at 1.77 times the rate of their STAC baseline and covering 2.99 times as many tools. Those ratios belong to this evaluation, not to the share of deployed agents that can be compromised. The systems problem is concrete: individually permitted actions can combine into a forbidden outcome. Permission reviews that stop at each connector's boundary can miss the sequence that matters. SourcesA
SWE-Critix improves coding-run verification, while still missing failures
SWE-Critix trains a model to judge whether a coding agent actually completed its task. Friday's paper reports accuracy rising from 57% for its Qwen3 base model to 66% after and 78% after on a set of coding trajectories. The released weights, datasets and training scripts are listed on Hugging Face.
The limit deserves equal billing: the final verifier detects only 64% of failed . The authors also leave comparisons with and downstream repair experiments for future work. A learned reviewer can help triage runs; these results do not justify letting it replace executable checks.
A firm-level coding study separates more code from finished work
An August research paper drawing renewed attention examines AI adoption across 718 firms using Jellyfish engineering records. Its estimates associate adoption with about 30% more lines of code, 20% more commits and 23% more pull requests. The estimates for completed issues and larger work units called epics cannot be distinguished from zero at the study's statistical threshold.
The study follows adoption without randomly assigning it, so the estimates depend on its comparison method. An insignificant result also does not prove the effect is exactly zero. The distinction still matters to procurement: activity counters and delivered work are different outcomes. A contract justified by faster code generation needs a separate test for whether the organization ships more useful work. SourcesA
AlphaNIST learns assembly tasks in simulation without demonstrations
AlphaNIST trains a shared robot policy on 20 assembly tasks derived from a task board, using binary success rewards rather than demonstrations or hand-written subtask rewards. Friday's paper reports 98.2% training success and demonstrates sequences of ten part-pair assemblies without a prescribed order.
The project remains a simulation result. Its training system also varies initial conditions, including partially completed states, so the lesson is not that sparse rewards alone remove the need for careful task design. The next useful evidence would be performance on physical parts with uncertain friction, tolerances and sensing. Selected videos show what the policy can do; they cannot establish the frequency of failure outside the reported test. SourcesAA
TRL 1.15 reduces scoring memory, with an upgrade caveat
's October 8th TRL release adds a fused output-head path that avoids materializing a large intermediate during scoring. Its benchmark reports memory reductions of 52% to 82% and sequences up to 6.9 times longer.
Those figures come from synthetic inputs and a randomly initialized Gemma model on a B300 with a memory cap. They are not generation-throughput measurements or a promise for every training job. The release also changes adapter handling: targeting the output head through the incompatible path now raises an error, with a documented alternative. Teams upgrading for the memory saving should check their adapter configuration before rerunning an expensive job. SourcesA
RATED learns to avoid tools that have stopped working
RATED adds execution feedback to tool retrieval. A frozen semantic finds plausible tools, while a lightweight changes their ranking as calls succeed or fail. Friday's paper introduces EcoAgent, a collection of 5,172 tools, to evaluate the approach.
Under a simulated outage affecting 30% of tools, the authors report reducing faulty selections from 86.2% to 2.9%. The outage was simulated. The interesting design choice is to update operational preferences without retraining the underlying language model. A tool can still match a request perfectly on paper while being the wrong choice because it is unavailable now. Code and benchmark material are public; they were inspected, not executed. SourcesAA
DREAM repairs poisoned agent memory without retraining the model
DREAM targets backdoors in an agent's persistent memory. The method perturbs and reactivates memory to identify suspicious behavior, then selectively suppresses harmful material while reinforcing benign information. Friday's reports reductions of more than 95% in attack success on its tested memory attacks.
That is a reduction relative to the evaluated attacks, not proof that future instructions hidden in memory cannot work. It also leaves a deployment question: how much useful information might a repair suppress? Memory is increasingly part of an agent's operating state. A defense that repairs that state is worth testing, but it cannot inherit the stronger claim that the instruction-and-data boundary has been solved. SourcesA
Marvell prepares OCP demonstrations across switches, memory and optics
Marvell's October 8th announcement sets out demonstrations for the Global Summit opening today. The lineup includes a 102.4-terabit-per-second Teralynx switch, memory infrastructure, optical connections and storage components aimed at AI systems.
The announcement describes what the company plans to demonstrate, not for every component. Its breadth is the practical point: installing more requires moving data among chips, memory, storage and racks without leaving expensive compute waiting. Buyers should ask which demonstrated links are shipping, which require new host hardware and which remain a future integration project. A booth showing a complete path does not make every part of that path purchasable. SourcesA
Adaptive DHiSparse improves long-context serving for GLM and DeepSeek
Adaptive DHiSparse changes how systems divide stored attention history between and host memory, and combines that policy with . Friday's paper evaluates GLM and DeepSeek models under long contexts and concurrent requests.
For GLM-5.3 with DFlash2 at a 100,000-token context and concurrency of 128, the authors report 793 output per second per GPU, 1.45 times their HiSparse baseline. This is a particular serving configuration, not a new model capability score. The China and signal is in the surrounding software: published become more useful when serving systems can fit more active work around them. Independent reproduction and hardware-specific costs remain necessary before treating the ratio as a budget saving. SourcesA
MAGMA-Bench interrupts robot plans instead of grading only clean runs
MAGMA-Bench evaluates long-running coordination among multiple robots when missions change, execution fails or interruptions arrive. The Friday preprint reports that strong models already struggle in clean conditions and deteriorate under perturbations. It also releases 261,646 training examples.
The benchmark works at the level of robot skills, separating planning from perception and low-level movement. That makes it useful for studying coordination, while limiting what it can say about a physical fleet. A planner that recovers from a failed abstract action still needs a robot that detects the real failure correctly. The benchmark's contribution is to make interruption and recovery part of the score. SourcesA
SqueezeBench rewards tighter mathematical bounds, with proofs required
SqueezeBench replaces a fixed mathematics test with records that agents can improve. A submission must tighten a bound and supply a machine-checkable proof, checked through two kernels. Friday's paper starts with ten extremal-combinatorics problems and 20 records.
Early agents made 82 accepted submissions without beating the mathematical literature. Newer models improved 19 of the 20 initial records, but eight of the ten problems still lag known best asymptotic results. Those distinctions keep a benchmark improvement from becoming an unsupported discovery claim. A moving target with checked proofs makes repeated progress measurable; comparison with existing mathematics remains a separate obligation. SourcesA
Web$hell gives browsing agents persistent objects to revisit
Web$hell turns web content into addressable information and action objects that an agent can retain and revisit. The Friday preprint brings search, browsing and subsequent access under a common interface, with a intended to reduce repeated work.
The authors describe the system as work in progress and report better efficiency, but the abstract does not supply enough numerical detail to price a deployment. The architectural idea is still useful: an agent should not have to rediscover the same page structure every time it returns to a task. The difficult cases will be stale cached content and actions whose permissions or meaning have changed since the first visit. SourcesA
DP-MIND keeps original document text local while answering long-context questions
DP-MIND proposes a question-answering pipeline that perturbs document chunks before sending them to an external model, builds compact memory and restores answer spans locally. Friday's paper combines with training designed to tolerate the resulting noise, including experiments on million-token documents.
The proposed division of work addresses a real conflict: an external model needs useful evidence, while the owner wants to retain sensitive originals. Its protection depends on the privacy and threat model, which an abstract-level description cannot settle for a particular organization. The research is a mechanism to examine, not a blanket assurance that sending transformed documents to any provider is safe. SourcesA
A teacher model gives better training signals after writing a critique
A Friday preprint finds that letting a teacher model see the correct answer does not reliably make its token-level training scores point out a student's mistake. Asking the teacher to write a critique first improves the corrective signal in the authors' mathematical experiments.
The result narrows a common assumption about : knowing the answer and teaching the next useful step are different capabilities. The study does not establish that the method improves every domain or a frontier model at production scale. It gives training teams a specific comparison to run before spending more on an answer-informed teacher whose scores may still fail to explain the error. SourcesA
MENTOR supplies targeted hints when training gets no successful attempts
MENTOR addresses a reinforcement-learning dead end: if every attempt fails, a success-based reward gives little about what to change. The Friday paper diagnoses unsuccessful attempts and generates hints for subsequent ones, using a diagnosis tailored to the failed run.
The authors report improvements on mathematics and coding tasks with small language models. The intervention changes the training experience, so a hinted success should not be confused with an unaided deployment result. Its appeal is practical: difficult tasks need not be discarded merely because an early policy cannot solve them. The next comparison should measure what survives when the hints are removed. SourcesA
MASTIF tests the web-agent stack around the model
MASTIF evaluates combinations of three language models, three protocols and four implementation frameworks on 300 Mind2Web tasks. Friday's baseline assessment finds that task-specific stack choices affect completion, efficiency, verbosity and execution time.
The paper's abstract does not establish one universal winner. That limits the headline but strengthens the purchasing lesson: a model's standalone score does not specify the behavior of the system assembled around it. Framework and protocol choices belong in an evaluation with the actual tasks. Otherwise a team can replace the model while preserving the component that was preventing completion. SourcesA
VIGOR checks whether generated layouts can physically fit
VIGOR evaluates generated layouts against 94 checks across 1,749 constructible scenarios, including collisions, clearances, aisles and structural constraints. Friday's paper combines generation with local fixes and joint repair of conflicting choices, reporting 96.86% complete feasibility on its evaluation.
Executable design code is only the beginning of that test: a program can run and still place two objects in the same space. The reported result concerns the benchmark's specified constraints, not a building permit or engineering certification. Its useful contribution is an explicit repair loop around geometric requirements, making a failure something a system can locate rather than a picture a reader has to distrust. SourcesA
Editorial
My conviction: the unit of purchase should be a finished task with a recoverable failure path.
That sounds like a procurement detail until a cheaper decision engine lowers the cost of each attempt and raises the cost of a successful outcome. The Jev study makes that distinction measurable. A buyer who pays attention only to the successful demonstration is also buying the retries, abandoned runs and human investigations that the demonstration omitted.
Verification has its own failure rate. SWE-Critix improves at judging coding runs while still missing a substantial share of failures. Putting another model at the end of a workflow can improve triage without turning judgment into proof. Tests, permission boundaries and accountable owners still have jobs.
I would require an agent pilot to report spending on failed attempts, time spent recovering and the fraction of tasks that needed a person to intervene. Then I would interrupt a task after it had delegated work. If the operator cannot identify and revoke the outstanding authority, the pilot has not established control over the system it is asking the business to buy. Repeated field trials showing that cheaper decisions reliably predict lower completed-task costs, with negligible recovery labor, would weaken my demand for this separate accounting. SourcesAA
Prediction Watch
No change. Nobody solves (Prediction 2026-08-06-T4). DREAM reports progress against selected poisoned-memory attacks. That does not establish the independently tested, broadly adopted architectural defense required to overturn the call. Settles August 6th 2027. SourcesA
China and open weights: Adaptive DHiSparse supplies serving research for GLM and DeepSeek, while SWE-Critix publishes Qwen-based verifier checkpoints. No new Chinese flagship release was verified in the searched results. SourcesAA
Nothing settled today. No completed Amazon-Decart acquisition was verified, and the research results above were not independently reproduced by this publication.
Sources
- B SiliconANGLE: reported Amazon-Decart negotiations. Search result accessible; full-page retrieval failed. Account attributes the reporting to The Wall Street Journal.
- A Jev agent-cost evaluation.
- B Reuters: McDonald's AI pricing lawsuit.
- B TechCrunch: Nadella's emergency-brake proposal; C RuntimeWire account. Original social-media post could not be retrieved.
- A X-AgentRed.
- A SWE-Critix paper and released artifacts.
- A Jellyfish-based firm-level coding study, August version.
- A AlphaNIST paper and project demonstrations.
- A TRL 1.15 release notes.
- A RATED paper and EcoAgent repository.
- A DREAM.
- A Marvell's OCP announcement.
- A Adaptive DHiSparse.
- A MAGMA-Bench.
- A SqueezeBench.
- A Web$hell.
- A DP-MIND.
- A Critique-conditioned self-distillation.
- A MENTOR.
- A MASTIF baseline assessment.
- A VIGOR.
- A Wikipedia-style navigation evaluation.
Research limitations: the new preprints were submitted October 9th. Reported benchmark gains are the authors' results. The coding study is older work receiving renewed attention. No laboratory or production experiments were run for this edition.