I’m the author. This is a deliberately small, design-first library focused only on async admission control: not execution, retries, or backpressure. The goal is to make overload explicit and test-backed rather than smoothed or hidden.

If you’re skimming, the core invariant is that an operation is in-flight from successful admission until its returned CompletionStage reaches a terminal state. Everything else (fail-fast rejection, cancellation semantics, lack of queuing/fairness) follows from that.

Happy to be challenged on semantics or failure modes, especially edge cases under concurrency.