@trazum/core 1.50.4 → 1.50.6

package/dist/ladder.js

@@ -0,0 +1,191 @@
+/**
+ * Cheap first, escalate on measured failure — and the number that says whether
+ * that is a saving or a bill.
+ *
+ * "Route it to the cheaper model" has been a recommendation with a quality
+ * question attached since 1.23. Outcomes answered the quality question. This
+ * answers the one nobody asks out loud: **an escalation pays twice**, so a
+ * ladder is only a saving below a specific escalation rate, and above it the
+ * ladder costs more than never having built it.
+ *
+ * ## The arithmetic, stated rather than assumed
+ *
+ * Without a ladder, every call costs `dear`. With one, every call costs
+ * `cheap`, and the escalated share pays `dear` **on top** — the cheap attempt
+ * is not refunded.
+ *
+ *     with a ladder:  cheap + rate x dear
+ *     without one:    dear
+ *
+ * Those are equal at `rate = (dear - cheap) / dear`. Below it the ladder saves;
+ * above it the ladder is a more expensive way to get the same answers. A ladder
+ * sold as a saving without that number is the same head-arithmetic error `plan`
+ * was built to kill — and it is worse here, because the mistake compounds with
+ * traffic and nobody notices until a quarter is over.
+ *
+ * ## The escalation signal is the caller's
+ *
+ * Never inferred from length, latency, refusal text, a stop reason or a retry.
+ * The same refusal `outcome` makes, for a sharper reason: this is a **control
+ * loop**, not a report. A report built on a guess prints a wrong number; a
+ * control loop built on a guess sends real traffic to a more expensive model on
+ * the strength of that guess, forever, and bills for it.
+ *
+ * No signal, no ladder.
+ *
+ * ## What this module does not do
+ *
+ * It does not execute anything. A ladder escalates *after* a failure is known,
+ * which is after the answer came back and usually after something downstream
+ * judged it — so the retry belongs to the caller's own loop, not to a proxy
+ * sitting on one request. What lives here is the policy and the arithmetic that
+ * says whether the policy is worth running, measured against what actually
+ * happened.
+ */
+import { judgeOutcome } from './outcome.js';
+import { effectivePricing } from './pricing.js';
+/**
+ * Calls a workload needs before its escalation rate is treated as a rate.
+ *
+ * The same floor `per-outcome` uses for successes, and for the same reason: a
+ * rate over fewer than ten observations moves more from one more observation
+ * than from anything a team could do about it. A control loop switched on
+ * because of nine calls is a control loop switched on for no reason.
+ */
+export const MIN_CALLS_FOR_LADDER = 10;
+/**
+ * How close to break-even counts as break-even.
+ *
+ * Two percentage points. Inside that band the ladder's sign flips on ordinary
+ * week-to-week variation, and reporting "saving" on Monday and "costing" on
+ * Thursday from the same policy would teach a reader to ignore the figure.
+ */
+export const BREAK_EVEN_BAND = 0.02;
+/**
+ * The cost of one call on a model, for a described shape of work.
+ *
+ * Deliberately takes the token shape rather than reading it from a log: the
+ * break-even rate is a property of the *models and the work*, and somebody
+ * should be able to compute it before running a single call through a ladder.
+ */
+export function ladderArithmetic(policy, shape, catalogue, on = new Date()) {
+    const priceOf = (id) => {
+        if (id === undefined)
+            return null;
+        const model = catalogue.byId.get(id);
+        if (model === undefined)
+            return null;
+        const rates = effectivePricing(model, on);
+        return ((shape.inputTokens / 1_000_000) * rates.inputPerMTok +
+            (shape.outputTokens / 1_000_000) * rates.outputPerMTok);
+    };
+    const cheap = priceOf(policy.tiers[0]);
+    /**
+     * The **last** tier, not the second.
+     *
+     * A three-rung ladder's alternative is the model it would have used without
+     * one, which is the top rung. Comparing against the middle would report a
+     * saving against a model nobody was going to use.
+     */
+    const dear = priceOf(policy.tiers[policy.tiers.length - 1]);
+    return {
+        cheapUsd: cheap ?? 0,
+        dearUsd: dear ?? 0,
+        breakEvenRate: cheap === null || dear === null || dear <= 0 ? null : (dear - cheap) / dear,
+    };
+}
+export function ladderPosition(policy, tally, shape, vocabulary, catalogue, on = new Date()) {
+    const arithmetic = ladderArithmetic(policy, shape, catalogue, on);
+    const bare = (unknown) => ({
+        arithmetic,
+        measuredRate: null,
+        verdict: 'cannot-tell',
+        unknown,
+        calls: 0,
+        escalations: 0,
+        deltaUsdPerCall: null,
+    });
+    if (arithmetic.breakEvenRate === null)
+        return bare('tier-unpriced');
+    if (policy.escalateOn.length === 0)
+        return bare('no-escalation-values-declared');
+    const declared = vocabulary ?? { values: [], success: [] };
+    let calls = 0;
+    let escalations = 0;
+    for (const entry of tally.byValue) {
+        // Undeclared values are out of the denominator as well as the numerator —
+        // a typo in an exporter must not move a control loop's break-even.
+        if (judgeOutcome(entry.value, declared) === 'undeclared')
+            continue;
+        calls += entry.calls;
+        if (policy.escalateOn.includes(entry.value))
+            escalations += entry.calls;
+    }
+    if (calls === 0)
+        return bare('no-outcomes-recorded');
+    if (calls < MIN_CALLS_FOR_LADDER) {
+        return {
+            arithmetic,
+            measuredRate: null,
+            verdict: 'cannot-tell',
+            unknown: 'too-few-calls',
+            calls,
+            escalations,
+            deltaUsdPerCall: null,
+        };
+    }
+    const measuredRate = escalations / calls;
+    const withLadder = arithmetic.cheapUsd + measuredRate * arithmetic.dearUsd;
+    const deltaUsdPerCall = withLadder - arithmetic.dearUsd;
+    const distance = measuredRate - arithmetic.breakEvenRate;
+    const verdict = Math.abs(distance) <= BREAK_EVEN_BAND ? 'at-break-even' : distance < 0 ? 'saving' : 'costing';
+    return { arithmetic, measuredRate, verdict, unknown: null, calls, escalations, deltaUsdPerCall };
+}
+/**
+ * Everything wrong with a ladder before it is ever run.
+ *
+ * Returned rather than thrown, so a caller can report all of it at once — a
+ * config that has to be fixed one error per run is a config people give up on.
+ *
+ * The last two are the interesting ones. Escalating on a value the vocabulary
+ * never declared is a ladder that silently never fires; escalating on a value
+ * declared as a **success** is a ladder that pays twice for work that already
+ * worked, which is the most expensive possible typo in this file.
+ */
+export function validateLadder(policy, vocabulary, catalogue, on = new Date()) {
+    const problems = [];
+    if (policy.tiers.length < 2) {
+        problems.push({ kind: 'too-few-tiers', tiers: policy.tiers.length });
+    }
+    const seen = new Set();
+    let previous = null;
+    for (const id of policy.tiers) {
+        if (seen.has(id))
+            problems.push({ kind: 'duplicate-tier', model: id });
+        seen.add(id);
+        const model = catalogue.byId.get(id);
+        if (model === undefined) {
+            problems.push({ kind: 'unknown-model', model: id });
+            continue;
+        }
+        const price = effectivePricing(model, on).inputPerMTok;
+        if (previous !== null && price < previous.price) {
+            // A ladder whose rungs go down is not a ladder; it is a routing rule
+            // that escalates to something cheaper and then reports a saving for it.
+            problems.push({ kind: 'tiers-not-cheapest-first', model: id, after: previous.id });
+        }
+        previous = { id, price };
+    }
+    if (vocabulary !== null) {
+        for (const value of policy.escalateOn) {
+            if (!vocabulary.values.includes(value)) {
+                problems.push({ kind: 'escalate-on-undeclared', value });
+            }
+            else if (vocabulary.success.includes(value)) {
+                problems.push({ kind: 'escalate-on-a-success', value });
+            }
+        }
+    }
+    return problems;
+}
+//# sourceMappingURL=ladder.js.map

