What does program compare to result in a solved key/solution?
(Tame,Wild) = Collision
k = k1 + Tame.dist - Wild.dist
Tame File:
000000000000054e3f71000000000a250208a 0000000024a2b6bb0000000026dd90e3
Wild File:
00003000000007666967d0000000093b5394a 000000008dc1e960000000002be62262
Those are from Tame and Wild files. What exactly does the program look for in those 2 lines above to result in solved key? Can anyone break it down by line and what the line/characters represent? Thanks.
Anyone?
i do not know what wild and tame file you have, but work file has Dp points like tame and wild.
Each dp have 2 128bit word distance and x-coordinate.
There will be collision if x-coordinate of tame and wild Dp the same.
to chech what type of Dp need test 126 bit of distance if it zero then it is tame dp, if it is one then dp is wild.
Thank you.
The above tame and wild files, were from some random search I did. These tame and wild were exported from a workfile using this program.
So for the above tame and wild, the first part of each line needs to match; the x coord? The second part is the distance and it just tells us what kind of kangaroo it is?