I wanted to know: what happens if you initialize a brute-force run with a simple equality like xy = x / y? Not as a filter, just as a logical ignition point.

I used AES-256-CBC encrypted files with UUID passwords and tested against a 1 million UUID space. It cracked it in under 40 seconds. Then I scaled it to a 1 billion UUID range, and it still found the key without issue.

This isn’t a crypto tool, and I’m not trying to solve any cryptographic problems. I’m just curious if deterministic logic applied to large search spaces can be useful.

Repo’s here if anyone wants to take a look or test it themselves: [https://github.com/ElSolem/project_oceans]

Feedback welcome — and open to hearing where this kind of structure-first approach might apply.