In the Bitcoin mining, hashcash version 2 (2002), one looks for the input $m$ such that $\operatorname{SHA256d}(m)$ is the desired output hash value that is below the current threshold of zeros. In other words $$\operatorname{SHA256d}(x)/2^{(n-k)} = 0$$ where $k$ is the work factor, that is the number of leading zeros and $n$ is the output size that is 256 for SHA256. This was before factional is introduced;
$$\operatorname{SHA256d}(x)< 2^{(n-k)} $$
The required threshold is given therefore one look for the pre-images, that is given the hash value $x$ find a pre-image that the $\operatorname{SHA256d}(m) < \text{threshold}$. Since we are looking for a threshold the search easier than the preimage attack and still harder than the collision attack.
Note that BitCoin defines a term for this search pre-image with a partial output match.
The search doubles when the number of leading zeros is incremented by one. Therefore it is getting harder and harder. If someone is so lucky then they can find some of the required values easily but this probability is so lower than hitting your head with a meteorite!
The bitcoin miners reached $2^{92}$ double SHA2 searches in a year. If you consider that they find the block in one, they need two years, on average, or double the hardware and therefore the power consumption.
Is my understanding of multi collision correct? If so, is the difficulty of finding a 2-collision the only thing preventing this from being done?
Yes, one firstly needs to find the collisions to apply multi-collisions. And, SHA256 is far from finding one.
Note: Finding pre-image is harder than collision attacks. The Cryptographic hash functions like MD5 and SHA-1 are collisionally broken since one can find collisions better than the generic collision attack, which is given by the birthday attack. However, none of the cryptographic hash functions, including the MD5 and SHA-1, are vulnerable to pre-image attacks. Currently, $\operatorname{SHA256}$ requires around $2^{256}$ hash computations to find a pre-image. Actually, during the search one can find nearly all the pre-images that have hash values with leading zeros.