SHA-256 0573e7473

Not a repost, but similar has been done and posted before &quot;The SHA256 for this sentence begins with: one, eight, two, a, seven, c and nine.&quot;[1][2], about a year ago.<p>[1]: <a href="https:&#x2F;&#x2F;twitter.com&#x2F;lauriewired&#x2F;status&#x2F;1700982575291142594" rel="nofollow">https:&#x2F;&#x2F;twitter.com&#x2F;lauriewired&#x2F;status&#x2F;1700982575291142594</a><p>[2]: <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=37465086">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=37465086</a>

<p><pre><code> echo -n &#x27;The SHA-256 hash of this sentence begins with 0573e7473.&#x27; | sha256sum 0573e74731e90fed80059d65263d300d58c4a452012a69c56f0a58fcae0605ad -</code></pre>

Given that the AMD Ryzen 9 5950X can compute around 28.1 million SHA-256 hashes per second, the time required to calculate the hash of such a proposition including all possible 9-length hexadecimal strings to would be approximately: 68.72 x 10^9 strings&#x2F; 28.1 x 10^6 hashes per second ~= 2450 seconds. The hash starts with 0 so the calculation would have been much shorter i.e. just around 2 minutes. This can probably be explained in terms of the birthday collision problem.

Gif that displays its own MD5 hash: <a href="https:&#x2F;&#x2F;shells.aachen.ccc.de&#x2F;~spq&#x2F;md5.gif" rel="nofollow">https:&#x2F;&#x2F;shells.aachen.ccc.de&#x2F;~spq&#x2F;md5.gif</a><p><pre><code> $ md5sum md5.gif f5ca4f935d44b85c431a8bf788c0eaca md5.gif</code></pre>

Oh a self referential statement!<p><a href="https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Self-reference" rel="nofollow">https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Self-reference</a>

9 hex digits makes for a 36 bit search space, so we can expect a solution in 64 billion hashes. moderately but not terribly impressive.

this is a relatively trivial looping programming task ... suitable for a 1st year comp sci student.

You mind mining a few blocks for me?

That&#x27;s a lof of GPU time right there