You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This program works by calculating long chains of related addresses, such that: addri = f(addri-1) for some function f.
Eventually, it should find two different chains that start from different input addr0 but end in the same output address. This means that a collision occurred somewhere along the chains, and the chains got merged. This is represented by "Y", since "Y" kind of looks like two chains merging into 1.
Once a "Y" has been found, the program attempts to find the exact collision point by calculating shorter and shorter chains with the same colliding inputs.
Man you're fucking awesome! Thanks for your explanation, i understand a little bit, it will be cool make a documentation of project, or any pseudocode representing the core of the program. Again thanks!
pairgen/pairgen.c
Line 1320 in 6113d71
Hello, I'm trying to figure out what exactly this program does, can you give a brief explanation? Thank you and interesting code.
The text was updated successfully, but these errors were encountered: