Grok 4.6 在三个编码任务中以 $13.11 总成本击败 GPT-5.6 Sol 的 $20.18,模型调用次数 201 次对 338 次,总耗时 129 分 41 秒对 149 分 33 秒。两次运行分别消耗约 20M 和 26M tokens,其中 93-98% 的输入 token 为缓存读取,若无提示缓存成本将增加约 4 倍。
Grok 4.6 beat GPT-5.6 Sol on agentic loop efficiency, spending $13.11 versus $20.18 across the same 3 builds.
Grok 4.6's edge came from bigger coding steps: 201 model calls versus GPT-5.6 Sol's 338.
Really Interesting experiments by @thehypedotnews, a 24/7 AI news in a really nice radio format. (love their chillout music)
1 number in this comparison explains a lot about where coding-agent economics are heading:
93-98% of the input tokens were cache reads.
These runs consumed roughly 20M tokens for Grok 4.6 and 26M for GPT-5.6 Sol, yet the author estimates they would have cost around 4x more without prompt caching.
grok 4.6 vs gpt 5.6 sol – on three @gameofthrones castles two coding agents built three 3d castles from scratch in a single html file each, then had to render them in a real browser, prove the result with pixel measurements and fix what the numbers exposed before they were allowed to hand anything over the setup: each model in its own vendor cli – @spacexai's grok build, @openai's codex – both pointed at one @openrouter key. identical brief, identical reference image, identical verifier. no hints tasks: 1. castle black – the night's watch fort under the wall. a walled ward of black stone, a timber lift climbing 200m of ice, three arched openings with a braced gallery and an open riser stair, a mud yard. four reference photos, with one rule: open all four before writing code, open them again after every change, and follow the photo over our text wherever the two disagree 2. winterfell – an aerial snow diorama. twin curtain walls, drum towers, the godswood with the red weirwood, steam off the hot springs, day to night, and it has to stay smooth on a laptop 3. riverrun – the tully castle on its triangle between two rivers. coursed masonry with quoins, corbel tables under every parapet, conical roofs sitting on drum towers, true semicircular arches, and a button that floods the moat the binding rule: a verifier that opens the page in a real browser, collects every error and warning including shader compile failures, and measures the frame. zero errors, zero warnings, exposure proven by rgb numbers, every mode checked on its own. shipping unverified is a fail • total cost #1 grok 4.6 – $13.11 #2 gpt 5.6 sol – $20.18 • total build time #1 grok 4.6 – 129m 41s #2 gpt 5.6 sol – 149m 33s • total tokens #1 grok 4.6 – 19,951,587 #2 gpt 5.6 sol – 25,687,511 • model calls #1 grok 4.6 – 201 #2 gpt 5.6 sol – 338 • lines shipped #1 gpt 5.6 sol – 2,184 #2 grok 4.6 – 4,751 • how heavy the finished castles are, in polygons #1 grok 4.6 – 98k, 32k and 56k #2 gpt 5.6 sol – 148k, 144k and 104k observations: • all six builds passed with zero errors and zero warnings. the same brief without a verifier had produced a black screen from two one line shader mistakes, so the loop is doing the work here, not the model • grok ships lighter scenes and more code. castle black runs on 56k polygons against sol's 104k, out of a file carrying 1,672 lines against 640 • sol works in very small steps – 433 output tokens per call against grok's 1,706, and 338 calls against 201. on castle black it finally paid off: sol finished 5m 32s ahead • 93 to 98 percent of input tokens were cache reads. without prompt caching these runs cost about four times more, which is most of the economics of agentic coding right now follow @thehypedotnews for 24/7 ai news, analysis and breakdowns在 X 查看被引用的帖子
来源:Rohan Paul · x.com