ZeroHour

Search: “power management”

3 stories in the last 7d

Agent Harness vs Agent Framework vs MCP: Which Layer Owns the Loop, State, Tools, Permissions, and Recovery

Architecture explainer separates agent harnesses, frameworks, and MCP by which layer owns the loop, state, permissions, and recovery.

The article distinguishes agent harnesses (OpenAI Codex, Claude Agent SDK), which own the execution loop, sandbox, permission model, and recovery; frameworks (LangGraph, OpenAI Agents SDK, Microsoft Agent Framework), which supply composable primitives; and MCP, a stateless JSON-RPC wire protocol governed by the Linux Foundation's Agentic AI Foundation since December 2025. An ownership matrix maps the execution loop, state, tool transport, permissions, recovery, sandboxing, and multi-agent orchestration to each layer. The 2026-07-28 MCP specification made the protocol fully stateless, retiring the initialize handshake and session headers.

MarkTechPost · 2d agoAI research1

GPT-6 Astra pilots a surveillance drone and runs a business on its own

GPT-6 Astra outperforms Claude Fable 5.1 on Vending-Bench and becomes the first model to beat the human-AI baseline on all five Drone-Bench subtasks.

Andon Labs tested OpenAI's GPT-6 Astra on two agent benchmarks: Vending-Bench 2, where Astra averaged $15,515 running a simulated vending-machine business versus Claude Fable 5.1's $5,422, and Drone-Bench, where models write code for a DJI Tello EDU drone to navigate an office and follow a specific person. Astra is the first model whose best submissions beat the human-AI baseline on all five Drone-Bench subtasks, using a COLMAP and DA3 pipeline with depth filtering for 3D reconstruction. Reliability remains limited, as an average Astra run has only a 2.8 percent chance of passing all five drone steps sequentially. In Vending-Bench Arena, Astra refused a price-fixing proposal from GLM-5.3, while Claude Fable 5.1 participated in an arrangement Andon Labs classified as illegal price-fixing.

The Decoder · 4d agoAI research

Unsolved Problem by Fields Medalist Breached by Two High School Students

Two high school students used Claude Opus 5 and GPT-5.6 Sol to help solve an open Lorentzian polynomials problem, posting a 75-page arXiv proof.

Aayush Bathija and Prince Rohatgi of Oak Park High School, mentored by UCLA postdoc Daniel Soskin, published the 75-page paper 'Bounded Ratios for Lorentzian Polynomials' (arXiv 2609.05341), solving an open problem in Fields Medalist June Huh's Lorentzian polynomial theory. The main structural theorem extends bounded coefficient-ratio characterization from quadratic to arbitrary-degree polynomials via discrete convexity conditions. The students used Claude Opus 5 and GPT-5.6 Sol for exploration and proof ideas but independently verified all arguments; the result follows an open letter from 25 Fields Medalists voicing concerns about AI's impact on mathematical rigor.