With regards to the O(N2) hashing operation. The transactions could simply have been limited to 1MB. This would have meant no changes at all. The O(N2) performance assumes that the block contains a single transaction.
If N squared performance assumes a single giant transaction, why not a rule to limit the size of a transaction?
Seems like a no-brainer. I've been looking through the commits, but couldn't find it. I think classic has a defense along those lines.
[/quote]
Since I am supposed to not have a brain, it explains