"""Retry backoff helpers for transient LLM API failures. Replaces fixed exponential backoff with jittered delays to prevent thundering-herd retry spikes when multiple sessions hit the same rate-limited provider concurrently. Based on hermes-agent's retry_utils.py design. """ from __future__ import annotations import random import threading import time from typing import Any, Callable # Monotonic counter for jitter seed uniqueness within the same process. # Protected by a lock to avoid race conditions in concurrent retry paths # (e.g. multiple gateway sessions retrying simultaneously). _jitter_counter = 0 _jitter_lock = threading.Lock() def compute_retry_delay( attempt_index: int, *, base_delay: float, max_delay: float = 30.0, jitter_ratio: float = 0.25, random_fn: Callable[[], float] = random.random, ) -> float: """Return exponential backoff delay with additive jitter. ``attempt_index`` is zero-based for the sleep before the next retry. """ base = max(0.0, float(base_delay)) if base == 0: return 0.0 cap = max(0.0, float(max_delay)) jitter = max(0.0, float(jitter_ratio)) delay = min(base * (2 ** max(0, attempt_index)), cap) if delay == 0 or jitter == 0: return float(delay) rand = min(1.0, max(0.0, float(random_fn()))) return float(min(cap, delay + (delay * jitter * rand))) def jittered_backoff( attempt: int, *, base_delay: float = 5.0, max_delay: float = 120.0, jitter_ratio: float = 0.5, ) -> float: """Compute a jittered exponential backoff delay. Args: attempt: 1-based retry attempt number. base_delay: Base delay in seconds for attempt 1. max_delay: Maximum delay cap in seconds. jitter_ratio: Fraction of computed delay to use as random jitter range. 0.5 means jitter is uniform in [0, 0.5 * delay]. Returns: Delay in seconds: min(base * 2^(attempt-1), max_delay) + jitter. The jitter decorrelates concurrent retries so multiple sessions hitting the same provider don't all retry at the same instant. """ global _jitter_counter with _jitter_lock: _jitter_counter += 1 tick = _jitter_counter exponent = max(0, attempt - 1) if exponent >= 63 or base_delay <= 0: delay = max_delay else: delay = min(base_delay * (2 ** exponent), max_delay) # Seed from time + counter for decorrelation even with coarse clocks. seed = (time.time_ns() ^ (tick * 0x9E3779B9)) & 0xFFFFFFFF rng = random.Random(seed) jitter = rng.uniform(0, jitter_ratio * delay) return delay + jitter def _error_text(error: Any) -> str: """Best-effort flattened provider error text for retry classification.""" parts = [ error, getattr(error, "message", None), getattr(error, "body", None), getattr(error, "response", None), ] return " ".join(str(part) for part in parts if part is not None).lower() def is_zai_coding_overload_error(*, base_url: str | None, model: str | None, error: Any) -> bool: """Return True for Z.AI Coding Plan transient overload 429s.""" base = (base_url or "").lower() model_name = (model or "").lower() status = getattr(error, "status_code", None) text = _error_text(error) return ( status == 429 and "api.z.ai/api/coding/paas/v4" in base and "glm-5.2" in model_name and ("1305" in text or "temporarily overloaded" in text) ) def adaptive_rate_limit_backoff( attempt: int, *, base_url: str | None, model: str | None, error: Any, default_wait: float, short_attempts: int = 3, ) -> tuple[float, str | None]: """Provider-aware rate-limit backoff. For most providers this returns ``default_wait`` unchanged. For Z.AI Coding Plan GLM-5.2 overloads, keep the first ``short_attempts`` retries on the normal short exponential schedule, then switch to progressively longer waits (30s → 60s → 90s → 120s, capped) plus light jitter. ``attempt`` is 1-based, matching the retry loop's logged attempt number. Returns ``(wait_seconds, reason_label)`` where ``reason_label`` is suitable for status/log decoration when a provider-specific policy fired. """ long_backoff = (30.0, 60.0, 90.0, 120.0) if not is_zai_coding_overload_error(base_url=base_url, model=model, error=error): return default_wait, None if attempt <= short_attempts: return default_wait, "zai_coding_overload_short" idx = min(attempt - short_attempts - 1, len(long_backoff) - 1) base_delay = long_backoff[idx] # A smaller jitter ratio keeps long waits readable while still avoiding # synchronized retry storms across concurrent sessions. return jittered_backoff(1, base_delay=base_delay, max_delay=base_delay, jitter_ratio=0.2), "zai_coding_overload_long"