327EF00CB359064B is private key for 19KbdoUvvD3CdTy78VNaLEjhzQfn55P89B
not 18bHfcm8kGoAhBaQXzzVcG5534mdpWK981
?
a <= k <= b
1 <= k - a + 1 <= b - a + 1
(k - a + 1)*G = k*G - a*G + G
It doesn't matter if a or b are anywhere between 1 and 2**256, just their difference.
Do you did your own implementation or it is some software?
A fast CUDA-based kangaroo runner (not JLP). Nothing earth-shattering so far, still testing out different things like getting rid of the carry propagation to improve parallelization. 60-bit is easily crackable even on a single-threaded CPU program. And I mentioned already some time ago that a lot of the work can be precomputed in advance, in absence of a public key. So, uhm, if m*n = t*w, guess what... you can reduce w to go towards 1, until resources are a bottleneck.