It is known that due to pollard kanagaroo method it is possible to perform less bruteforce operations. And roughly it is square root from the total length.
This is actually an interesting concept so I looked it up. It basically computes two sets of numbers, one set for each side of the x
y = m equation. Later elements in the set are derived from earlier elements, and sometimes this will not find a collision between two elements in the same position of the two sets. I wonder if the regions/domains of x that will be missed is known, or at least if there have been studies about this.