← Back to article

Equation 29 · OpenAI Model Systems from First Principles: Weights, Post-Training, and Inference Compute

What does this equation mean?

pkp_k

Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.

only achievable if something can identify the successful attempt. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.

Read it piece by piece

pkp_k

Symbol p_k

only achievable if something can identify the successful attempt.

Understand this part →

subscript

subscript

The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.

Understand this part →

How to interpret it

Read this expression with the definitions, units, and assumptions supplied by the article.

What the article says around this equation

which is concave in k and saturates quickly. Two caveats destroy any naive extrapolation from it. Attempts from one model on one prompt are strongly correlated, so realised gains fall well below this bound; and pkp_k is only achievable if something can identify the successful attempt. Without a verifier, extra samples buy candidates, not answers. This is precisely why the reasoning-effort control and the availability of parallel test-time compute are architectural facts about a product rather than mere quality dials — the GPT-5 system card describes a variant that makes use of parallel test-time compute, and states that all models were evaluated at high reasoning effort [ 1 ] .

Read the equation in its article →

Sources cited in the surrounding passage

These citations give research context. Read each source to check which claims it supports.

Return to OpenAI Model Systems from First Principles: Weights, Post-Training, and Inference Compute

Browse the mathematical compendium →