FA-083 / Distributed coordination / Member archive

Fanout multiplies a parent request's retry allowance · case 03

Every child RPC spends the entire retry budget independently.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

Given a nonnegative total allowance and nonnegative per-branch demand, return grants in branch order. Grant one unit per nonempty branch per round until total or all demand is exhausted. This models serialized admission to an already atomic shared counter.

Why this case matters

Models bounded retry amplification in scatter/gather RPC graphs; it does not attempt to simulate network timeouts or replace an atomic distributed budget store.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
one shared allowance	`[3, 3]`	`[2, 1]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.