Homework on Hash Functions - Questions
-
Describe hash functions with your own words
It’s an algorithm that maps data of arbitrary size to a fixed-size values.
Each hash value has to be unique and should be impossible to produce the same hash value from different inputs. -
How are hash functions used in cryptocurrencies like bitcoin? (Try to research this on your own, we will cover this later in the course but challenge yourself and see if you can find information on this already now).
Hash functions in crypto is used through mining. We’re miners are hashing all the validly signed transaction data that they accumulated by listening to the peer-to-peer network. They are also hashing a reference to the previous block in the chain as well. And lastly miners hash the random third input value, the lottery ticket if you will call it that. -
What does it mean when we say that hash functions need to be collision resistant? (We didn’t use the term “collision resistant” in the lecture, but you will easily find this on Google, we add this question intentionally to make you research information on your own, that’s how you learn best).
It should be really hard to find any random inputs that hash to the same output.