diff options
| author | Roger Dingledine <arma@torproject.org> | 2007-05-31 03:47:41 +0000 |
|---|---|---|
| committer | Roger Dingledine <arma@torproject.org> | 2007-05-31 03:47:41 +0000 |
| commit | b4fbe0b7e3af5470e58871faa0bb80baa38cd432 (patch) | |
| tree | 21e614020013f8c075f77aeea67935e33f531604 | |
| parent | 07ed34aadbbccc78db55c2adace9792021945232 (diff) | |
| download | tor-b4fbe0b7e3af5470e58871faa0bb80baa38cd432.tar.gz tor-b4fbe0b7e3af5470e58871faa0bb80baa38cd432.zip | |
clean up a few confusions brian levine pointed out
svn:r10415
| -rw-r--r-- | doc/spec/path-spec.txt | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/doc/spec/path-spec.txt b/doc/spec/path-spec.txt index 87a7567e81..01a2687234 100644 --- a/doc/spec/path-spec.txt +++ b/doc/spec/path-spec.txt @@ -316,9 +316,10 @@ of their choices. probability (N-C)/N of choosing a good entry and not being profiled. When guard nodes are enabled, Tor maintains an ordered list of entry nodes - as our chosen guards, and store this list persistently to disk. If a Guard + as our chosen guards, and stores this list persistently to disk. If a Guard node becomes unusable, rather than replacing it, Tor adds new guards to the - end of the list. When it comes time to choose an entry, Tor chooses at + end of the list. When choosing the first hop of a circuit, Tor + chooses at random from among the first NumEntryGuards (default 3) usable guards on the list. If there are not at least 2 usable guards on the list, Tor adds routers until there are, or until there are no more usable routers to add. |