I'm new to bitcoin, and my knowledge of bitcoin is quite garbled and messy (I have only a vague understanding of Satoshi's original white paper for bitcoin......)
I've been reading up on bitcoin mining lately, and I just thought of a mining strategy which may or may not work.
What I want to do is this:
(1) Obtain the hash of the previous block to use as a component of my new block. This previous block hash can be updated accordingly if a new block is added into the blockchain.
(2) Based on the previous block hash, I calculate the possible block header combinations of the nonce, the version number, the timestamp* and the Merkle root. The goal is to simply find a valid block header which has a lower hash value than the current target.
(3) Make several bitcoin accounts, and execute a transaction based on this pre-constructed block header. For example, based on the pre-constructed block header, I have to execute a transaction at a specific time, with a specific Merkle root, etc. Once my transaction has appeared in the mempool, I can immediately submit my pre-constructed block header to verify the transaction - and earn bitcoins in the process.
*: The timestamp should be within a reasonable range - (a) greater than the median of the past 11 blocks, and (b) be within 2 hours of the network adjusted time. Otherwise, the timestamp would not be considered valid by the bitcoin network.
The potential advantage (at least, that's what I think) of this strategy is that I can earn bitcoins 100% of the time because I already know the winning nonce to the puzzle, putting the other miners at a disadvantage.
Is this even remotely feasible? Does this take more computing time and power than the typical bitcoin mining process? Or am I missing something?