This is the
double compression fallacy. The only way this works is by my servers doing part of the hashing work, in which case
what the heck is the point?
First, this isn't a compression fallacy.
Yes, that's exactly what it is.
I'm not going to write a post explaining the double compression fallacy to you.
You have the bulk of the data already (the work)
Nonces-which-are-shares are statistically random and therefore incompressible. Every possible 32-bit integer is equally likely to be the solution to a randomly chosen piece of work. You're trying to claim that knowing
which piece of work it solves somehow effortlessly adds information. It doesn't.
Given a nonce-to-be-transmitted, the
Shannon entropy of the additional foreknowledge of the work which it solves is
exactly zero bits unless you
actually do the work -- subject to the assumption that SHA-256 is a one-way hash function. So the only way this is not double compression is if you've somehow found a way to invert SHA-256 and it isn't a one-way hash function anymore. If you have figured this out, you shouldn't be wasting your time here on the forum -- you should be coding up that inversion function, mining 99% of the bitcoins, and rolling in piles of money.
Call me when you're rolling in piles of money.