<oembed><type>rich</type><version>1.0</version><author_name>npub1f2nvlx49er5c7sqa43src6ssyp6snd4qwvtkwm5avc2l84cs84esecrwet</author_name><author_url>https://nostr.ae/npub1f2nvlx49er5c7sqa43src6ssyp6snd4qwvtkwm5avc2l84cs84esecrwet</author_url><provider_name>njump</provider_name><provider_url>https://nostr.ae</provider_url><html>📅 Original date posted:2015-07-20&#xA;📝 Original message:On Mon, Jul 20, 2015 at 7:10 PM, Gavin Andresen via bitcoin-dev&#xA;&lt;bitcoin-dev at lists.linuxfoundation.org&gt; wrote:&#xA;&gt; Mitigate a potential CPU exhaustion denial-of-service attack by limiting&#xA;&gt; the maximum size of a transaction included in a block.&#xA;&#xA;This seems like a fairly indirect approach. The resource being watched&#xA;for is not the size (otherwise two transactions for 200k would be&#xA;strictly worse than one 200k transactions) but the potential of N^2&#xA;costs related to repeated hashing in checksig; which this ignores.&#xA;&#xA;The cost of the indirection is forclosing future applications which&#xA;involve larger signatures but have no quadratic component and are thus&#xA;fast to verify-- or requring yet another hard fork to remove the&#xA;limit, or a kludgy soft fork that splits the same data across two&#xA;&#34;transactions&#34; which get processed as a unit... all would be&#xA;unfortunate.&#xA;&#xA;Alternative 1 sounds more attractive to be for this reason as it&#39;s more direct.</html></oembed>