Without using any knowledge about how they are
computed, & only using the fact that a hash is,
in effect, a result chosen uniformly at random
from a set of results, what is the probability
that ...
So in particular, consider a collection of numbers, and for each one, choose a target uniformly at random from the same collection. So for the set X you have a function f:X->X. What is the probability that there is a fixed point x such that f(x)=x?This, by the way, is a very well known calculation/result in my area of math.
I do get a pleasant tickle from expanding that to the question of if there is any fixed point in SHA-1, but the chance for a particular value is the answer you always get for "what is the chance of a specific hash".
I am making this remark because the question reminded me of the question "If it is the 13th of the month, what is the probability that it is Friday?" (no tricks with weird calendars; you should just use the Gregorian one).
I have no idea how you might go about finding that one expected instance.
Only if there is a unique fixed point ….
frr uggcf//ra.jvxvcrqvn.bet/jvxv/Qrenatrzrag#Yvzvg_bs_engvb_bs_qrenatrzrag_gb_crezhgngvba_nf_a_nccebnpurf_.R2.88.9R
one minus derangements over permutations
see
https://en.wikipedia.org/wiki/Derangement#Limit_of_ratio_of_...
If you enjoy this stuff, you'll get a pleasant tickle out of this one:
What is the probability that there exists a SHA-1 hash which hashes to itself? In other words, are there any fixed points?
(This post was edited to fix the phrasing mistake nicely pointed out by a commenter. Originally, I asked "probability that a SHA-1" when I meant "probability that any SHA-1")