package/dist/ladder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ladder.js","sourceRoot":"","sources":["../src/ladder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAE5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAqChD;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAEvC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,IAAI,CAAC;AAmCpC;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAoB,EACpB,KAAoD,EACpD,SAA2B,EAC3B,EAAE,GAAS,IAAI,IAAI,EAAE;IAErB,MAAM,OAAO,GAAG,CAAC,EAAsB,EAAiB,EAAE;QACxD,IAAI,EAAE,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QAClC,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACrC,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC1C,OAAO,CACL,CAAC,KAAK,CAAC,WAAW,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,YAAY;YACpD,CAAC,KAAK,CAAC,YAAY,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,aAAa,CACvD,CAAC;IACJ,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC;;;;;;OAMG;IACH,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAE5D,OAAO;QACL,QAAQ,EAAE,KAAK,IAAI,CAAC;QACpB,OAAO,EAAE,IAAI,IAAI,CAAC;QAClB,aAAa,EAAE,KAAK,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,IAAI;KAC3F,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,MAAoB,EACpB,KAAmB,EACnB,KAAoD,EACpD,UAAoC,EACpC,SAA2B,EAC3B,EAAE,GAAS,IAAI,IAAI,EAAE;IAErB,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;IAClE,MAAM,IAAI,GAAG,CAAC,OAAsB,EAAkB,EAAE,CAAC,CAAC;QACxD,UAAU;QACV,YAAY,EAAE,IAAI;QAClB,OAAO,EAAE,aAAa;QACtB,OAAO;QACP,KAAK,EAAE,CAAC;QACR,WAAW,EAAE,CAAC;QACd,eAAe,EAAE,IAAI;KACtB,CAAC,CAAC;IAEH,IAAI,UAAU,CAAC,aAAa,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC;IACpE,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,+BAA+B,CAAC,CAAC;IAEjF,MAAM,QAAQ,GAAG,UAAU,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAC3D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAClC,0EAA0E;QAC1E,mEAAmE;QACnE,IAAI,YAAY,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,YAAY;YAAE,SAAS;QACnE,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC;QACrB,IAAI,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC;YAAE,WAAW,IAAI,KAAK,CAAC,KAAK,CAAC;IAC1E,CAAC;IAED,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,sBAAsB,CAAC,CAAC;IACrD,IAAI,KAAK,GAAG,oBAAoB,EAAE,CAAC;QACjC,OAAO;YACL,UAAU;YACV,YAAY,EAAE,IAAI;YAClB,OAAO,EAAE,aAAa;YACtB,OAAO,EAAE,eAAe;YACxB,KAAK;YACL,WAAW;YACX,eAAe,EAAE,IAAI;SACtB,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,WAAW,GAAG,KAAK,CAAC;IACzC,MAAM,UAAU,GAAG,UAAU,CAAC,QAAQ,GAAG,YAAY,GAAG,UAAU,CAAC,OAAO,CAAC;IAC3E,MAAM,eAAe,GAAG,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC;IAExD,MAAM,QAAQ,GAAG,YAAY,GAAG,UAAU,CAAC,aAAa,CAAC;IACzD,MAAM,OAAO,GACX,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;IAEhG,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,EAAE,eAAe,EAAE,CAAC;AACnG,CAAC;AAUD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAoB,EACpB,UAAoC,EACpC,SAA2B,EAC3B,EAAE,GAAS,IAAI,IAAI,EAAE;IAErB,MAAM,QAAQ,GAAoB,EAAE,CAAC;IACrC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACvE,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,IAAI,QAAQ,GAAyC,IAAI,CAAC;IAC1D,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QACvE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;YACpD,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC;QACvD,IAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;YAChD,qEAAqE;YACrE,wEAAwE;YACxE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,0BAA0B,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;QACrF,CAAC;QACD,QAAQ,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QACxB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,wBAAwB,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3D,CAAC;iBAAM,IAAI,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9C,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,uBAAuB,EAAE,KAAK,EAAE,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/per-outcome.d.ts

