Proof of work: optimal number of transactions?
Given that the probability of finding the correct nonce will be marginally higher if you've already tested thousands of nonces for a given merkle root


This isn't true. No block header is guaranteed to return a solution. (In fact, most do not.) Each attempt to hash a block header is equally likely to result in a valid block, regardless of how many nonces have already been checked.