Is it possible to come up with a new algorithm for finding zeros in the "salt" of the block faster?

Question

Programming

If the winning block is considered to be the one that has a certain number of zeros in the "salt" of the hash and our client program is engaged in picking up this number of zeros, then is it possible in theory to write the program itself, which would, according to the created more efficient algorithm would iterate through the numbers in the "salt" and thereby increase the chances of creating a block with a given number of zeros? That is, I mean, let’s say I don’t want to download a mining program, but I want to write my own, which would pick up these zeros for me in a faster way and I would earn more BTC. Your comments and ideas on the topic.

Answer 1

Invent an algorithm for quickly factoring numbers into prime factors.

Answer 2

This would be possible if the hashing algorithm was not crypto-resistant (this means that when at least one bit in the source data changes, a random number of bits in the hash changes, regardless of which data was changed). Those. when developing a crypto-resistant algorithm, they specially develop an algorithm that cannot be 'optimized' like this.