<oembed><type>rich</type><version>1.0</version><author_name>npub1nxlvf9mj3jzgue25n5d9y47s3h5hvg0ded9hwpejdxj9mtrs34vs97wjrv</author_name><author_url>https://nostr.ae/npub1nxlvf9mj3jzgue25n5d9y47s3h5hvg0ded9hwpejdxj9mtrs34vs97wjrv</author_url><provider_name>njump</provider_name><provider_url>https://nostr.ae</provider_url><html>📅 Original date posted:2014-07-04&#xA;📝 Original message:On Friday 04 July 2014 07:22:19 Alan Reiner wrote:&#xA;&#xA;&gt; I think you misundersood....  using ROMix-like algorithm, each hash&#xA;&#xA;I did.  Sorry.&#xA;&#xA;&gt; requires a different 32 MB of the blockchain.  Uniformly distributed&#xA;&gt; throughout the blockchain, and no way to predict which 32 MB until you&#xA;&gt; have actually executed it.   If the difficulty is high enough, your&#xA;&gt; miner is likely to end up going through the entire X GB blockchain while&#xA;&gt; searching for a good hash, but other nodes will only need to do 32 MB&#xA;&gt; worth of disk accesses to verify your answer (and it will be unknown&#xA;&gt; which 32 MB until they do the 1,000,000 hash+lookup operations on their&#xA;&gt; X GB blockchain).&#xA;&#xA;Excellent.&#xA;&#xA;&#xA;Andy&#xA;&#xA;-- &#xA;Dr Andy Parkins&#xA;andyparkins at gmail.com</html></oembed>