Comment by IgorPartola
Comment by IgorPartola 4 days ago
This is probably a dumb question, but where does this fail: what happens if I run something like the SHA256 algorithm or a sudoku solver backwards using these techniques? I assume that wouldn’t actually work, but why?
I'm speaking out of my depth, but as I understand you'd need the extra information that was accumulated along the way (as shown in the XOR gate example) If you had that you certainly could run sha 256 in reverse but for the starting hash + info, you have at least as many bits as the starting information that was hashed.