Hi George,
Thanks for your help with this!
We wrote up our high-level understanding of the current Tor guard selection
algorithm here:
https://gist.github.com/chelseakomlo/2acbe15314b5a809c6f4
This has more than our python simulation, but less than the actual Tor
implementation. For example, it
Ola Bini writes:
> Hi,
>
> Here is the next version of the algorithm - put it in a gist to make
> it easier to look at:
> https://gist.github.com/olabini/343da01de8e01491bf5c
>
> Cheers
Thanks for this.
Here we go with another review!
> The full algorithm is referred to as ALGO_CHOOSE_ENTRY_
Hi,
Here is the next version of the algorithm - put it in a gist to make
it easier to look at:
https://gist.github.com/olabini/343da01de8e01491bf5c
Cheers
--
Ola Bini (https://olabini.se)
"Yields falsehood when quined" yields falsehood when quined.
signature.asc
Description: PGP signature
Ah, good point. So, it seems N_PRIMARY_GUARDS is an argument to the algorithm.
Cheers
--
Ola Bini (https://olabini.se)
"Yields falsehood when quined" yields falsehood when quined.
signature.asc
Description: PGP signature
___
tor-dev mailing list
to
Ola Bini writes:
> Hi,
>
>> So maybe the simple answer here is that if prop247 is enabled (this could be
>> a
>> NumGuards=N argument to our algorithm), instead of always returning the first
>> reachable guard, we instead build a list of the first N reachable guards, and
>> randomly choose one o