Skip to main content
Reading viewAll insights →
BLOG16 min read

Four Orders of Magnitude of Archive Cost 1.9 Units of Discrimination

Four Orders of Magnitude of Archive Cost 1.9 Units of Discrimination
Tarry Singhby Tarry SinghFounder & CEO · 11 Sep 2026
Share

ADNOC and AIQ signed a 340 million dollar three-year contract for ENERGYai, built on 70 years of proprietary data. Saudi Aramco announced Metabrain on 250 billion parameters, 7 trillion data points and more than 90 years of company history. Equinor has found more than 100 further AI use cases. ExxonMobil is running elastic full wavefield inversion on 4,032 Grace Hopper superchips. Every one of those is sold on the size of the archive, and the archive size is the one term in the problem that behaves benignly. Model retrieval as signal detection and the arithmetic is blunt: at a fixed retriever the pile you must read grows exactly linearly with the archive, 10 documents at 100,000 becoming 100,007 at a billion, while holding the pile at 10 instead needs the discrimination index to move from 3.719 to 5.612. Four decades of archive cost you either a factor of ten thousand in reading or 1.893 units of discrimination, and nothing in between. The term that decides which, the base rate of an answer-bearing document, is the one nobody measures before buying.

Four disclosures, all inside two years, all selling the same thing. On 10 March 2025 AIQ announced a 340 million dollar contract, over three years, to deploy ENERGYai and related solutions across ADNOC's upstream operations, built on 70 years of proprietary data and knowledge, with five fully operational AI agents covering subsurface tasks and a stated plan to scale to thousands of additional wells across more than 28 producing fields [1]. Two months earlier ADNOC reported the completed trial: over 50 years of its knowledge and petabytes of its proprietary data, data from over 15% of its onshore and offshore wells, and a 70% improvement in accuracy in major seismic interpretation aspects [2]. At LEAP in Riyadh on 4 March 2024, Saudi Aramco presented Metabrain, 250 billion parameters trained on 7 trillion data points spanning more than 90 years of company history, aimed among other things at analysing drilling plans and geological data [3]. Equinor, having reported its 2025 AI results in January 2026, says it has identified more than 100 further AI use cases [4]. And ExxonMobil, which does not lead with an archive figure at all, is putting 4,032 NVIDIA Grace Hopper superchips behind elastic full wavefield inversion to take 4D seismic processing from months to weeks [5].

Notice which number appears in three of those five statements and which does not. Years of archive: 70, over 50, more than 90. Documents in the archive: nowhere. Not in any of them. That asymmetry is not a presentational accident, and it is the subject of this piece, because the size of the archive is the one term in the retrieval problem that behaves benignly and the term that decides everything is the one nobody prints.

The archive is the denominator, not the asset

Strip the marketing off an agentic subsurface assistant and the load-bearing component is a retriever. Somebody asks a question. The system ranks the corpus, takes what clears a threshold, and hands the survivors to a language model or to a person. Everything downstream is conditioned on that step, and the step is a plain signal-detection problem.

Write it in the equal-variance Gaussian form, which is the one that makes the scaling visible. Let the archive hold NN documents, of which RR actually answer the question that was asked. The retriever assigns a score. Irrelevant documents score N(0,1)\mathcal{N}(0, 1); answer-bearing ones score N(d,1)\mathcal{N}(d, 1). The separation dd is the discrimination index, and it is the only property of the retriever that enters. The reader accepts everything above a threshold tt.

Now the assumption everyone skips. RR is set by the question, not by the archive. Adding four decades of end-of-well reports to a corpus does not add four decades of answers to "what mud weight did we run through the Shuaiba in this block" or "which wells in this field logged a resistivity image over the reservoir interval". There is a small number of documents that answer any specific question, and it is roughly the same small number whether the archive holds a hundred thousand documents or a billion. So the base rate

Base rate of an answer-bearing document
π=RN\pi = \dfrac{R}{N}

falls as the archive grows. The archive is the denominator. It is not, by itself, the asset.

