<oembed><type>rich</type><version>1.0</version><author_name>npub1ddqaln8xsfmy6sxqplt9sz5ev99kh052sveqsh02q7hmc3a6n68shpgp9a</author_name><author_url>https://nostr.ae/npub1ddqaln8xsfmy6sxqplt9sz5ev99kh052sveqsh02q7hmc3a6n68shpgp9a</author_url><provider_name>njump</provider_name><provider_url>https://nostr.ae</provider_url><html>📅 Original date posted:2016-05-11&#xA;📝 Original message:Sorry, you must have meant all 12 bytes. That makes finding a collision&#xA;substantially harder. However, you may have to restrict yourself to 10&#xA;bytes because you don&#39;t know if any hardware does timestamp rolling&#xA;on-chip. Also you create an incentive to mess around with the version bits&#xA;instead, so you would have to fix that as well. So it basically means a new&#xA;mining header with the real blockheader as a child header.&#xA;&#xA;On Wed, May 11, 2016 at 9:24 AM, Timo Hanke &lt;timo.hanke at web.de&gt; wrote:&#xA;&#xA;&gt; Luke, do you mean to replace the first 4 bytes of the second chunk (bytes&#xA;&gt; 64..67 in 0-based counting) by the XOR of those 4 bytes with the first 4&#xA;&gt; bytes of the midstate? (I assume you don&#39;t care about 12 bytes but rather&#xA;&gt; those 4 bytes.)&#xA;&gt;&#xA;&gt; This does not work. All it does is adding another computational step&#xA;&gt; before you can check for a collision in those 4 bytes. It makes finding a&#xA;&gt; collision only marginally harder.&#xA;&gt;&#xA;&gt; On Wed, May 11, 2016 at 7:28 AM, Luke Dashjr via bitcoin-dev &lt;&#xA;&gt; bitcoin-dev at lists.linuxfoundation.org&gt; wrote:&#xA;&gt;&#xA;&gt;&gt; On Wednesday, May 11, 2016 12:20:55 PM Sergio Demian Lerner via&#xA;&gt;&gt; bitcoin-dev&#xA;&gt;&gt; wrote:&#xA;&gt;&gt; &gt; On Tue, May 10, 2016 at 6:43 PM, Sergio Demian Lerner &lt;&#xA;&gt;&gt; &gt; sergio.d.lerner at gmail.com&gt; wrote:&#xA;&gt;&gt; &gt; &gt; You can find it here:&#xA;&gt;&gt; &gt; &gt;&#xA;&gt;&gt; https://bitslog.wordpress.com/2014/03/18/the-re-design-of-the-bitcoin-blo&#xA;&gt;&gt; &gt; &gt; ck-header/&#xA;&gt;&gt; &gt; &gt;&#xA;&gt;&gt; &gt; &gt; Basically, the idea is to put in the first 64 bytes a 4 byte hash of&#xA;&gt;&gt; the&#xA;&gt;&gt; &gt; &gt; second 64-byte chunk. That design also allows increased nonce space in&#xA;&gt;&gt; &gt; &gt; the first 64 bytes.&#xA;&gt;&gt; &gt;&#xA;&gt;&gt; &gt; My mistake here. I didn&#39;t recalled correctly my own idea. The idea is to&#xA;&gt;&gt; &gt; include in the second 64-byte chunk a 4-byte hash of the first chunk,&#xA;&gt;&gt; not&#xA;&gt;&gt; &gt; the opposite.&#xA;&gt;&gt;&#xA;&gt;&gt; What if we XOR bytes 64..76 with the first 12 bytes of the SHA2 midstate?&#xA;&gt;&gt; Would that work?&#xA;&gt;&gt;&#xA;&gt;&gt; Luke&#xA;&gt;&gt; _______________________________________________&#xA;&gt;&gt; bitcoin-dev mailing list&#xA;&gt;&gt; bitcoin-dev at lists.linuxfoundation.org&#xA;&gt;&gt; https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev&#xA;&gt;&gt;&#xA;&gt;&#xA;&gt;&#xA;-------------- next part --------------&#xA;An HTML attachment was scrubbed...&#xA;URL: &lt;http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20160511/6cb58d22/attachment.html&gt;</html></oembed>