Your numbers do not add up for HEX64.
This thread was only opened to investigate the technical possibility of this.
There is no technical possibility to count up to 2**256, let alone match stuff at each iteration.
It does not matter if you use a single computer, 10.000 computers, 1 trillion CUDA devices, 1 quadrillion ASIC devices each running whatever amount of TH/s, or even all the atoms in the Universe, each as a computing node in your distributed P2P. Again, there is no physical possibility to build even a simple counter that does: 1, 2, 3, 4.... 2**256 without ending up in the situation of witnessing the last proton in the universe decay itself.
You would need multiple parallel multiverses in order to be able to have the required energy to flip over bits from 0 to 1 which is needed, if you want to traverse all those 2**256 variations of all possible SHA256 values you intend to break.
And even if you do succeed, you would then have to break the corresponding secp256k1 of the public key for which you have found a collision to an address, which is itself a 2**128 operations problem.
The answer to your question is NO, but you should have known that already before even needing to open such a topic.
I don't need your made-up information, I am aware of the difficulty. 1 TH power may be a power you will despise. But I'm sure it will be a serious force on P2P.
3DES is a 168-bit security algorithm. And it has now been removed from firewall protocols.
Mainly because of the markup. So if you can write something numerically, that means you can mark it as a mode. I've written to you many times about the algorithm that will not be marked, Timstamp Hash Bcrypt.