Probability for Getting Tor Descrimination
Probability of finding whether Tor is getting discriminated. I would write an analogy of what I think of the problem to be and then how would I answer it.
Analogy:
Suppose there are 4 coins. Namely, A,B,C,D.
1. The probability for choosing A is m, and it resulting in head is u.
2. The probability for choosing B is n, and it resulting in head is v.
3. The probability for choosing C is o, and it resulting in head is w.
4. The probability for choosing D is p, and it resulting in head is x.
Now,
Question: What's the probability of getting total heads?
Answer: m*u + n*v + o*w + p*x
Similarly, we replace coins with exit relays, and A being the 1st fingerprint, m being its exit probability and u being the probability of it getting discriminated.
So, https://gitlab.torproject.org/woswos/CAPTCHA-Monitor/-/blob/master/src/captchamonitor/utils/consensus_parser.py#L349 gives the exit fingerprint
and the exit probability
, and
https://gitlab.torproject.org/woswos/CAPTCHA-Monitor/-/blob/fb104fca827df309606f18febe902bfaa6ccd9bb/src/captchamonitor/dashboard/render_dashboard.py#L302-306 gives the probability of the relay fingerprint getting discriminated.
So, for easier access, can we save it to the Relay table and then calculate the probability using the formula: relay.exit_probability x relay.discriminated_probability
for the specific relay.
Does it sound correct to you? @woswos
cc: @gk