SHA-256 0573e7473

#1

Post by stargrave » Tue, Nov 12, 2024, 10:23 AM UTC

SHA-256 0573e7473
susam.net

Re: SHA-256 0573e7473

#2

Post by mansilladev » Tue, Nov 12, 2024, 10:55 AM UTC

You mind mining a few blocks for me?

Re: SHA-256 0573e7473

#3

Post by noname120 » Tue, Nov 12, 2024, 10:55 AM UTC

  echo -n 'The SHA-256 hash of this sentence begins with 0573e7473.' | sha256sum 
  0573e74731e90fed80059d65263d300d58c4a452012a69c56f0a58fcae0605ad  -

Re: SHA-256 0573e7473

#4

Post by messe » Tue, Nov 12, 2024, 10:56 AM UTC

Not a repost, but similar has been done and posted before "The SHA256 for this sentence begins with: one, eight, two, a, seven, c and nine."[1][2], about a year ago.

[1]: https://twitter.com/lauriewired/status/1700982575291142594

[2]: https://news.ycombinator.com/item?id=37465086

Re: SHA-256 0573e7473

#5

Post by Cantinflas » Tue, Nov 12, 2024, 10:56 AM UTC

That's a lof of GPU time right there

Re: SHA-256 0573e7473

#6

Post by [deleted] » Tue, Nov 12, 2024, 10:57 AM UTC

[deleted]

Re: SHA-256 0573e7473

#7

Post by messe » Tue, Nov 12, 2024, 10:59 AM UTC

Cantinflas wrote: post #5

That's a lof of GPU time right there

It's a few minutes (maybe a few hours) of CPU time, tops, especially if you're parallelizing and using an optimized SHA256 implementation.

See the comments from a year ago at: https://news.ycombinator.com/item?id=37465086

Re: SHA-256 0573e7473

#8

Post by GreenWatermelon » Tue, Nov 12, 2024, 10:59 AM UTC

Oh a self referential statement!

https://en.m.wikipedia.org/wiki/Self-reference

Re: SHA-256 0573e7473

#9

Post by jannw » Tue, Nov 12, 2024, 11:02 AM UTC

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

Re: SHA-256 0573e7473

#10

Post by TheMechanist » Tue, Nov 12, 2024, 11:22 AM UTC

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/ 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.