go-reliabilitylisted

# Go Reliability Resilience is **budget** arithmetic: every dependency call and retry spends the caller's remaining end-to-end budget. `budget -> per-hop deadline -> failure disposition -> retry, degrade, or shed -> lifecycle -> rollout -> proof` For a delegated Decision or Review, or when the active artifact requires its result interface, load the [shared specialist contract](../../contracts/specialist-contract.md). Trace the accepted parent budget through every wait, attempt, queue or pool acquire, and terminal response or durable handoff. When comparing proposed attempt counts, covering interacting waits, or handing off a Decision or Review, record `BudgetPath{parent_budget, waits, attempts, worst_case_spend, terminal_reserve, attempt_admission, repeatability, failure_disposition, lifecycle, signal, proof, gaps}` per path in the existing artifact or required result. A single local path can retain its complete budget arithmetic and admission predicate with matching proof without a separate record. Reserve time for the terminal response or durable handoff before allocating attempts and backoff. A retry policy satisfies: `sum(attempt budgets) + sum(backoffs) + terminal reserve <= parent budget` Use only accepted values or values read from their current owner. Keep every unaccepted reserve, backoff bound, or useful-attempt minimum symbolic and return it as an exact blocker; never choose numbers merely to make the inequality fit. Proving that `N` attempts do not fit prove