← All parts of this equation

Equation 1 · Part 6 · The Hidden Infrastructure Bill Behind Every RAG Answer

Symbol r

CRAG(Q)=pstore⋅S  +  Q⋅(pru⋅r(S)+prerank)C_{\mathrm{RAG}}(Q) = p_{\mathrm{store}} \cdot S \;+\; Q \cdot \left( p_{\mathrm{ru}} \cdot r(S) + p_{\mathrm{rerank}} \right)
rr

What this part means

r is one of the signed contributions combined to compute the quantity on the left.

Its job in the formula

r is one of the signed contributions combined to compute the quantity on the left.

The passage around this formula

What the convergence does support is a real, worked comparison. Write the retrieval pipeline’s monthly cost, using the terms established above, as a fixed storage component plus a per-query component that itself has two parts: CRAG(Q)=pstore⋅S  +  Q⋅(pru⋅r(S)+prerank)C_{\mathrm{RAG}}(Q) = p_{\mathrm{store}} \cdot S \;+\; Q \cdot \left( p_{\mathrm{ru}} \cdot r(S) + p_{\mathrm{rerank}} \right). where S is index size in gigabytes, r(S) is Pinecone’s documented read units per query as a function of that size, Q is monthly query volume, and pstorep_{\mathrm{store}} , prup_{\mathrm{ru}} , and prerankp_{\mathrm{rerank}} are the published per-unit rates given earlier. Set against it, the cost of skipping retrieval and instead inlining a fixed block of extra context on every single call is

Read this part in the article →

Learn the underlying idea

A function assigns an output to each allowed input. The expression f(x) means “apply f to x”.

Open the illustrated functions: inputs become outputs guide →

See this notation across published equations →

Sources cited in the article section

These citations provide research context; check each source for the exact claim it supports.