Tor 0.2.2.32, the first stable release in the 0.2.2 branch, is finally
ready. More than two years in the making, this release features improved
client performance and hidden service reliability, better compatibility
for Android, correct behavior for bridges that listen on more than
one address, more extensible and flexible directory object handling,
better reporting of network statistics, improved code security, and
many many other features and bugfixes.
Based on maintainer update request via PR 41828.
(remove patch-a{a,b} and make to simplify by me).
Tor 0.2.1.18 lays the foundations for performance improvements, adds
status events to help users diagnose bootstrap problems, adds optional
authentication/authorization for hidden services, fixes a variety of
potential anonymity problems, and includes a huge pile of other features
and bug fixes.
Tor 0.2.1.19 fixes a major bug with accessing and providing hidden
services.
Thanks to athaba, netcap, and tvierling.
Changes in version 0.2.0.30 - 2008-07-15
This new stable release switches to a more efficient directory
distribution design, adds features to make connections to the Tor
network harder to block, allows Tor to act as a DNS proxy, adds separate
rate limiting for relayed traffic to make it easier for clients to
become relays, fix a variety of potential anonymity problems, and
includes the usual huge pile of other features and bug fixes.
- maintainer -> tv
Changes (summary):
some major security fixes, including entry guards to protect the
beginning of the circuit, exit enclaves to protect the end, and better
firewall support; a new directory protocol that improves bandwidth use
and keeps clients more up to date; two new directory authorities;
a new ascii-based controller protocol that lets people easily write
applications to interact with Tor; and
many scalability and performance improvements
Full changes available at
http://archives.seul.org/or/announce/May-2006/msg00000.html:
And always is defined as share/examples/rc.d
which was the default before.
This rc.d scripts are not automatically added to PLISTs now also.
So add to each corresponding PLIST as required.
This was discussed on tech-pkg in late January and late April.
Todo: remove the RCD_SCRIPTS_EXAMPLEDIR uses in MESSAGES and elsewhere
and remove the RCD_SCRIPTS_EXAMPLEDIR itself.
pkgsrc changes:
- depend on tsocks to allow torification of other applications
- create a user for this application to run as
- install a suitable rc script
ChangeLog says:
o Bugfixes on 0.0.9:
- Fix an assert bug that took down most of our servers: when
a server claims to have 500 GB of bandwidthburst, don't
freak out.
- Don't crash as badly if we have spawned the max allowed number
of dnsworkers, or we're out of file descriptors.
- Block more file-sharing ports in the default exit policy.
- MaxConn is now automatically set to the hard limit of max
file descriptors we're allowed (ulimit -n), minus a few for
logs, etc.
- Give a clearer message when servers need to raise their
ulimit -n when they start running out of file descriptors.
- SGI Compatibility patches from Jan Schaumann.
- Tolerate a corrupt cached directory better.
- When a dirserver hasn't approved your server, list which one.
- Go into soft hibernation after 95% of the bandwidth is used,
not 99%. This is especially important for daily hibernators who
have a small accounting max. Hopefully it will result in fewer
cut connections when the hard hibernation starts.
- Load-balance better when using servers that claim more than
800kB/s of capacity.
- Make NT services work (experimental, only used if compiled in).
The simple version: Tor provides a distributed network of servers ("onion
routers"). Users bounce their TCP streams (web traffic, FTP, SSH, etc.) around
the routers. This makes it hard for recipients, observers, and even the onion
routers themselves to track the source of the stream.
The complex version: Onion Routing is a connection-oriented anonymizing
communication service. Users choose a source-routed path through a set of
nodes, and negotiate a "virtual circuit" through the network, in which each
node knows its predecessor and successor, but no others. Traffic flowing down
the circuit is unwrapped by a symmetric key at each node, which reveals the
downstream node.
