4 ms·

For comparison with Bitcoin: 00000000 000003da 5849ade5 e2112447 73478c46 5fcdc744 9e247df4 11e97b28 (#1 of leaderboard) 00000000 00000000 0002a2fa b0

For comparison with Bitcoin: 00000000 000003da 5849ade5 e2112447 73478c46 5fcdc744 9e247df4 11e97b28 (#1 of leaderboard) 00000000 00000000 0002a2fa b0d010ce 270927e8 c9a698a3 4f5e3d6c 4dbcffd3 (latest mined block) Doesn't seem that impressive but keep in mind that it gets exponentially harder to find additional leading 0s and that the Bitcoin network currently finds such hashes every ~10 minutes.

WatchDog 2y ago
Could someone scan all the mined blocks, and find one that has a plaintext conforming to the submission requirements? Edit: Looking at the data structure for a bitcoin block, for multiple reasons such as magic numbers and length, none of them would be a valid submission.
- taxborn 2y ago
  This would be roughly equivalent to finding a SHA256 collision then, right?
  - WatchDog 2y ago
    Before looking into the actual bitcoin block structure, and realizing this wasn't possible, I thought that maybe hashes were a hash of a hash. A hash is essentially just some random bytes, there is a small chance that the first hash bytes would randomly all be printable characters that fit the submission format, given that the bitcoin network has already done most of the work finding the small hashes, scanning through the blockchain trying to find a hash with a plaintext that fits the submission criteria, should be much less work.
    - Retr0id 2y ago
      They are hashes of hashes, and in fact I already did scan all* the blocks to check if any of them meet the constraints, just in case (they don't, and it would be extremely unlikely but not entirely out of the question). *as of a year or so ago (my archive is stale and I'm too lazy to update it)
  - anacrolix 2y ago
    No, you're looking for a suitable hash but not an exact match to anything. Some of the hashes are premined. But you do need the hash input to fit a specific format. That's still more likely and more accessible than a collision (I'm sure scanning all the available values is computable in a relatively shorter time than finding arbitrary collisions with a specific hash).
kmort 2y ago
And compared to lowest: 00000000 000003da 5849ade5 e2112447 73478c46 5fcdc744 9e247df4 11e97b28 (#1 of leaderboard) 00000000 00000000 0000fac0 39d91fc6 1db532f3 879ec244 15a2bff9 cd1d4efb (latest mined block right now -- another zero added since your post) 00000000 00000000 00000000 5d6f0615 4c868514 6aa7bc3d c9843876 c9cefd0f (lowest hash ever?)[0] [0] https://crypto.stackexchange.com/questions/110956/what-s-the-smallest-known-sha256-hash-that-was-ever-produced https://crypto.stackexchange.com/questions/110956/what-s-the...
compressedgas 2y ago
At some point this problem of finding a hash with a number of heading zeros flips from being increasing hard to brute force to being increasingly easier to search: http://jheusser.github.io/2013/02/03/satcoin.html http://jheusser.github.io/2013/02/03/satcoin.html https://github.com/jheusser/satcoin https://github.com/jheusser/satcoin

WatchDog 2y ago

Could someone scan all the mined blocks, and find one that has a plaintext conforming to the submission requirements? Edit: Looking at the data structure for a bitcoin block, for multiple reasons such as magic numbers and length, none of them would be a valid submission.

taxborn 2y ago
This would be roughly equivalent to finding a SHA256 collision then, right?
- WatchDog 2y ago
  Before looking into the actual bitcoin block structure, and realizing this wasn't possible, I thought that maybe hashes were a hash of a hash. A hash is essentially just some random bytes, there is a small chance that the first hash bytes would randomly all be printable characters that fit the submission format, given that the bitcoin network has already done most of the work finding the small hashes, scanning through the blockchain trying to find a hash with a plaintext that fits the submission criteria, should be much less work.
  - Retr0id 2y ago
    They are hashes of hashes, and in fact I already did scan all* the blocks to check if any of them meet the constraints, just in case (they don't, and it would be extremely unlikely but not entirely out of the question). *as of a year or so ago (my archive is stale and I'm too lazy to update it)
- anacrolix 2y ago
  No, you're looking for a suitable hash but not an exact match to anything. Some of the hashes are premined. But you do need the hash input to fit a specific format. That's still more likely and more accessible than a collision (I'm sure scanning all the available values is computable in a relatively shorter time than finding arbitrary collisions with a specific hash).

kmort 2y ago

And compared to lowest: 00000000 000003da 5849ade5 e2112447 73478c46 5fcdc744 9e247df4 11e97b28 (#1 of leaderboard) 00000000 00000000 0000fac0 39d91fc6 1db532f3 879ec244 15a2bff9 cd1d4efb (latest mined block right now -- another zero added since your post) 00000000 00000000 00000000 5d6f0615 4c868514 6aa7bc3d c9843876 c9cefd0f (lowest hash ever?)[0] [0] https://crypto.stackexchange.com/questions/110956/what-s-the-smallest-known-sha256-hash-that-was-ever-produced https://crypto.stackexchange.com/questions/110956/what-s-the...

compressedgas 2y ago

At some point this problem of finding a hash with a number of heading zeros flips from being increasing hard to brute force to being increasingly easier to search: http://jheusser.github.io/2013/02/03/satcoin.html http://jheusser.github.io/2013/02/03/satcoin.html https://github.com/jheusser/satcoin https://github.com/jheusser/satcoin