@@ -0,0 +1,129 @@
+/**
+ * Dollars per outcome — and the three ways this refuses to state one.
+ *
+ * 1.50.4 recorded the numerator. This divides by it, which sounds like
+ * arithmetic and is almost entirely a set of decisions about when *not* to do
+ * the arithmetic. A cost per resolution is the most quotable number this
+ * product will ever print — it ends up in a slide, in a quarterly review, in an
+ * argument about whether to keep a feature — and every way of getting it
+ * slightly wrong is a way of getting somebody's decision badly wrong.
+ *
+ * ## Which bill is the numerator
+ *
+ * The obvious implementation divides the **whole** slice bill by its successes.
+ * It is wrong, and wrong in the direction that makes a product look worse than
+ * it is: any call that carried no outcome is spend with no chance of appearing
+ * in the denominator, so the ratio is inflated by exactly the uninstrumented
+ * share — silently, and by an amount nobody can see from the figure.
+ *
+ * A team that instruments half its traffic would read a cost per resolution
+ * twice the real one, conclude the feature is uneconomic, and kill it.
+ *
+ * So the numerator is **recorded spend only**: the dollars on calls that
+ * carried an outcome. That makes it a ratio over a sample, which is fine and
+ * only fine because the coverage is stated beside it every single time, and
+ * because below a floor it is not stated at all.
+ *
+ * ## Three refusals
+ *
+ * 1. **Too few outcomes is not a rate.** Two resolutions and one figure is
+ *    noise with a dollar sign. The count is shown instead — the same refusal
+ *    `route` makes about small case sets and `history` makes about short runs.
+ * 2. **Too little coverage is not a rate.** A slice where an eighth of the
+ *    spend carried an outcome yields a ratio over an unknown denominator. The
+ *    coverage is shown instead.
+ * 3. **No successes recorded is not a rate of infinity.** A slice that spent
+ *    money and resolved nothing is a real and alarming measurement, and it is
+ *    reported as what it is rather than as a division by zero dressed up.
+ *
+ * ## Two rankings, and the product prints both
+ *
+ * Cheapest per call and cheapest per outcome are **different orders**, and the
+ * whole reason this chapter exists is that a workload can move up one while
+ * moving down the other. Picking one would be this tool making the choice it
+ * spent the last release refusing to make. Both are returned; the disagreement
+ * between them is itself a finding, and it is named.
+ */
+import type { OutcomeTally, OutcomeVocabulary } from './outcome.js';
+/**
+ * Recorded successes a slice needs before a per-outcome figure is stated.
+ *
+ * Ten, matching `history`'s `MIN_RUN` reasoning rather than a fresh number: a
+ * figure over fewer than ten observations moves more from one more observation
+ * than from anything a team could do about it.
+ */
+export declare const MIN_OUTCOMES_FOR_RATE = 10;
+/**
+ * Share of a slice's spend that must carry an outcome before a rate is stated.
+ *
+ * 0.8, the same floor `watch` uses for a measured day. Below it the figure is a
+ * ratio over an unknown denominator, and the gap between what it says and what
+ * is true is not bounded by anything the reader can see.
+ */
+export declare const MIN_COVERAGE_FOR_RATE = 0.8;
+export type WithheldReason = 'too-few-outcomes' | 'too-little-coverage' | 'no-successes-recorded' | 'no-vocabulary' | 'nothing-recorded';
+export interface PerOutcome {
+    /**
+     * Dollars per recorded success, over **recorded spend only**, or null.
+     *
+     * Null is never a zero and never an infinity: `withheld` says which of the
+     * five reasons applies, and a caller that prints the figure without reading
+     * that field will print nothing rather than something wrong.
+     */
+    usdPerSuccess: number | null;
+    withheld: WithheldReason | null;
+    /** Successes counted. Shown in place of the rate when it is withheld. */
+    successes: number;
+    /** Spend on calls that carried a declared outcome — the numerator. */
+    recordedUsd: number;
+    /** Everything the slice spent, recorded or not — for the coverage share. */
+    totalUsd: number;
+    /**
+     * Recorded share of the slice's spend, 0-1. Printed beside the rate every
+     * time it is printed, because a ratio over a sample presented without its
+     * sample size is a claim about the whole.
+     */
+    coverage: number;
+}
+export declare function perOutcome(tally: OutcomeTally, totalUsd: number, vocabulary: OutcomeVocabulary | null): PerOutcome;
+export interface RankedSlice {
+    key: string;
+    calls: number;
+    totalUsd: number;
+    per: PerOutcome;
+    /** Dollars per call — the ranking this product has always been able to make. */
+    usdPerCall: number;
+}
+export interface PerOutcomeRanking {
+    /** Dearest per call first. Every slice appears. */
+    byCall: RankedSlice[];
+    /**
+     * Dearest per **outcome** first. Only slices with a stated rate appear —
+     * a withheld figure has no position in an order, and giving it one would put
+     * a slice somewhere on the strength of a number this module declined to
+     * state.
+     */
+    byOutcome: RankedSlice[];
+    /**
+     * Slices whose two ranks disagree by more than a place, dearest-per-outcome
+     * first.
+     *
+     * **The finding a total cannot make**: the workload that looks cheap per
+     * call and is expensive per resolution, or the reverse. Somebody optimising
+     * on the first number has been moving the wrong one, and nothing in this
+     * product could tell them until now.
+     */
+    disagreements: Array<{
+        slice: RankedSlice;
+        callRank: number;
+        outcomeRank: number;
+    }>;
+}
+export interface SliceInput {
+    key: string;
+    calls: number;
+    totalUsd: number;
+    tally: OutcomeTally;
+}
+export declare function rankPerOutcome(slices: readonly SliceInput[], vocabulary: OutcomeVocabulary | null): PerOutcomeRanking;
+//# sourceMappingURL=per-outcome.d.ts.map

package/dist/per-outcome.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"per-outcome.d.ts","sourceRoot":"","sources":["../src/per-outcome.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAEpE;;;;;;GAMG;AACH,eAAO,MAAM,qBAAqB,KAAK,CAAC;AAExC;;;;;;GAMG;AACH,eAAO,MAAM,qBAAqB,MAAM,CAAC;AAEzC,MAAM,MAAM,cAAc,GACtB,kBAAkB,GAClB,qBAAqB,GACrB,uBAAuB,GACvB,eAAe,GACf,kBAAkB,CAAC;AAEvB,MAAM,WAAW,UAAU;IACzB;;;;;;OAMG;IACH,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,QAAQ,EAAE,cAAc,GAAG,IAAI,CAAC;IAChC,yEAAyE;IACzE,SAAS,EAAE,MAAM,CAAC;IAClB,sEAAsE;IACtE,WAAW,EAAE,MAAM,CAAC;IACpB,4EAA4E;IAC5E,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,wBAAgB,UAAU,CACxB,KAAK,EAAE,YAAY,EACnB,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,iBAAiB,GAAG,IAAI,GACnC,UAAU,CAyCZ;AAED,MAAM,WAAW,WAAW;IAC1B,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,GAAG,EAAE,UAAU,CAAC;IAChB,gFAAgF;IAChF,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,iBAAiB;IAChC,mDAAmD;IACnD,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB;;;;;OAKG;IACH,SAAS,EAAE,WAAW,EAAE,CAAC;IACzB;;;;;;;;OAQG;IACH,aAAa,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,WAAW,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACrF;AAED,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,YAAY,CAAC;CACrB;AAED,wBAAgB,cAAc,CAC5B,MAAM,EAAE,SAAS,UAAU,EAAE,EAC7B,UAAU,EAAE,iBAAiB,GAAG,IAAI,GACnC,iBAAiB,CA+CnB"}