Two growth laws, one of them brutal

Pin the threshold at t=dt = d, the mean of the answer-bearing scores. That is the median-recall operating point, where exactly half the answer-bearing documents clear the bar, and it has the pleasant property that the threshold and the discrimination index are the same number, so one axis carries both. Nothing that follows depends on that choice: at any fixed recall pp the threshold is t=dzpt = d - z_p, every dd in this piece shifts by the same constant zpz_p, and every difference between two of them is unchanged.

With Q(z)=1Φ(z)Q(z) = 1 - \Phi(z) the upper tail of the standard normal, the irrelevant documents a reader must wade through is

Irrelevant documents above the threshold
F(N,d)=(NR)Q(d)F(N, d) = (N - R)\,Q(d)

which is linear in NN. A better ranker changes Q(d)Q(d), which is the slope. It does not change the fact that the relationship is a straight line in NN, crossing zero at N=RN = R. On a log-log plot the line has slope one at any dd whatsoever, and dragging the retriever slides it up and down without ever bending it. The slope is not exactly one, because the subtracted RR still counts at the left of the axis, but the departure bends the drawn line by under a hundredth of a pixel.

Ask the other question instead. Fix a reading budget: KK irrelevant documents is all anyone will open before giving up. What discrimination holds the pile at KK as the archive grows? Solve (NR)Q(d)=K(N-R)\,Q(d^{*}) = K:

Discrimination required to hold the reading budget
d(N,K)=Q1 ⁣(KNR)    2ln ⁣(NK)d^{*}(N, K) = Q^{-1}\!\left(\dfrac{K}{N - R}\right) \;\sim\; \sqrt{2\ln\!\left(\dfrac{N}{K}\right)}

The right-hand form is the leading-order Gaussian tail asymptotic, and it is the shape rather than the number. The shape is the whole argument. Reading grows like NN. The discrimination that would hold reading constant grows like lnN\sqrt{\ln N}.

Put the two together at figures a buyer would recognise. Set R=10R = 10, ten documents in the archive that answer the question, and a reading budget of ten. At N=105N = 10^{5} the retriever that exactly meets the budget is d=3.719d = 3.719, and it puts 10.00 irrelevant documents in front of the reader. Hold that retriever fixed and grow the archive to N=109N = 10^{9}, and the same retriever now puts 100,007 in front of them. The exact ratio of those two counts is (10910)/(10510)=10,001(10^{9}-10)/(10^{5}-10) = 10{,}001, a factor of ten thousand. To hold the pile at ten instead, the required discrimination goes from 3.719 to 5.612. Four decades of archive cost either a factor of ten thousand in reading or 1.893 units of discrimination, and there is nothing in between.

