[quote=“ivan, post:1, topic:8422, full:true”]
Answer the questions below.
What is the hashing algorithm called used in Bitcoin?
1.R 1. Sha 256 .
Why is this hashing algorithm really hard (almost impossible) to brute-force?
2R. Because the total outcomes possible is to large, that make almost impossible to find the same output in a hash function.
Bitcoin uses the SHA-256 hashing algorithm
The hashing algorithm is infeasible to brute-force because there are so many different possibilities that the time it would take to find all of the different inputs would be incredibly low to do even in generations of lifetimes
The hashing algorithm used in Bitcoin is SHA-256
The hashing algorithm of Bitcoin is almost impossible to brute-force because that means that one needs to try random inputs and compare to given hash and at this level of hashing there are so many possibilities to try with so it is not worth the try (1.7 X 10^38)
the hashing algorithm is called SHA 256
It is because the pre-image resistence propety, that makes infeasible to brute force the algorithm that makes in the averange situation to try 1.7 X 10^38 times to find the input, and it only will work for that output.
continuing with the reading i got 2 quest:
i understand that the probability of collision is extremrly low (2^64th) but what if this heppends?
what happens with orphan blocks?
It’s SHA-256.
Because it would take generations to succeed and not that many people have that much time.
You could have a collision without having drastic problems. Only if you have for example 2 different unconfirmed transactions with the same hash or something around the same time. Hashes are primarily interesting because if you change 1 value, the whole hash would be completely different. It’s more to check that no information has been modified and it is easy to work with because it is just a number of a fixed size
sha 256
you should take a random input to find the same hash. Almost impossible to find it.
SHA - 256
For each input into the algorithm there are only a few potential concatenated nonce that can also be part of the hashing process to receive an outcome that is lower than the difficulty level. The potential of choosing the correct nonce from an increasingly large data set makes it infeasible to brute force a desired output.
Bitcoin uses the hashing algorithm called SHA-256.
The brute-force method basically means that you have to pick up a random input, hash it and then compare the output with the target hash and repeat until you find a match. It is almost impossible to brute force because SHA 256 produces a 256 bit hash, making TOO GREAT the number of random inputs to hash and compare with the output target hash, so that it would take such a long time that it doesn’t matter because it becomes basically infeasible to find the match.
1). The hashing algorithm used in Bitcoin is called SHA256
2). It is a very big number of try to break into for the right result, that it does not even make sense to try. Technically, thanks to a well done mathematical formula, even a tiny change at input gives an absolutely different result in output as a 256bit encrypted message.
1- The hashing algorithm is called secure hash algorithm SHA 256.
2- The hashing algorithm of Bitcoin is hard or almost impossible to brute - force is due to it’s difficult levels and SHA 256 bit.
H (K|X)=Y
Y is being a difficult target and the complete process is followed by proof of work which makes the puzzle difficult. The Bitcoin is limited and as time passes it becomes more & more difficult for the miners to mine due to the same reason but this also makes it more securer.
I have been corrected 
2- Due to its sheer number of outputs. it was so simple 
Hash functions don’t have anything to do with mining. Mining is the process that uses hash functions in the PoW process.
The reason SHA256 in itself is hard to brute force is due to its sheer number of possible outputs.
I was confused and was hoping for correction as I wasn’t sure. Thank you
SHA 256. (Secure Hashing Algorithm).
The algorithm has pre-image resistance. This means that given a certain output, it is infeasible to guess what the original input was due to the long timescales required to arrive at a correct guess.