But like you said "Attacker should wait for 1 PoS block and delay announcing this block." Why couldn't this process be simply reiterated to form a string? You wouldn't need to "find" >2 blocks in a row, you would just need to announce them in a row. Or am I missing something?
My edit of what I said above, must have been editing while you responded:
"So, in that case, what is preventing an attacker from waiting for multiple PoS blocks and delaying announcing the multiple PoS blocks to form a string of PoS blocks similar to a TX attack chain like the one anonymousg64 was talking about? If it is not possible to wait/delay more than one block per wallet, then one could easy use multiple wallets. If the timing of generating/announcing a single PoS block can be controlled, what is preventing reiteration of the process to control a series of single blocks?
Attacker should build a chain longer than main. The more he waits the less chance to success.
Also, what would prevent another block from being announced at that same time or right before you? Say you control when you can announce your PoS block, but does that mean you can control when other people generate/announce theirs?"
Similar to mercSuey's point that PoS is a stochastic process,
What would prevent another block from being announced at that same time or right before you? Assuming you can control when you can announce your PoS block, does that mean you can control when other people generate/announce theirs?
Yes, this attack has not 100% chance to success. The point is that average block time is known.
One honest PoS block will not stop attack. Two will.
Going back to the OP,
"At such difficulty a sequential chain of PoW blocks can be mined in a flash."
And what artiface said,
"If the difficulty is very low due to low network hash rate then applying a substantially higher hashrate can cause many POW blocks to be generated quickly, much quicker than the target rate."
How exactly is this possible, particularly with difficulty re-targeting every block? Also, it is my understanding that not only would the difficulty of finding a PoW block go up, but the difficulty of finding a PoS would go down in response as well.
Additionally, no matter how fast you can manage to generate a string of PoW blocks there is no way to know with certainty that a PoS block wont be randomly generated within that time and interrupt the string? The best you could do is estimate based on the average block time, right? But this would be further complicated since the chance of finding a PoS block is increased by PoW blocks being found.
As you can see here, the PoW blocks have a different and independent difficulty algorithm than PoS blocks. If you start getting a lot of PoS blocks in a row, the chance of PoW block generation increases in order to achieve the PoW target; so after each PoS block is generated the likely-hood of generating a PoW block as the next block goes up, and after every PoW block, the chance of generating a PoS block goes up. They are both integrated with block targets and difficulties that are independent of one another; so one cannot perpetually overpower the other. This is why PoS/PoW hybrid is more secure vs just PoS only. And, it is also worth noting that over time, the Mintcoin networks actually will get more secure with age, whereas a PoW only coin has the potential to get less secure due to centralized mining processes. Mintcoin is protected from PoW overpowering, as well as PoS overpowering. You cannot know for certain the future of the Mintcion blockchain (at least very far). With Pure PoS, you know the future will always be a PoS block next, and with PoW you know that the future will always be PoW blocks next, but you cannot know the future with hybrid PoW/PoS like Mintcoin.