THE ARCHIVE · WHAT THE SIZE OF THE PILE BUYS0.000discrimination required, less the discrimination you haveTen documents answer the question at any archive size, so the pile grows and the answers do notDrag the archive: the aqua count climbs a decade per decade while the amber requirement creeps.IRRELEVANT DOCUMENTS TO READ, LOGDISCRIMINATION REQUIRED, LINEAR0.1110010 k1 m100 m123456710 k100 k1 m10 m100 m1 bnARCHIVE SIZE N, DOCUMENTS (LOG SCALE)our indexed archive, 144,552 files: 136,771 TIF + 7,781 LASthe only marker: no cited disclosure states an archive size in documentsRETRIEVER SCORES · EACH BELL SCALED TO ITS OWN PEAK, NOT ITS COUNTirrelevant documents, N(0, 1)answer-bearing documents, N(d, 1)your threshold, sitting at dthe threshold that admits only Kthe tail that supplies the budgetcounted in the panel, not drawnBASE RATE1 in 10,00010 answer-bearing, 1.00e-4 of the pilePRECISION AT THIS THRESHOLD33.3%5 answers in 15.00 openedIRRELEVANT DOCUMENTS TO READ10.00budget 10, tail Q(d) = 1.00e-4DISCRIMINATION REQUIRED3.719you have 3.719ARCHIVE SIZE N100.0 klog slider, 10.0 k to 1.00 bnREADING BUDGET K10irrelevant documents you will open, 1 to 100RETRIEVER DISCRIMINATION d3.719score separation in sigma, 1.000 to 7.000equal-variance Gaussian detection algebra at the median-recall operating point, not a measured retrieval benchmark
Two laws for the same archive. The aqua line is the irrelevant pile a fixed retriever puts in front of you, (N less R) times Q(d), which is linear in N. On this log-log frame that reads as a straight line of slope one, and the discrimination slider moves its height without ever bending it. The amber curve is the discrimination that would hold that pile at the reading budget K, and it climbs, to leading order, like the square root of twice the log of the archive. Leave the retriever where it starts, at d = 3.719, and drag the archive from 100 k to 1.00 bn: the aqua readout runs from 10.00 to 100,007 while the amber one runs from 3.719 to 5.612. Four decades of archive cost you either a factor of ten thousand in reading or 1.893 units of discrimination. The budget slider is the weak lever by comparison, because K enters only inside a logarithm: at N = 1.00 bn, running K from 1 to 100 walks the requirement from 5.998 down to 5.199, a span of under 0.8 against the 1.893 those four decades demand. The strip underneath is where the whole effect lives. Both bells are drawn to the same peak height rather than to their counts, since the answer-bearing bell carries ten documents and the other carries almost all of N. The amber rule is the threshold that admits exactly K irrelevant documents, it slides right as the archive grows, and the amber band on the floor marks the tail beyond it. That band is drawn as a band and not as a height on purpose. Measured across the whole control space, the irrelevant bell's height at the rule runs from about one part in 15 at the shallowest setting the controls allow down to about one part in 65 million at the deepest, and it is one part in a thousand at the default. So for almost anywhere you can put these controls, the region carrying the entire reading cost has no drawable height, and the count belongs in the panel rather than in the picture. The one named marker on the archive axis is our own indexed corpus, and it stands alone because not one of the operator disclosures this piece cites states an archive scale in documents.

What the instrument is for

Drag the archive slider and watch one readout explode while the other creeps. That is the finding, and it is worth reaching by hand rather than by reading a table, because the asymmetry is much larger than intuition allows for.

Then drag the other two. The reading budget is the lever most procurement conversations end up pulling, usually dressed as a larger context window: we will just show the model more documents. At a billion-document archive, running the budget from 1 to 100 walks the required discrimination from 5.998 down to 5.199, a span of under 0.8. Four decades of archive demand 1.893. The budget lever is worth less than half of what the archive growth costs, because KK enters only inside a logarithm while NN enters linearly. Buying context is the expensive lever, and it is the one everybody pulls.

The score strip along the bottom is where the whole effect lives, and it is drawn to make one point that a table cannot. The amber rule is the threshold that admits exactly KK irrelevant documents, and it slides right as the archive grows. Everything the reader must wade through comes from the region beyond it. Measure the height of the irrelevant bell at that rule and you get the point in one number: about one part in 15 at the shallowest setting the controls allow, one part in a thousand at the default, one part in 65 million at the deepest. So across almost the whole control space the region that carries the entire reading cost has no height you could draw, which is why the band on the floor marks the region and the count sits in the panel. The effect that dominates the economics of the system is not visible at any scale you would draw the distributions on.

One number in that frame is measured rather than modelled, and it is ours.

The base rate is the number nobody measures

We indexed a real archive for a Texas onshore operator: 136,771 scanned TIF rasters and 7,781 machine-readable LAS files, deduplicated and catalogued into something a model could ingest (Indexing a 136,771-Scan Raster Archive [6], and the ratio argument that came out of it in What 136,771 TIFs and 7,781 LAS Files Teach You About Real Data [7]). That is the single marker on the archive axis in the instrument above, at 144,552 files, and it is alone there for a reason worth stating plainly: not one of the operator disclosures at the top of this piece states an archive scale in documents. Petabytes, data points, years, square kilometres. Not documents. So there is nothing else honest to plot.