package/dist/per-outcome.js

@@ -0,0 +1,150 @@
+/**
+ * Dollars per outcome — and the three ways this refuses to state one.
+ *
+ * 1.50.4 recorded the numerator. This divides by it, which sounds like
+ * arithmetic and is almost entirely a set of decisions about when *not* to do
+ * the arithmetic. A cost per resolution is the most quotable number this
+ * product will ever print — it ends up in a slide, in a quarterly review, in an
+ * argument about whether to keep a feature — and every way of getting it
+ * slightly wrong is a way of getting somebody's decision badly wrong.
+ *
+ * ## Which bill is the numerator
+ *
+ * The obvious implementation divides the **whole** slice bill by its successes.
+ * It is wrong, and wrong in the direction that makes a product look worse than
+ * it is: any call that carried no outcome is spend with no chance of appearing
+ * in the denominator, so the ratio is inflated by exactly the uninstrumented
+ * share — silently, and by an amount nobody can see from the figure.
+ *
+ * A team that instruments half its traffic would read a cost per resolution
+ * twice the real one, conclude the feature is uneconomic, and kill it.
+ *
+ * So the numerator is **recorded spend only**: the dollars on calls that
+ * carried an outcome. That makes it a ratio over a sample, which is fine and
+ * only fine because the coverage is stated beside it every single time, and
+ * because below a floor it is not stated at all.
+ *
+ * ## Three refusals
+ *
+ * 1. **Too few outcomes is not a rate.** Two resolutions and one figure is
+ *    noise with a dollar sign. The count is shown instead — the same refusal
+ *    `route` makes about small case sets and `history` makes about short runs.
+ * 2. **Too little coverage is not a rate.** A slice where an eighth of the
+ *    spend carried an outcome yields a ratio over an unknown denominator. The
+ *    coverage is shown instead.
+ * 3. **No successes recorded is not a rate of infinity.** A slice that spent
+ *    money and resolved nothing is a real and alarming measurement, and it is
+ *    reported as what it is rather than as a division by zero dressed up.
+ *
+ * ## Two rankings, and the product prints both
+ *
+ * Cheapest per call and cheapest per outcome are **different orders**, and the
+ * whole reason this chapter exists is that a workload can move up one while
+ * moving down the other. Picking one would be this tool making the choice it
+ * spent the last release refusing to make. Both are returned; the disagreement
+ * between them is itself a finding, and it is named.
+ */
+import { judgeOutcome } from './outcome.js';
+/**
+ * Recorded successes a slice needs before a per-outcome figure is stated.
+ *
+ * Ten, matching `history`'s `MIN_RUN` reasoning rather than a fresh number: a
+ * figure over fewer than ten observations moves more from one more observation
+ * than from anything a team could do about it.
+ */
+export const MIN_OUTCOMES_FOR_RATE = 10;
+/**
+ * Share of a slice's spend that must carry an outcome before a rate is stated.
+ *
+ * 0.8, the same floor `watch` uses for a measured day. Below it the figure is a
+ * ratio over an unknown denominator, and the gap between what it says and what
+ * is true is not bounded by anything the reader can see.
+ */
+export const MIN_COVERAGE_FOR_RATE = 0.8;
+export function perOutcome(tally, totalUsd, vocabulary) {
+    const declared = vocabulary ?? { values: [], success: [] };
+    let successes = 0;
+    let recordedUsd = 0;
+    for (const entry of tally.byValue) {
+        const verdict = judgeOutcome(entry.value, declared);
+        // Undeclared values are in neither the numerator nor the denominator, the
+        // same rule the success rate has: a typo in an exporter is a broken
+        // exporter, not a result.
+        if (verdict === 'undeclared')
+            continue;
+        recordedUsd += entry.usd;
+        if (verdict === 'success')
+            successes += entry.calls;
+    }
+    const coverage = totalUsd > 0 ? recordedUsd / totalUsd : 0;
+    const base = {
+        successes,
+        recordedUsd,
+        totalUsd,
+        coverage,
+    };
+    if (vocabulary === null || declared.success.length === 0) {
+        return { ...base, usdPerSuccess: null, withheld: 'no-vocabulary' };
+    }
+    if (tally.recorded === 0) {
+        return { ...base, usdPerSuccess: null, withheld: 'nothing-recorded' };
+    }
+    if (successes === 0) {
+        // Money spent and nothing resolved. A real and alarming measurement, and
+        // reported as one rather than as a division by zero dressed up as a figure.
+        return { ...base, usdPerSuccess: null, withheld: 'no-successes-recorded' };
+    }
+    if (successes < MIN_OUTCOMES_FOR_RATE) {
+        return { ...base, usdPerSuccess: null, withheld: 'too-few-outcomes' };
+    }
+    if (coverage < MIN_COVERAGE_FOR_RATE) {
+        return { ...base, usdPerSuccess: null, withheld: 'too-little-coverage' };
+    }
+    return { ...base, usdPerSuccess: recordedUsd / successes, withheld: null };
+}
+export function rankPerOutcome(slices, vocabulary) {
+    const ranked = slices.map((slice) => ({
+        key: slice.key,
+        calls: slice.calls,
+        totalUsd: slice.totalUsd,
+        per: perOutcome(slice.tally, slice.totalUsd, vocabulary),
+        usdPerCall: slice.calls > 0 ? slice.totalUsd / slice.calls : 0,
+    }));
+    const byCall = [...ranked].sort((a, b) => b.usdPerCall - a.usdPerCall);
+    const byOutcome = ranked
+        .filter((slice) => slice.per.usdPerSuccess !== null)
+        .sort((a, b) => b.per.usdPerSuccess - a.per.usdPerSuccess);
+    const callRankOf = new Map(byCall.map((slice, index) => [slice.key, index]));
+    const disagreements = [];
+    byOutcome.forEach((slice, outcomeRank) => {
+        /**
+         * Compared against this slice's position among **the rankable slices
+         * only**, not among all of them.
+         *
+         * Ranking it at position 4 of ten by call and 1 of three by outcome would
+         * report a disagreement produced entirely by the two lists having different
+         * lengths — an artefact, printed as a finding.
+         */
+        const callRank = byCall
+            .filter((other) => other.per.usdPerSuccess !== null)
+            .findIndex((other) => other.key === slice.key);
+        /**
+         * More than one place — **or** a change at the top.
+         *
+         * The distance threshold alone misses the sharpest case there is: with two
+         * rankable slices a complete reversal is a distance of exactly one, and
+         * that is not noise, it is the finding. Whoever is dearest per call and
+         * whoever is dearest per resolution are the two names in the conversation,
+         * and them being different names is the whole point of computing both.
+         */
+        const changedAtTheTop = (callRank === 0) !== (outcomeRank === 0);
+        if (Math.abs(callRank - outcomeRank) > 1 || changedAtTheTop) {
+            disagreements.push({ slice, callRank, outcomeRank });
+        }
+    });
+    // `callRankOf` is kept for callers that want the position among everything;
+    // the disagreement test deliberately does not use it, for the reason above.
+    void callRankOf;
+    return { byCall, byOutcome, disagreements };
+}
+//# sourceMappingURL=per-outcome.js.map

