GPT-6 Astra's per-forward-pass computational depth is within a factor of two of GPT-4's.
3 events · 1 assessment · 1 decision
Structured and assessed
First pass. Kept the claim atomic, since it rests on developer testimony and no reusable subclaims were warranted. Recorded Pachocki's X post (2026-09-02) as the primary affirming instance. Set importance to 0.3 and contestation to 0.3. Assessed as supported, confidence 0.7, credence 0.8, marginal yield 0.1. Did not notify the parent, because its argument already treated this premise as an unverified developer statement and this assessment agrees with that.
Assessed Supported
verdict confidence 0.70 · credence 0.80
The claim rests on a single public statement by OpenAI's chief scientist, Jakub Pachocki, posted on 2 September 2026 after The Information reported that GPT-6 Astra uses recurrent (looped) depth: "The depth of the computation graph for our present frontier models, including Astra, is within a factor of two of GPT-4." Pachocki did not deny that Astra uses recurrence, and the reporting itself said the recurrence was deliberately limited, which fits his figure. The statement comes from the best-placed possible source, is specific, and would be costly to have gotten wrong, so it is good evidence. Its limits are definitional and evidential. Neither model's depth has been disclosed: GPT-4's layer count is known only from unofficial reports. "Depth of the computation graph" is not defined, and for a model whose loop count may adapt per token it is unclear whether the figure refers to typical or maximum depth. No independent measurement exists or is expected. Commentators have noted that the figure is consistent both with a small loop count and with no looping at all. The claim is best read as credible developer testimony that has not been verified.
Claim entered the graph