What that indexing job taught us is not the count. It is what the count did not tell us. We knew, exactly, how many files there were. What we did not have, and what nobody on either side of the engagement asked for, was RR: how many documents in that corpus actually answer a given question. Counting the archive is a data-engineering task and it finishes. Estimating the base rate needs a labelled question set, somebody who knows the field well enough to say which documents genuinely answer each question, and the discipline to hold that set back from whatever is being tuned. Nobody budgets for it, because the archive count feels like the same kind of number and is a thousand times cheaper to get.

It is not the same kind of number. Look again at the readout column. At 100,000 documents with ten answers and a retriever at 3.719, precision is 33.3%: five answers among 15 documents opened, and a geologist will happily read 15. At a billion documents the same retriever gives 0.0050%. Same retriever, same question, same ten answers. What changed was only the denominator, and the denominator is the thing being sold.

This is also why the ADNOC trial's headline figure is hard to act on. A 70% improvement in accuracy in major seismic interpretation aspects is a real, specific claim, and the release states no baseline for it [2]. An accuracy improvement without a denominator is structurally the same gap as an archive without a base rate: a ratio quoted with one side missing. That is not a criticism of the result, which may well be excellent. It is an observation about what a press release can carry and a note on what a buyer has to ask for separately.

What to ask for instead

Three things, none of which is hard for a vendor who has done the work.

First, the base rate on a real question set. Not the corpus size. Take 50 questions the asset team actually asks, have somebody qualified mark which documents answer each one, and report the median count. That number, divided by the corpus size, is π\pi, and it is the number that decides whether the system is usable. It is also the number that tells you whether the corpus should be partitioned before it is indexed, which is usually the cheapest real fix available: retrieval over one field's end-of-well reports is a different problem from retrieval over the whole company.

Second, discrimination rather than recall. Recall at some unspecified operating point is close to meaningless, because it can always be bought by lowering the threshold and paying in reading. Ask for the pair: the recall and the number of irrelevant documents that came with it, at the archive size the system will actually run against. Two numbers, one operating point. From those you can back out dd and put it on the axis above.

Third, the scaling test the vendor has already run, or an admission that they have not run one. Index a tenth of the corpus, then the whole corpus, and report the reading pile at fixed recall for both. The prediction from the algebra is a factor of ten. If the measurement comes in materially under that, something good is happening that the vendor should be able to explain, most often a partition or a metadata filter doing work the ranker is being credited with. If it comes in at ten, the system is behaving exactly as this model says it will, and the buyer now knows what the next order of magnitude of archive is going to cost.

None of this argues against large archives. 70 years of proprietary well data is a genuine asset, and Equinor's published interpretation and value figures, which we worked through separately in Sixty-Four Wells a Year [8], are genuine results. The argument here is narrower. The archive is what makes the answer available at all, and it is simultaneously what makes the answer hard to find, and only one of those two effects appears in the announcement. A buyer who reads "70 years of proprietary data" as a capability claim has read the numerator and skipped the denominator.

Takeaways

  1. AIQ, ADNOC and Saudi Aramco all lead with the age of the archive, at 70, over 50 and more than 90 years; not one of the five disclosures cited here, theirs or Equinor's or ExxonMobil's, states an archive scale in documents, which is the unit the retrieval problem is posed in.
  2. At a fixed retriever, the irrelevant documents a reader must wade through is (N minus R) times Q(d), exactly linear in the archive: on a log-log frame that reads as a straight line of slope one, and a better ranker moves its height without ever bending it.
  3. Holding that pile at a fixed reading budget needs discrimination growing like the square root of twice the log of the archive, so four decades cost 1.893 units of d against a factor of ten thousand in reading.
  4. The reading budget, which is what a larger context window buys, is the weak lever: at a billion documents, running it from 1 to 100 walks the requirement from 5.998 to 5.199, under 0.8, against the 1.893 that four decades of archive demand.
  5. The base rate of an answer-bearing document is the term that decides precision, and it falls as 1/N because a bigger archive holds more of everything except answers to your question.
  6. We counted a real archive exactly, 136,771 TIF rasters and 7,781 LAS files, and still did not have the base rate; counting the corpus is a data-engineering job that finishes, while estimating the base rate needs a labelled question set nobody budgets for.

