Hello,
I've a question regarding task 3e) (question 17) from homework no. 3. There is asked for the leaf and node hashed we need for an audit proof of a certain certificate.
In the lecture, we always talked about the leaf and node hashes which are needed to calculate all other node hashes. Now, one can argue that the computable hashes are required as well.
What is the right interpretation of the question? Do you want only the nodes which one cannot calculate or all nodes which are used within the proof?
Thank you for your answers.