All wilds became tames if you found the private key. I wrote you above how to retrieve the distance to all wilds, it is just one more group operation.
Good point. I will try to code a merger.
All small pk110 solvers, I have just uploaded some calculated distinguished points DP=28 for pk #110. There are 1.4million DPs (2^20.42).
The table includes x-coordinate (DP 28) together with the kangaroo type (0 for tame, 1 for wild).
Here is zipped txt file: https://gofile.io/d/zD2RHe
Have a look at your tables, an if you have the same x-coordinate but with the different type (i.e im my table wild, but in yours tame) - so we immediately could retrieve the private key for #110
PS. The table includes only x-coordinates. Without distance it is useless, but helpful to find cross-collision with others.
The table includes x-coordinate (DP 28) together with the kangaroo type (0 for tame, 1 for wild).
Here is zipped txt file: https://gofile.io/d/zD2RHe
Have a look at your tables, an if you have the same x-coordinate but with the different type (i.e im my table wild, but in yours tame) - so we immediately could retrieve the private key for #110
PS. The table includes only x-coordinates. Without distance it is useless, but helpful to find cross-collision with others.
What is the best way to compare TXT lists? I'm going to separate wild and tame in two different files, merge+sort with my own files and use uniq -d to find duplicates.