Limitations

This is exact algebra for an idealised detector, not a measured retrieval benchmark, and four things about it are worth holding at arm's length.

The equal-variance Gaussian model is a convenience. Real retrieval scores are not Gaussian and the two populations rarely share a variance, so dd here is a summary of separation rather than a quantity you would measure directly off a production system. The scaling result survives that in two parts. Reading is linear in NN at any fixed operating point whatever the score distribution is, because it is a count of documents multiplied by a fixed probability, and no tail assumption enters. The requirement grows sublinearly for any tail decaying at least as fast as a power law with exponent above one: as a power of NN for a power-law tail, logarithmically for an exponential one, as the square root of the log for a Gaussian one. What does not survive is the figure 1.893, which belongs to the Gaussian.

The 2ln(N/K)\sqrt{2\ln(N/K)} form is the leading-order asymptotic and runs high at the tail depths in play. Measured against the exact quantile, it overstates the requirement by 0.573 at N=105N = 10^{5} and by 0.458 at N=109N = 10^{9}. The instrument and every number quoted here use the exact inverse tail; the closed form is in the prose for its shape only.

Holding RR fixed as the archive grows is the strong assumption in the piece, and it is a modelling choice rather than a measurement. It is right for a specific factual question about a specific well or field, which is most of what an asset team asks. It is wrong for a question whose answer set genuinely scales with the corpus, such as a survey of every wellbore that encountered a given formation, and for those the base rate does not fall and this argument does not apply.

Finally, the instrument's fixed value of ten answer-bearing documents is chosen so the base-rate readout is exactly ten over the archive size and can be checked by eye. Neither growth law depends on it while RR stays small against NN, but the precision readout does, in direct proportion.

References

[1] AIQ (10 March 2025). AIQ announces 340 million dollar contract for large-scale deployment of agentic AI across ADNOC operations. aiq.ae

[2] ADNOC (16 January 2025). ADNOC and AIQ successfully complete trial phase of agentic AI solution. adnoc.ae

[3] Offshore Technology (7 March 2024). Saudi Aramco unveils industry-first generative AI model, presented at LEAP in Riyadh on 4 March 2024. offshore-technology.com

[4] Journal of Petroleum Technology (7 January 2026). Equinor says AI saved it 130 million dollars in 2025. jpt.spe.org

[5] ExxonMobil. The future of seismic imaging and technology: Discovery 6 and elastic full wavefield inversion. corporate.exxonmobil.com

[6] EarthScan. Indexing a 136,771-scan raster archive for ML ingestion. earthscan.io

[7] EarthScan. What 136,771 TIFs and 7,781 LAS files teach you about real data. earthscan.io

[8] EarthScan. Sixty-four wells a year: why exploration AI cannot prove itself on outcomes. earthscan.io

Tarry Singh
Tarry Singh

Founder & CEO

More from EarthScan

Related research

All insights →
64 Wells a Year: Why Exploration AI Cannot Prove Itself on Outcomes
Insight

64 Wells a Year: Why Exploration AI Cannot Prove Itself on Outcomes

40 Monitors, One Base: What Sets a 4D Noise Floor
Insight

40 Monitors, One Base: What Sets a 4D Noise Floor

Telemetry, Not Inference: What Actually Bounds an AI Drilling Advisor
Insight

Telemetry, Not Inference: What Actually Bounds an AI Drilling Advisor

Stay ahead

EarthScan insights, in your inbox.

Field-tested research on subsurface and energy-transition AI. About twice a month. No noise.

We use your email only for this newsletter. Unsubscribe anytime Privacy.