nihilist/tor
1
0
Fork 0
mirror of https://gitlab.torproject.org/tpo/core/tor.git synced 2024-11-27 22:03:31 +01:00
Code Issues Packages Projects Releases Wiki Activity

minor doc patches

Browse Source 
svn:r212
This commit is contained in:
Roger Dingledine 2003-03-19 22:44:29 +00:00
parent b6615bc7de
commit fceb457276
3 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
doc/FAQ
View File

@ -12,7 +12,7 @@ service. Users build a layered block of asymmetric encryptions
(an "onion") which describes a source-routed path through a set of (an "onion") which describes a source-routed path through a set of
nodes. Those nodes build a "virtual circuit" through the network, in which nodes. Those nodes build a "virtual circuit" through the network, in which
each node knows its predecessor and successor, but no others. Traffic each node knows its predecessor and successor, but no others. Traffic
flowing down the circuit is unwrapped by a symmetric key at each node flowing down the circuit is unwrapped by a symmetric key at each node,
which reveals the downstream node. which reveals the downstream node.
Basically tor provides a distributed network of servers ("onion Basically tor provides a distributed network of servers ("onion

2
doc/TODO
View File

@ -25,7 +25,7 @@ NICK . Handle half-open connections
NICK - Look at what ssl does to keep from mutating data streams NICK - Look at what ssl does to keep from mutating data streams
NICK . On the fly compression of each stream NICK . On the fly compression of each stream
o Clean up the event loop (optimize and sanitize) o Clean up the event loop (optimize and sanitize)
ARMA - Remove that awful concept of 'roles' ARMA o Remove that awful concept of 'roles'
ARMA - Exit policies ARMA - Exit policies
- Spec how to write the exit policies - Spec how to write the exit policies
- Path selection algorithms - Path selection algorithms

2
doc/tor-spec.txt
View File

@ -357,7 +357,7 @@ which reveals the downstream node.
begin queueing CREATE cells for this circuit. begin queueing CREATE cells for this circuit.
Otherwise, we have a half-open circuit. If the total payload Otherwise, we have a half-open circuit. If the total payload
length of the CREATE cells for this circuit is at exactly equal length of the CREATE cells for this circuit is exactly equal
to the onion length specified in the first cell (minus 4), then to the onion length specified in the first cell (minus 4), then
process the onion. If it is more, then tear down the circuit. process the onion. If it is more, then tear down the circuit.