More precisely, the guarantee offered by the soft heap is the following: for a fixed value "ε" between 0 and 1/2, at any point in time there will be at most "ε*n" corrupted keys in the heap, where "n" is the number of elements inserted so far.