but that also comes with the issue of trusting the miner whether they wouldn't take the puzzle reward themselves or not
Well, it is also possible to share some data, which is needed to mine a block (like transaction ID, transaction Segwit ID, etc.), without sharing transaction data. Then, it would be sufficient to mine a block, but the pool wouldn't know, if it is valid or not.
Fair enough, the miner can start to "
mine" the block header without the actual transaction.
In the event that they produced a hash lower than the target, they wouldn't be able to broadcast the block without the actual raw transaction. (
or would they? Please CMIIAW)
And in mining, every millisecond counts so if the transmission of raw transaction isn't coordinated well and quick, other pools/solo miners could broadcast a block in their place.
This would need a specialized software in both miner's and user's side to be automated for low latency.
And also, if you want to prove, that you know the public key, but you don't want to reveal it, then you can share for example SHA-256 of that key, and then everyone can validate, that RIPEMD-160 of it is equal to the address, used in the puzzle.
Good idea, but I'd like to know how can this be applied exactly to existing P2PKH outputs like what OP is pertaining to?
If not possible, the
creator of the puzzle may have to consider spending those weak ranges into your proposed output.