<oembed><type>rich</type><version>1.0</version><author_name>Tomas [ARCHIVE] (npub1rs…9evk4)</author_name><author_url>https://nostr.ae/npub1rsp4w56r24w3zv4xy8zfgesep45qmf9rq6aghxfw3wr7yemqnnwsf9evk4</author_url><provider_name>njump</provider_name><provider_url>https://nostr.ae</provider_url><html>📅 Original date posted:2017-04-08&#xA;📝 Original message:&gt; I don’t fully understand your storage engine. So the following deduction&#xA;&gt; is just based on common sense.&#xA;&gt; &#xA;&gt; a) It is possible to make unlimited number of 1-in-100-out txs&#xA;&gt; &#xA;&gt; b) The maximum number of 100-in-1-out txs is limited by the number of&#xA;&gt; previous 1-in-100-out txs&#xA;&gt; &#xA;&gt; c) Since bitcrust performs not good with 100-in-1-out txs, for anti-DoS&#xA;&gt; purpose you should limit the number of previous 1-in-100-out txs. &#xA;&gt; &#xA;&gt; d) Limit 1-in-100-out txs == Limit UTXO growth&#xA;&gt; &#xA;&gt; I’m not surprised that you find an model more efficient than Core. But I&#xA;&gt; don’t believe one could find a model that doesn’t become more efficient&#xA;&gt; with UTXO growth limitation.&#xA;&#xA;My efficiency claims are *only* with regards to order validation. If we&#xA;assume all transactions are already pre-synced and verified, bitcrust&#39;s&#xA;order validation is very fast, and (only slightly) negatively effected&#xA;by input-counts.&#xA;&#xA;Most total time is spend during base load script validation, and UTXO&#xA;growth is the definitely the limiting factor there, as the model here&#xA;isn&#39;t all that different from Core&#39;s.&#xA;&#xA;&#xA;&gt; Maybe you could try an experiment with regtest? Make a lot 1-in-100-out&#xA;&gt; txs with many blocks, then spend all the UTXOs with 100-in-1-out txs.&#xA;&gt; Compare the performance of bitcrust with core. Then repeat with&#xA;&gt; 1-in-1-out chained txs (so the UTXO set is always almost empty)&#xA;&gt; &#xA;&#xA;Again, this really depends on whether we focus on full block validation,&#xA;in which case the 100-1, 1-100 distinction will be the similar to Core,&#xA;or only regard order validation, in which case Bitcrust will have this&#xA;odd reversal. &#xA;&#xA;&#xA;&gt; One more question: what is the absolute minimum disk and memory usage in&#xA;&gt; bitcrust, compared with the pruning mode in Core?&#xA;&#xA;As bitcrust doesn&#39;t support this yet, I cannot give accurate numbers,&#xA;but I&#39;ve provided some numbers estimates earlier in the thread.&#xA;&#xA;&#xA;Rereading my post and these comments, I may have stepped on some toes&#xA;with regards to SegWit&#39;s model. I like SegWit (though I may have a&#xA;slight preference for BIP140), and I understand the reasons for the&#xA;&#34;discount&#34;, so this was not my intention. I just think that the reversal&#xA;of costs during peak load order validation is a rather interesting&#xA;feature of using spend-tree  based validation. &#xA;&#xA;Tomas</html></oembed>