Reading assignment: Hashing

Blockchain and Bitcoin 101
#946
  1. SHA 256
  2. because it has 256 bits of information for every output not matter the size of the input, making the amount of time it takes to guess all the possibilities more than one has in a lifetime
1 Like
#947

  1. The hashing algorithm used in Bitcoin is the SHA-256 (Secure Hashing Algorithm 256). It shows that no matter the size of your input, your output will ALWAYS have a fixed 256-bits length.

  2. This hashing algorithm is really hard (almost impossible) to brute-force because given H(A) it is infeasible to determine A since A = the input and H(A) = the output hash. Brute-forcing is also very time consuming since you have to pick up a random input, hash it, and compare the output with the target hash and repeat the entire process until you find a match.

1 Like
#948
  1. In Bitcoin, the hashing algorithm is SHA-256.
  2. It is difficult to brute force because of comparing the input to the output and trying to find a match.
1 Like
#949
  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?

Essentially Because the time it would take to sort through all the data renders the the process pointless
however not impossible if you got the time and probably the heirs.:wink:

1 Like
#950

SHA256

The time required to find the exact input with the output is too long that it might take generations to try each possible inputs to match it with brute force.

One question that arises to me is that once the computing technologies improve in quantum computation, wouldn’t it be able to solve this hash to crack/attack the Blockchain?

1 Like
#951
  1. The hashing algorithm used in bitcoin is called Secure Hashing Algorithm 256 which gives an output of a fixed length
  2. it is hard to brute force because of the sheer number of possibilities this produces which would take forever to resolve
1 Like
#952

1. What is the hashing algorithm called used in Bitcoin?
SHA-256 (Secure Hashing Algorithm 2556)

2. Why is this hashing algorithm really hard (almost impossible) to brute-force?
Because it takes would take an incredible amount of time to break it “that it doesn’t matter”.

1 Like
#953

1.SHA-256
2. one way mathematical digest; computationally would take such a long time; possibly more than my life time and that the total number of possibilities is so large that it is unlikely two people get the same result in their life time.

1 Like
#954

1 - SHA256 is the hashing algorithm used in Bitcoin

2- The hashing algorithm has a 6 cryptographic hash function which makes it impossible to brute force.

1 Like
#955
  1. SHA-256 (Secure Hashing Algorith 256)
  2. One of the properties needed for cryptographic hash functions to work and be secure is to make it pre-image resistant which in turn makes it almost impossible to brute-force (infeasible). This is what mining entails and how it adds security to the network
1 Like
#956

  1. SHA-256 (Secure Hashing Algorithm 256)

  2. The average scenario is that you find a match in the middle of the data, which means after 5,789604462×10⁷⁶ times. It’s not impossible, but it takes so long that it doesn’t matter.

1 Like
#957
  1. SHA 256
  2. Because there are to many possible results
1 Like
#958
  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?
    Each input has very different and unique output.
    Can have 2 to the 256 different inputs. Very very very improbable to brute force and guess it right
1 Like
#959
  1. SHA-256
  2. It is almost impossible to break by brute force, first and foremost, because a 256 bit hash generates a total number of 2^256 output hashes. Consequently, the probability of finding—by the brute force of chance alone—an input string that produces a given output hash is utterly negligible (as 2^256 is probably larger or about as large as the number of atoms in the universe). It also doesn’t help to find an input string that produces an output hash similar to the given output hash because the hash function is, as it were, highly discontinuous (in the sense that small changes in the input typically produce large changes in the output). So there is no realistic expectation that a matching input string can be found in close proximity to an input string that produces an output hash that closely matches the given output hash.
1 Like
#960
  1. SHA-256
  2. because it basically takes so long to compute that it doesn’t matter
1 Like
#961

  1. SHA - 256

  2. You get more collision resistance

1 Like
#962
  1. SHA 256
  2. Because even the slightest change in the input, changes the output completely
1 Like
#963

Yes. There is too many combinations. Making it impossible to brute force.

#964

Great question. Here are some thoughts by andreas antonopoulos: https://www.youtube.com/watch?v=wlzJyp3Qm7s

2 Likes
#965
  1. There is way too many combinations to go trough, in order to brute force SHA-256. I am not sure what you meant by your answer. A hash function needs to be collision resistant in order to be secure.