A simple modification of the L∗ algorithm that ensures that for subsequent hypotheses the minimal length of a counterexample never decreases, which implies that the distance to the target never increases in the ultrametric 2^-n.