package/dist/per-outcome.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"per-outcome.js","sourceRoot":"","sources":["../src/per-outcome.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAG5C;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAExC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAiCzC,MAAM,UAAU,UAAU,CACxB,KAAmB,EACnB,QAAgB,EAChB,UAAoC;IAEpC,MAAM,QAAQ,GAAG,UAAU,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAE3D,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACpD,0EAA0E;QAC1E,oEAAoE;QACpE,0BAA0B;QAC1B,IAAI,OAAO,KAAK,YAAY;YAAE,SAAS;QACvC,WAAW,IAAI,KAAK,CAAC,GAAG,CAAC;QACzB,IAAI,OAAO,KAAK,SAAS;YAAE,SAAS,IAAI,KAAK,CAAC,KAAK,CAAC;IACtD,CAAC;IAED,MAAM,QAAQ,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,IAAI,GAAmD;QAC3D,SAAS;QACT,WAAW;QACX,QAAQ;QACR,QAAQ;KACT,CAAC;IAEF,IAAI,UAAU,KAAK,IAAI,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzD,OAAO,EAAE,GAAG,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAE,eAAe,EAAE,CAAC;IACrE,CAAC;IACD,IAAI,KAAK,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,GAAG,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAE,kBAAkB,EAAE,CAAC;IACxE,CAAC;IACD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QACpB,yEAAyE;QACzE,4EAA4E;QAC5E,OAAO,EAAE,GAAG,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAE,uBAAuB,EAAE,CAAC;IAC7E,CAAC;IACD,IAAI,SAAS,GAAG,qBAAqB,EAAE,CAAC;QACtC,OAAO,EAAE,GAAG,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAE,kBAAkB,EAAE,CAAC;IACxE,CAAC;IACD,IAAI,QAAQ,GAAG,qBAAqB,EAAE,CAAC;QACrC,OAAO,EAAE,GAAG,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAE,qBAAqB,EAAE,CAAC;IAC3E,CAAC;IACD,OAAO,EAAE,GAAG,IAAI,EAAE,aAAa,EAAE,WAAW,GAAG,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAC7E,CAAC;AAwCD,MAAM,UAAU,cAAc,CAC5B,MAA6B,EAC7B,UAAoC;IAEpC,MAAM,MAAM,GAAkB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACnD,GAAG,EAAE,KAAK,CAAC,GAAG;QACd,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,UAAU,CAAC;QACxD,UAAU,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;KAC/D,CAAC,CAAC,CAAC;IAEJ,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IACvE,MAAM,SAAS,GAAG,MAAM;SACrB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,KAAK,IAAI,CAAC;SACnD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,CAAC,CAAC,GAAG,CAAC,aAAwB,GAAI,CAAC,CAAC,GAAG,CAAC,aAAwB,CAAC,CAAC;IAErF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,aAAa,GAAuC,EAAE,CAAC;IAC7D,SAAS,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE;QACvC;;;;;;;WAOG;QACH,MAAM,QAAQ,GAAG,MAAM;aACpB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,KAAK,IAAI,CAAC;aACnD,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC;QACjD;;;;;;;;WAQG;QACH,MAAM,eAAe,GAAG,CAAC,QAAQ,KAAK,CAAC,CAAC,KAAK,CAAC,WAAW,KAAK,CAAC,CAAC,CAAC;QACjE,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,eAAe,EAAE,CAAC;YAC5D,aAAa,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC;QACvD,CAAC;IACH,CAAC,CAAC,CAAC;IACH,4EAA4E;IAC5E,4EAA4E;IAC5E,KAAK,UAAU,CAAC;IAEhB,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC;AAC9C,CAAC"}

package/dist/usage.d.ts

