hi Sergio,
By "faster" , do you mean less orphaned blocks?
One of the "collapse" scenarios with fast blocks is that nobody has an incentive to publish.
If the block rate is much faster than network latency, then nobody has an incentive to publish blocks.
The best strategy is to generate a chain of blocks and then publish them as a unit.
The miner with the single concentration of hashing power will win more than 50% of the mini-chains.
If 65% of the miners are fragmented, they have a slight delay after each block. If they find a block every 5 seconds, but latency is 5 seconds, then they are only 50% effective.
A miner with 35% of the mining power would be able to generate blocks faster. Their efficiency is 50%, so they effectively have 32.5% of the mining power.
If the latency is much bigger than the block rate, the mining efficiency of fragmented miners is extremely low.
This system could be expanded to allow multiple "uncle" blocks.
The header could be
Hash(prev)
Hash(merkle-uncles)
<etc>
The merkle-uncles would be be the merkle root of a list of uncle headers.
This would allow a majority of the hashing power to combine their block headers, without having to form a chain.
The block rate could be adjusted if there are to many orphans.
The mint reward could be doubled if the block rate was halved (due to latency), so everything remains balanced.