diff options
| author | junglefowl <junglefowl@riseup.net> | 2015-11-01 23:36:36 +0000 |
|---|---|---|
| committer | Isis Lovecruft <isis@torproject.org> | 2015-11-01 23:36:36 +0000 |
| commit | 3673092cc69460b06a386a1aa638dec686b4c233 (patch) | |
| tree | 4529a5c21f4765670488c480747974bb237c873b /proposals/259-guard-selection.txt | |
| parent | 57abce5e6360ea6e39e39ab44de28958a33f68d3 (diff) | |
| download | torspec-3673092cc69460b06a386a1aa638dec686b4c233.tar.gz torspec-3673092cc69460b06a386a1aa638dec686b4c233.zip | |
Fix three typos in prop#259.
Diffstat (limited to 'proposals/259-guard-selection.txt')
| -rw-r--r-- | proposals/259-guard-selection.txt | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/proposals/259-guard-selection.txt b/proposals/259-guard-selection.txt index 08d18db..bb5e81c 100644 --- a/proposals/259-guard-selection.txt +++ b/proposals/259-guard-selection.txt @@ -10,7 +10,7 @@ Extends: 241-suspicious-guard-turnover.txt In addition to the concerns regarding path bias attacks, namely that the space from which guards are selected by some specific client should not - consist of the entirely of nodes with the Guard flag (cf. §1 of proposal + consist of the entirety of nodes with the Guard flag (cf. §1 of proposal #247), several additional concerns with respect to guard selection behaviour remain. This proposal outlines a new entry guard selection algorithm, which additionally addresses the following concerns: @@ -128,7 +128,7 @@ Extends: 241-suspicious-guard-turnover.txt There are currently 1600 guards in the network. We allow the user to attempt 80 of them before failing (5% of the guards). With regards to filternet reachability, there are 450 guards on ports 80 or 443, so the - probability of picking such a guard guard here should be high. + probability of picking such a guard here should be high. This logic is not based on bandwidth, but rather on the number of relays which possess the Guard flag. This is for three reasons: First, @@ -231,7 +231,7 @@ Extends: 241-suspicious-guard-turnover.txt continuing up to and including the Xth byte, such that the returned sub-array is X bytes in length. - INSERT is an algorithm for inserting items into the hashring, - - TOINT convert hexadecimal to decimal integers, + - TOINT converts hexadecimal to decimal integers, For routers A and B, where B has a little bit more bandwidth than A, this gets you a hashring which looks like this: |