The compression period moves two costs and leaves the answer alone

The compression period moves two costs and leaves the answer alone

A Greenwald–Khanna summary at ε = 0.01 over 20,000 arrivals, with the compression period swept from 1 to 1,000 and the promise held fixed. The resident tuple count stays between 72 and 79 and the worst rank error between 120 and 145 — 1.10× and 1.21×. Over the same sweep the peak rises 10-fold and the tuples examined fall 72-fold. The marked period is ⌊1/2ε⌋ = 50, which is the one every account of the structure gives.

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

2 essays call compression-schedule. 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.