What if it would be more efficient to make each miner to try to find nonces for different sets of transactions rather than finding nonces for the same set?
The nonce is iterated to find a block hash lower than the target.
Before you start trying nonces you must have a candidate block already (complete with transactions)