pub struct FinalOutcome {
pub served_rung: Option<u32>,
pub served_from: ServedFrom,
pub total_cost_usd: f64,
pub gate_cost_usd: f64,
pub total_latency_ms: u64,
pub escalations: u32,
pub counterfactual_baseline_usd: f64,
pub cache_source: Option<Uuid>,
pub savings_usd: f64,
}Expand description
The final outcome and economics of a decision.
Fields§
§served_rung: Option<u32>Rung whose output was served (None if served_from = error).
served_from: ServedFromProvenance of the served response.
total_cost_usd: f64Total USD spent (all model calls + all gates).
gate_cost_usd: f64USD portion spent on gates alone.
total_latency_ms: u64Total wall-clock latency the caller experienced.
escalations: u32Number of rung escalations taken.
counterfactual_baseline_usd: f64What always calling the top rung would have cost (§9.1 counterfactual).
cache_source: Option<Uuid>The decision this answer was replayed from, when served_from = cache.
The whole point of a verified cache: the receipt does not merely say “cached”, it names the earlier decision whose gate passed, so an auditor can follow the link and check that the thing being replayed was actually proven. Absent otherwise, so pre-cache receipts serialize byte-identically and re-derive the same hash.
savings_usd: f64counterfactual_baseline_usd - total_cost_usd — the savings this decision proves.
Trait Implementations§
Source§impl Clone for FinalOutcome
impl Clone for FinalOutcome
Source§fn clone(&self) -> FinalOutcome
fn clone(&self) -> FinalOutcome
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read more