Random bits consumed against n, k = 16

Random bits consumed against n, k = 16

Coin flips charged at the point they are spent, on logarithmic axes, with the class each consumer declares fitted by the same ratio test the comparison counts get. Rejections are charged: a draw below a range that is not a power of two costs whatever the rejection loop actually spent, not the ⌈log₂ k⌉ it would cost if the arithmetic were free. At n = 16,384 the consumers drawn here span 7,068 to 293,682 bits.

Drawn at 700 × 400, wide on the page. Everything above is what randomness-consumed returns with no arguments; the caption is the generator's own, computed from the numbers in the drawing rather than written beside it.

4 essays call randomness-consumed. The drawing above is what it returns with no arguments at all; every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about — which is what optcheck and figfill exist to catch.