Reading assignment: Hashing

  1. It is called Mining
    2.There are hash strings (nonces). attached to the blocks. They confirm that the level of difficulty of the string of numbers associated with the data on that block is more difficult to acces than the previous one. This makes it very hard for hackers to access data in the blocks. c
1 Like
  1. SHA-256
  2. Possibility to find the input based on the output is so difficult it is basically impossible. Every change in input change the whole output
1 Like

Mining uses SHA256 as its hashing algorithm.

Correct but the reason why its hard to brute force is because of the sheer number of possible outputs of the hashing function. :slight_smile:

1 Like
  1. SHA-256
  2. The high number of possibilities with a 256 hash it would make the brute forcing infeasible. you would have to try so much inputs it would make the endeavor pointless.
1 Like

1 SHA 256
2 SHA-256 hashing algorithm is really hard to brute-force because no matter how big or small your input is, the output will always have a fixed 256-bits length. And when dealing with large amounts of data the chances of someone randomly matching both the input and output are astronomical with the possibility of it happening would take so long it doesn’t even matter.

1 Like

Thank you, makes sense.

  1. Bitcoin uses hashing algorithm SHA-256
  2. “Brute forcing” is just taking each 256 bit string and comparing it to the next. The probability of finding a match are so infeasible that you would either have to get ridiculously lucky or you would take an incredible amount to succeed.
1 Like
  1. The hashing algorithm used in BTC is SHA256
  2. There are 2^256 possible H(X) meaning that finding the right antecedent is like winning a lottery with 2^256 tickets.
1 Like

Thank you for the clarification. Much appreciated!!

1 Like

1)SHA 256

2)Even a small change in the input will result in a huge change in the output

1 Like

SHA-256

The amount of computation required to reverse engineer just one hash is so large as to be entirely impractical.

1 Like
  1. Secure Hashing Algorithm 256 (SHA 256)

  2. The odds of brute forcing its way to find a match are astronomical to the point where it would take so long that it doesn’t really matter, nearly impossible. The birthday paradox describes a scenario where you could break collusion resistance but this is unlikely.

1 Like
  1. SHA 256
  2. You are guessing at an input and comparing it to the output to see if it matches which is very difficult because of the SHA256 or 2^128 times of trying to get the correct match.
1 Like

Thanks for helping me understand!

  1. Sha-256
  2. Because of the way the output completely changes for even the smaller change, and the volume of possible outcomes it will take so long that it won’t be worth the effort.
2 Likes
  1. Secure Hashing Algorithm 256 (SHA-256)
  2. Because it would take a very long time to go through all possible inputs.
1 Like

1 What is the hashing algorithm called used in Bitcoin?
SHA-256
2 Why is this hashing algorithm really hard (almost impossible) to brute-force?
There are so many possibilities that it would take a few lifetimes to try them all

1 Like
  1. the hashing algorithm is called sha-256.
  2. When come to pre-image resistance its not impossible to find the value of the original input. That’s if we’re were dealing with a dice which has 6 number outcomes to compare. But in the instance of 126-bit with much larger data. It would take much longer to find the original input. Randomly picking a input to find a result would take an entire lifetime to figure.
2 Likes
  1. What is the hashing algorithm called used in Bitcoin?

SHA-256

  1. Why is this hashing algorithm really hard (almost impossible) to brute-force?

There are way too many possibilities for one to reasonably think they could guess by trial and error.

1 Like

1- The hashing algorithm used in Bitcoin is SHA-256.

2- SHA-256 is really hard to brute force because it is almost impossible to recover the initial data from the output hash. Worst case scenario, it would take 2^256 attempts in order to determine the initial input.

1 Like