Currently Dash has a size limit of 1MB per block. With this limit a miner could include a transaction that takes around 3 minutes to verify on a moderate CPU . However, with a 2MB block size the attacking miner could include a transaction that takes around 12 minutes to verify . If an attacker successfully gets an attacking block in the chain then all nodes in the future will need to verify this block when syncing. This attack is even more dramatic as block size increases. Paradoxically, this attack could get so bad that it becomes impossible because propagation would force an attacking block to be orphaned. Even if an attacking block is not included in the main chain, trying to verify attacking blocks can have negative transient effects.

This attack is quadratic with respect to transaction size. As such, limiting transaction size makes this attack impossible. Currently, transactions over a size of 100kB are nonstandard and dropped by the network. Click to expand...

A quadratic hashing attacking transaction of size 100kB would take around 2 seconds to verify. Since transactions are processed in parallel, a 2MB block full of 100kB attacking transactions would take from 4 to 8 seconds to process. For this reason this DIP changes consensus rules so that blocks with a transaction over 100kB are ruled invalid and orphaned. Click to expand...

Could you please use computational theory ( or parameterized complexity ) terms? You should describe the problem using this theory, in order to get rid of the inaccurate "nowdays moderate CPU" concept.Scaling the block size is a timeless problem, and as such it should be described. Dont use initial values (3 minutes to verify, 12 minutes to verify) as arguments. Try to describe the problem by seting these initial values as variables . So that if in the future the "3 minute to verify" becomes "1 second to verify" or "3 hours to verify", you can reconsider your decision.Ok, now you are using parameterized complexity terms.But could you please give us a url that points and analyzes your argument.How comes and this is a quadratic attack. Who said that, where, and how this quadratic term has been proved?You are falling again into the "nowdays moderate CPU" pit. 100kb and 2 seconds for what kind of CPU? Is there an analysis about 200kb? For 200kb, how many seconds, and in what kind of CPU?