I think we misunderstood each other a bit in question 7), but your answer just taught me soo much more than I had expected. I think the misunderstand is caused by my idea that blocks were gathered and controlled by the coinbase and not by the pool, so this brings up a couple of more questions. Again thanks for the help:
8 ) So is it correct that the individual pool (or in solo mining cases, the miner) that gathers each transaction in to blocks and then hashes that block for the block reward and transaction fee?
9) If each pool/miner chooses what transactions to put in their blocks (ofcourse prioritizing those with the highest fees attached to them), are there then a large "sea" of unconfirmed transactions with too low fees?
10) Is it correct to assume that a block must contain 232*D hashes of transactions before it can be hashed, or what controls that each block contains the necessary amount of transactions in order to claim the block reward?
I will now roll the dice and hope that the troll will continue to sleep soundly in his cave.
Yes. That is exactly what the miners (pool or solo) do.
9)The number of unconfirmed transactions varies but there are usually some unconfirmed transactions on the network. It could be a large amount but not necessarily. You can check that number here. Blockchain.info has many Bitcoin queries available online - https://blockchain.info/q
10) No. The block only needs to contain one transaction called the coinbase transaction. The data within the block of transactions gets hashed (it's a little complicated) into a what's called a merkle root. This hash is added to the block header which contains specific information about the block including the winning hash of the previous block and its nonce in order to secure it into the block chain. Now that block header gets hashed while incrementing the nonce on each successive attempt until the miner obtains a number less than the current target. This would be a winning hash and the miner that finds it gets the reward. In order to do that, billions of hashes are required but not stored.