The vast majority of the compute time is finding the nonce that produces the output hash with the appropriate number of leading zeros. The transaction merkle tr

The vast majority of the compute time is finding the nonce that produces the output hash with the appropriate number of leading zeros. The transaction merkle tree output is an input to that calculation and transactions only need to be computed once per block. The rest of the time is generating hashes with random nonces.