@@ -447,6 +447,25 @@ export interface UsageProfileReport {
      * and a boolean would call it that.
      */
     fieldCoverage: FieldCoverage;
+    /**
+     * The same tally per label, and per model.
+     *
+     * The groupings a decision is made at. "This workload costs more per
+     * resolution than that one" is the finding a total cannot make, and it needs
+     * the numerator sliced the same way the bill already is.
+     */
+    outcomeTallyByLabel: Array<{
+        label: string;
+        calls: number;
+        totalUsd: number;
+        tally: OutcomeTally;
+    }>;
+    outcomeTallyByModel: Array<{
+        model: string;
+        calls: number;
+        totalUsd: number;
+        tally: OutcomeTally;
+    }>;
     /**
      * What each recorded outcome cost — measurement only, no judgement.
      *

package/dist/usage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"usage.d.ts","sourceRoot":"","sources":["../src/usage.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAGjD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AACjE,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6DG;AAEH,gEAAgE;AAChE,MAAM,WAAW,WAAW;IAC1B,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd,qDAAqD;IACrD,WAAW,EAAE,MAAM,CAAC;IACpB,0EAA0E;IAC1E,eAAe,EAAE,MAAM,CAAC;IACxB,oEAAoE;IACpE,kBAAkB,EAAE,MAAM,CAAC;IAC3B,yEAAyE;IACzE,kBAAkB,EAAE,MAAM,CAAC;IAC3B;;;;;;;OAOG;IACH,aAAa,EAAE,OAAO,CAAC;IACvB,YAAY,EAAE,MAAM,CAAC;IACrB;;;;;;;OAOG;IACH,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB;;;;;;;;;OASG;IACH,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB;;;;;;;;;;;;;OAaG;IACH,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB;;;;;;;;;OASG;IACH,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;IAClB;;;;;;;;OAQG;IACH,SAAS,EAAE,OAAO,GAAG,IAAI,CAAC;CAC3B;AAED,+DAA+D;AAC/D,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,gBAAgB,EAAE,MAAM,CAAC;IACzB;;;;;;;;;;;;OAYG;IACH,kBAAkB,EAAE,MAAM,CAAC;IAC3B,kBAAkB,EAAE,MAAM,CAAC;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,oBAAoB,EAAE,MAAM,CAAC;IAC7B;;;;;;;;;OASG;IACH,kBAAkB,EAAE,MAAM,CAAC;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;;;;OAOG;IACH,0BAA0B,EAAE,MAAM,CAAC;IACnC;;;;;;;;;;;;OAYG;IACH,wBAAwB,EAAE,MAAM,CAAC;IACjC;;;;;;;OAOG;IACH,cAAc,EAAE,MAAM,CAAC;IACvB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,kEAAkE;IAClE,eAAe,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa;IAC5B,qCAAqC;IACrC,KAAK,EAAE,MAAM,CAAC;IACd,4DAA4D;IAC5D,OAAO,EAAE,MAAM,CAAC;IAChB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,CAAC;IAChB,yCAAyC;IACzC,EAAE,EAAE,MAAM,CAAC;IACX,uDAAuD;IACvD,UAAU,EAAE,MAAM,CAAC;IACnB,6DAA6D;IAC7D,QAAQ,EAAE,MAAM,CAAC;IACjB,+EAA+E;IAC/E,WAAW,EAAE,MAAM,CAAC;IACpB,8EAA8E;IAC9E,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,kBAAkB;IACjC,4BAA4B;IAC5B,KAAK,EAAE,cAAc,CAAC;IACtB,yEAAyE;IACzE,OAAO,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,cAAc,CAAA;KAAE,CAAC,CAAC;IAC7D,qCAAqC;IACrC,OAAO,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,cAAc,CAAA;KAAE,CAAC,CAAC;IAC7D;;;;;;;;OAQG;IACH,eAAe,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,cAAc,CAAA;KAAE,CAAC,CAAC;IACpF;;;;;;OAMG;IACH,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB;;;;;;;;;;;;OAYG;IACH,QAAQ,EAAE,cAAc,CAAC;IACzB;;;;;;;OAOG;IACH,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB;;;;;;OAMG;IACH,aAAa,EAAE,kBAAkB,EAAE,CAAC;IACpC,mDAAmD;IACnD,WAAW,EAAE,OAAO,CAAC;IACrB;;;;;OAKG;IACH,YAAY,EAAE,WAAW,EAAE,CAAC;IAC5B;;;;;;;;;OASG;IACH,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B;;;;;;;;OAQG;IACH,aAAa,EAAE,aAAa,EAAE,CAAC;IAC/B;;;;;;;OAOG;IACH,iBAAiB,EAAE,eAAe,EAAE,CAAC;IACrC;;;;;;;;;;;OAWG;IACH,IAAI,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAC7D;;;;;;;;;;;OAWG;IACH,UAAU,EAAE,KAAK,CAAC;QAChB,yBAAyB;QACzB,GAAG,EAAE,MAAM,CAAC;QACZ,GAAG,EAAE,MAAM,CAAC;QACZ,KAAK,EAAE,MAAM,CAAC;QACd,4EAA4E;QAC5E,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;QACxB,WAAW,EAAE,MAAM,CAAC;QACpB;;;;WAIG;QACH,OAAO,EAAE,KAAK,CAAC;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;KAC/D,CAAC,CAAC;IACH;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,cAAc,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IAC/C;;;;;;;;;;;;;;OAcG;IACH,aAAa,EAAE,aAAa,CAAC;IAC7B;;;;;;OAMG;IACH,YAAY,EAAE,YAAY,CAAC;IAC3B;;;;;;;;;;;;;;;OAeG;IACH,WAAW,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACjE;;;;;;;;;;;;;;;;;;OAkBG;IACH,aAAa,EAAE;QACb,+EAA+E;QAC/E,SAAS,EAAE,MAAM,CAAC;QAClB,QAAQ,EAAE,MAAM,CAAC;QACjB,2EAA2E;QAC3E,QAAQ,EAAE,MAAM,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,+EAA+E;QAC/E,MAAM,EAAE,KAAK,CAAC;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,UAAU,EAAE,MAAM,CAAC;YAAC,SAAS,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;KAC5G,GAAG,IAAI,CAAC;IACT;;;;;;OAMG;IACH,WAAW,EAAE,WAAW,EAAE,CAAC;IAC3B;;;;;;;;;OASG;IACH,UAAU,EAAE;QAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,eAAe,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAC/F;;;;;;;;OAQG;IACH,qBAAqB,EAAE,qBAAqB,EAAE,CAAC;IAC/C;;;;;;;OAOG;IACH,YAAY,EAAE,gBAAgB,EAAE,CAAC;IACjC;;;;;;;;OAQG;IACH,YAAY,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;CAC3D;AAED,uEAAuE;AACvE,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB;AAkHD,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI,CA8J/D;AAuBD;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,UAAU,KAAK,CAAC;AAoF7B,MAAM,WAAW,mBAAmB;IAClC,SAAS,EAAE,gBAAgB,CAAC;IAC5B,gFAAgF;IAChF,EAAE,CAAC,EAAE,IAAI,CAAC;IACV;;;;;;OAMG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,mBAAmB,GAAG,kBAAkB,CA8T3F;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,SAAS,EAAE,cAAc,GAAG,WAAW,CAS/D;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,cAAc,GAAG,MAAM,GAAG,IAAI,CAKrE;AAED,gFAAgF;AAChF,MAAM,WAAW,cAAc;IAC7B,sEAAsE;IACtE,QAAQ,EAAE,MAAM,CAAC;IACjB,uEAAuE;IACvE,iBAAiB,EAAE,MAAM,CAAC;IAC1B;;;;;;OAMG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;;;;OAOG;IACH,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,OAAO,EAAE,YAAY,CAAC;IACtB;;;;;;;;OAQG;IACH,iBAAiB,EAAE,MAAM,CAAC;IAC1B;;;;;;;;;;;OAWG;IACH,gBAAgB,EAAE,YAAY,CAAC;CAChC;AAED;;;;;;;;;;GAUG;AACH,MAAM,MAAM,YAAY,GACpB,UAAU,GACV,YAAY,GACZ,eAAe,GACf,eAAe,GACf,UAAU,CAAC;AAcf;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,cAAc,CAAC,SAAS,EAAE,cAAc,GAAG,cAAc,CA6CxE"}
+{"version":3,"file":"usage.d.ts","sourceRoot":"","sources":["../src/usage.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAGjD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AACjE,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6DG;AAEH,gEAAgE;AAChE,MAAM,WAAW,WAAW;IAC1B,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd,qDAAqD;IACrD,WAAW,EAAE,MAAM,CAAC;IACpB,0EAA0E;IAC1E,eAAe,EAAE,MAAM,CAAC;IACxB,oEAAoE;IACpE,kBAAkB,EAAE,MAAM,CAAC;IAC3B,yEAAyE;IACzE,kBAAkB,EAAE,MAAM,CAAC;IAC3B;;;;;;;OAOG;IACH,aAAa,EAAE,OAAO,CAAC;IACvB,YAAY,EAAE,MAAM,CAAC;IACrB;;;;;;;OAOG;IACH,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB;;;;;;;;;OASG;IACH,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB;;;;;;;;;;;;;OAaG;IACH,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB;;;;;;;;;OASG;IACH,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;IAClB;;;;;;;;OAQG;IACH,SAAS,EAAE,OAAO,GAAG,IAAI,CAAC;CAC3B;AAED,+DAA+D;AAC/D,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,gBAAgB,EAAE,MAAM,CAAC;IACzB;;;;;;;;;;;;OAYG;IACH,kBAAkB,EAAE,MAAM,CAAC;IAC3B,kBAAkB,EAAE,MAAM,CAAC;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,oBAAoB,EAAE,MAAM,CAAC;IAC7B;;;;;;;;;OASG;IACH,kBAAkB,EAAE,MAAM,CAAC;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;;;;OAOG;IACH,0BAA0B,EAAE,MAAM,CAAC;IACnC;;;;;;;;;;;;OAYG;IACH,wBAAwB,EAAE,MAAM,CAAC;IACjC;;;;;;;OAOG;IACH,cAAc,EAAE,MAAM,CAAC;IACvB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,kEAAkE;IAClE,eAAe,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa;IAC5B,qCAAqC;IACrC,KAAK,EAAE,MAAM,CAAC;IACd,4DAA4D;IAC5D,OAAO,EAAE,MAAM,CAAC;IAChB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,CAAC;IAChB,yCAAyC;IACzC,EAAE,EAAE,MAAM,CAAC;IACX,uDAAuD;IACvD,UAAU,EAAE,MAAM,CAAC;IACnB,6DAA6D;IAC7D,QAAQ,EAAE,MAAM,CAAC;IACjB,+EAA+E;IAC/E,WAAW,EAAE,MAAM,CAAC;IACpB,8EAA8E;IAC9E,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,kBAAkB;IACjC,4BAA4B;IAC5B,KAAK,EAAE,cAAc,CAAC;IACtB,yEAAyE;IACzE,OAAO,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,cAAc,CAAA;KAAE,CAAC,CAAC;IAC7D,qCAAqC;IACrC,OAAO,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,cAAc,CAAA;KAAE,CAAC,CAAC;IAC7D;;;;;;;;OAQG;IACH,eAAe,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,cAAc,CAAA;KAAE,CAAC,CAAC;IACpF;;;;;;OAMG;IACH,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB;;;;;;;;;;;;OAYG;IACH,QAAQ,EAAE,cAAc,CAAC;IACzB;;;;;;;OAOG;IACH,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB;;;;;;OAMG;IACH,aAAa,EAAE,kBAAkB,EAAE,CAAC;IACpC,mDAAmD;IACnD,WAAW,EAAE,OAAO,CAAC;IACrB;;;;;OAKG;IACH,YAAY,EAAE,WAAW,EAAE,CAAC;IAC5B;;;;;;;;;OASG;IACH,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B;;;;;;;;OAQG;IACH,aAAa,EAAE,aAAa,EAAE,CAAC;IAC/B;;;;;;;OAOG;IACH,iBAAiB,EAAE,eAAe,EAAE,CAAC;IACrC;;;;;;;;;;;OAWG;IACH,IAAI,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAC7D;;;;;;;;;;;OAWG;IACH,UAAU,EAAE,KAAK,CAAC;QAChB,yBAAyB;QACzB,GAAG,EAAE,MAAM,CAAC;QACZ,GAAG,EAAE,MAAM,CAAC;QACZ,KAAK,EAAE,MAAM,CAAC;QACd,4EAA4E;QAC5E,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;QACxB,WAAW,EAAE,MAAM,CAAC;QACpB;;;;WAIG;QACH,OAAO,EAAE,KAAK,CAAC;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;KAC/D,CAAC,CAAC;IACH;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,cAAc,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IAC/C;;;;;;;;;;;;;;OAcG;IACH,aAAa,EAAE,aAAa,CAAC;IAC7B;;;;;;OAMG;IACH,mBAAmB,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,YAAY,CAAA;KAAE,CAAC,CAAC;IACpG,mBAAmB,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,YAAY,CAAA;KAAE,CAAC,CAAC;IACpG;;;;;;OAMG;IACH,YAAY,EAAE,YAAY,CAAC;IAC3B;;;;;;;;;;;;;;;OAeG;IACH,WAAW,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACjE;;;;;;;;;;;;;;;;;;OAkBG;IACH,aAAa,EAAE;QACb,+EAA+E;QAC/E,SAAS,EAAE,MAAM,CAAC;QAClB,QAAQ,EAAE,MAAM,CAAC;QACjB,2EAA2E;QAC3E,QAAQ,EAAE,MAAM,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,+EAA+E;QAC/E,MAAM,EAAE,KAAK,CAAC;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,UAAU,EAAE,MAAM,CAAC;YAAC,SAAS,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;KAC5G,GAAG,IAAI,CAAC;IACT;;;;;;OAMG;IACH,WAAW,EAAE,WAAW,EAAE,CAAC;IAC3B;;;;;;;;;OASG;IACH,UAAU,EAAE;QAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,eAAe,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAC/F;;;;;;;;OAQG;IACH,qBAAqB,EAAE,qBAAqB,EAAE,CAAC;IAC/C;;;;;;;OAOG;IACH,YAAY,EAAE,gBAAgB,EAAE,CAAC;IACjC;;;;;;;;OAQG;IACH,YAAY,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;CAC3D;AAED,uEAAuE;AACvE,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB;AAkHD,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI,CA8J/D;AA6CD;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,UAAU,KAAK,CAAC;AAoF7B,MAAM,WAAW,mBAAmB;IAClC,SAAS,EAAE,gBAAgB,CAAC;IAC5B,gFAAgF;IAChF,EAAE,CAAC,EAAE,IAAI,CAAC;IACV;;;;;;OAMG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,mBAAmB,GAAG,kBAAkB,CA0W3F;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,SAAS,EAAE,cAAc,GAAG,WAAW,CAS/D;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,cAAc,GAAG,MAAM,GAAG,IAAI,CAKrE;AAED,gFAAgF;AAChF,MAAM,WAAW,cAAc;IAC7B,sEAAsE;IACtE,QAAQ,EAAE,MAAM,CAAC;IACjB,uEAAuE;IACvE,iBAAiB,EAAE,MAAM,CAAC;IAC1B;;;;;;OAMG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;;;;OAOG;IACH,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,OAAO,EAAE,YAAY,CAAC;IACtB;;;;;;;;OAQG;IACH,iBAAiB,EAAE,MAAM,CAAC;IAC1B;;;;;;;;;;;OAWG;IACH,gBAAgB,EAAE,YAAY,CAAC;CAChC;AAED;;;;;;;;;;GAUG;AACH,MAAM,MAAM,YAAY,GACpB,UAAU,GACV,YAAY,GACZ,eAAe,GACf,eAAe,GACf,UAAU,CAAC;AAcf;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,cAAc,CAAC,SAAS,EAAE,cAAc,GAAG,cAAc,CA6CxE"}

package/dist/usage.js

@@ -207,6 +207,23 @@ export function parseUsageLine(line) {
         })(),
     };
 }
+/**
+ * One slice's outcome tally, in the same shape as the whole log's.
+ *
+ * `parsed` is the slice's own call count rather than the log's, so a coverage
+ * share computed from it describes this slice and not the file it came from.
+ */
+function tallyOf(buckets, unrecordedUsd, parsed) {
+    const byValue = [...(buckets ?? new Map()).entries()]
+        .map(([value, bucket]) => ({ value, calls: bucket.calls, usd: bucket.usd }))
+        .sort((a, b) => b.usd - a.usd);
+    return {
+        byValue,
+        recorded: byValue.reduce((sum, entry) => sum + entry.calls, 0),
+        parsed,
+        unrecordedUsd,
+    };
+}
 /**
  * A label or session identifier, from whatever a real log holds.
  *
@@ -355,6 +372,11 @@ export function profileUsage(text, options) {
     let hasSessions = false;
     const outcomes = new Map();
     let unrecordedOutcomeUsd = 0;
+    /** Per-slice outcome tallies, keyed by label and by model. */
+    const outcomesByLabel = new Map();
+    const outcomesByModel = new Map();
+    const unrecordedByLabel = new Map();
+    const unrecordedByModel = new Map();
     const coverage = { label: 0, session: 0, outcome: 0, ts: 0, stopReason: 0, cacheTtl: 0, cacheWrites: 0, parsed: 0 };
     /**
      * Raw lines already seen, for the duplicate check. Bounded by the number of
@@ -494,6 +516,20 @@ export function profileUsage(text, options) {
                 bucket.usd += usd;
                 outcomes.set(record.outcome, bucket);
             }
+            const into = (map, unrecorded, key) => {
+                if (record.outcome === null) {
+                    unrecorded.set(key, (unrecorded.get(key) ?? 0) + usd);
+                    return;
+                }
+                const slice = map.get(key) ?? new Map();
+                const bucket = slice.get(record.outcome) ?? { calls: 0, usd: 0 };
+                bucket.calls += 1;
+                bucket.usd += usd;
+                slice.set(record.outcome, bucket);
+                map.set(key, slice);
+            };
+            into(outcomesByLabel, unrecordedByLabel, record.label ?? UNLABELLED);
+            into(outcomesByModel, unrecordedByModel, record.model);
         }
         if (record.ts !== null) {
             const day = new Date(record.ts).toISOString().slice(0, 10);
@@ -589,6 +625,18 @@ export function profileUsage(text, options) {
             parsed: coverage.parsed,
             unrecordedUsd: unrecordedOutcomeUsd,
         },
+        outcomeTallyByLabel: sorted(byLabel, 'label').map((entry) => ({
+            label: entry.label,
+            calls: entry.breakdown.calls,
+            totalUsd: entry.breakdown.totalUsd,
+            tally: tallyOf(outcomesByLabel.get(entry.label), unrecordedByLabel.get(entry.label) ?? 0, entry.breakdown.calls),
+        })),
+        outcomeTallyByModel: sorted(byModel, 'model').map((entry) => ({
+            model: entry.model,
+            calls: entry.breakdown.calls,
+            totalUsd: entry.breakdown.totalUsd,
+            tally: tallyOf(outcomesByModel.get(entry.model), unrecordedByModel.get(entry.model) ?? 0, entry.breakdown.calls),
+        })),
         modelMixDrift: (() => {
             const ordered = [...days.entries()].sort((a, b) => a[0].localeCompare(b[0]));
             if (ordered.length < 4)