for 135-bit tame's and wild's values needs very long time (about 48h) to fill.
48h or 48 millenia?
It was proven several times since 1994 that the lower bound for finding the discrete log in a generic group is
sqrt(N) steps, and there is no magical way to go lower than that within classical computation, and there is no way to ever come up with a lower complexity than sqrt(N). Anyone who argues this is an idiot (and I use the word lightly).
Of course, EC is not a generic group, so any algo that lowers the complexity must take into account the curve's properties, otherwise they are simply methods of a generic group, and follow the above conclusion.