hesela.devk-of-n completion
A k-of-n completion rule finishes a logical operation after any k of n eligible component responses have completed.
The collection time is the kth ordered response time, measured from a shared request origin, when any eligible subset of size k suffices. A coded read needs distinct valid fragments from one object generation and sufficient decoding rank; receiving k arbitrary messages is not enough. Metadata lookup and decoding may add time. [1] The linked exact example holds per-response late probability at 10% but changes the chance of a late two-of-three completion from 0% to 2.8% to 10% by changing the joint states. These are specified distributions, not fleet observations. [2]