From greg at electricrain.com Fri Nov 9 16:08:01 2001 From: greg at electricrain.com (Gregory P. Smith) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] Fwd: Stanford Networking Seminar, Thu 11/15, Eugene Ng Message-ID: <20011109160752.D20908@zot.electricrain.com> Here's an upcoming talk that may be of interest to anyone in the sf bay area: ----- Forwarded message from Emre Kiciman ----- Date: Thu, 8 Nov 2001 22:13:31 -0800 (PST) From: Emre Kiciman Reply-To: Emre Kiciman To: netseminar@lists.Stanford.EDU, colloq@CS.Stanford.EDU Subject: Stanford Networking Seminar, Thu 11/15, Eugene Ng Stanford Networking Seminar When: 12:45PM, Thursday, November 15th, 2001 Where: Room 104, Gates Computer Science Building URL: http://netseminar.stanford.edu/sessions/2001-11-15.html ----------------------------------------------------------------- Title: Global Network Positioning: A New Approach to Internet Network Distance Prediction Speaker: T.S. Eugene Ng Carnegie Mellon University Abstract: To optimize the performance of large-scale distributed applications such as Napster or Gnutella file sharing and end system multicast, one must know the performance of a large number of underlying network paths. Although active network measurement can accurately determine network performance, it suffers from scalability and timeliness limitations. We believe the ability to accurately predict network distance (round-trip transmission and propagation delay) without active measurement is a fundamental building block in enabling scalable, fast, and effective performance optimization in such large-scale distributed applications In this talk, I will present a new approach to predict Internet network distance called Global Network Positioning (GNP). The key idea is to model the Internet as a geometric space (e.g. a 3-dimensional Euclidean space) and distributedly compute geometric coordinates to characterize the positions of hosts in the Internet. The modeled geometric distances between hosts are then used to predict the network distances. I will contrast GNP to the state-of-the-art network distance prediction approach called IDMaps and argue that GNP is more scalable and more nimble. I will also discuss a variety of technical issues in GNP such as what geometric space model fits the Internet well. Through Internet experiments, I will show that the geometric distances implied by the GNP host coordinates can accurately predict Internet network distances Bio: T.S. Eugene Ng is a Ph.D. student in Computer Science at Carnegie Mellon University. His current research focuses on scalable Internet network performance prediction and studying its benefits to a variety of applications Notes: Lunch will be available at 12:15. A vegetarian selection will be available. No drinks will be provided. The talk itself will begin at 12:45 +----------------------------------------------------------------------------+ | This message was sent via the Stanford Computer Science Department | | colloquium mailing list. To be added to this list send an arbitrary | | message to colloq-subscribe@cs.stanford.edu. To be removed from this list,| | send a message to colloq-unsubscribe@cs.stanford.edu. For more information,| | send an arbitrary message to colloq-request@cs.stanford.edu. For directions| | to Stanford, check out http://www-forum.stanford.edu | +-------------------------------------------------------------------------xcl+ ----- End forwarded message ----- From sam at neurogrid.com Fri Nov 9 18:03:01 2001 From: sam at neurogrid.com (Sam Joseph) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] Fwd: Stanford Networking Seminar, Thu 11/15, Eugene Ng References: <20011109160752.D20908@zot.electricrain.com> Message-ID: <3BEC8A5F.5C9BCADF@neurogrid.com> Here's another bay area talk that may be of interest. It's entitled "NeuroGrid: Learning to Search the Internet", but we could call it "Neural Methods of Relevance Feedback and the Application in P2P Networks". http://www-csli.stanford.edu/cll/fall01/Joseph.html Monday, November 12 Time: 4:15-5:30PM Place: Cordura 100 NeuroGrid: Learning to Search the Internet Sam Joseph Ph.D. NeuroGrid Consulting sam@neurogrid.com As the number of web pages expands, companies with search engines, such as Google, employ increasingly large clusters of computers to store a database of what pages are where. This degree of centralization lets the firm maintain control over its data and filter the content for inappropriate material. However, the approach cannot scale up indefinitely, and it makes it impractical to provide users with a personalized view of the data. Decentralized search systems can address these issues. For example, Napster distributes content over the internet but centralizes the search index. Recent Peer-to-Peer (P2P) systems such as Gnutella, Freenet and MojoNation have shown that even the search index can be distributed, but with mixed results in terms of searchability, i.e. search is time-consuming, or produces results based on heterogeneous matching criteria which lead to low search precision. NeuroGrid is a decentralized, P2P search system that adds personalization while improving searchability. It lets users turn their bookmarks into their own Yahoo-like search engines, and it learns how to route queries between these personalized search engines in order increase search effectiveness. This talk will focus on how the NeuroGrid learning process helps users organize their data, and provide relevant meta-data that can help bootstrap more precise search within a distributed environment. "Gregory P. Smith" wrote: > Here's an upcoming talk that may be of interest to anyone in the sf > bay area: > > ----- Forwarded message from Emre Kiciman ----- > > Date: Thu, 8 Nov 2001 22:13:31 -0800 (PST) > From: Emre Kiciman > Reply-To: Emre Kiciman > To: netseminar@lists.Stanford.EDU, colloq@CS.Stanford.EDU > Subject: Stanford Networking Seminar, Thu 11/15, Eugene Ng > > Stanford Networking Seminar From bram at gawth.com Sun Nov 11 19:59:01 2001 From: bram at gawth.com (Bram Cohen) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] san francisco Message-ID: I'm considering having a p2p-hackers meeting at my house in san francisco, if enough people are around. So speak up, who here is from the bay area? -Bram Cohen "Markets can remain irrational longer than you can remain solvent" -- John Maynard Keynes From bram at gawth.com Mon Nov 12 02:29:01 2001 From: bram at gawth.com (Bram Cohen) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] blanubot quoting code Message-ID: For those of you who don't know, there's a nifty bot on #infoanarchy which puts the urls everyone says up at http://blanu.net/infoanarchy.html We were discussing better commenting rules for it earlier today, and I've got code for it worked out now, and since I don't know cherub or look's email address, I'm just posting it here - import re import cgi def bolden(s): s = cgi.escape(s) s = re.sub(r'(^_?|\s_?)\*(\S|\S.*?\S)\*(?=_?\s|_?\Z)', r'\1\2', s) s = re.sub(r'(^|\s|)_(\S|\S.*?\S)_(?=\s|\Z|)', r'\1\2', s) s = re.sub(r'(^|\s)(http://\S+|www.\S+|\S+.com' + \ '|\S+.org|\S+.net)(?=\s|\Z)', r'\1\2', s) return s It quotes out html special characters, and uses * as a bold symbol and _ as italics symbols. I got rid of / as an italics symbol because it would make /usr/bin/ get italicised, although notably using * as a bold symbol wil make 'a ** b < c ** d' act funny. Some example of it's use - >>> bolden('*this* is a * *st**pid* *test*') 'this is a * st**pid test' >>> bolden('if a < b then c < d, as shown at spam.com') 'if a < b then c < d, as shown at spam.com' >>> bolden('_*both* bold *and* italic are possible_') 'both bold and italic are possible' -Bram Cohen "Markets can remain irrational longer than you can remain solvent" -- John Maynard Keynes From sah at thalassocracy.org Mon Nov 12 11:00:01 2001 From: sah at thalassocracy.org (Steven Hazel) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] blanubot quoting code In-Reply-To: (Bram Cohen's message of "Mon, 12 Nov 2001 02:28:08 -0800 (PST)") References: Message-ID: <87pu6nlski.fsf@azrael.dyn.cheapnet.net> Bram Cohen writes: > For those of you who don't know, there's a nifty bot on #infoanarchy which > puts the urls everyone says up at > > http://blanu.net/infoanarchy.html > > We were discussing better commenting rules for it earlier today, and I've > got code for it worked out now, and since I don't know cherub or look's > email address, I'm just posting it here - I've switched blanubot to use your code. And now you have my email address. -- Steven Hazel work: sah@audiogalaxy.com other: sah@thalassocracy.org From sam at neurogrid.com Wed Nov 14 16:28:02 2001 From: sam at neurogrid.com (Sam Joseph) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] P2P Simulation Applet Message-ID: <3BF30B9B.CE12A0C@neurogrid.com> Hi All, Good to meet many of you at the O'Reilly conference. Hope to stay in touch. I think that probably many of you got information about the P2P simulation applet I created through either the Freenet or Gnutella lists, but I thought I'd mail here for anybody not on those lists. Also I just added a much needed explanation page, and updated the applet so that the network can grow over time. The basic point of the simulation is to allow one to simulate different P2P networks routing methodology such as Gnutella, NeuroGrid and Freenet. The applet GUI only supports Gnutella and NeuroGrid at the moment, since my Freenet implementation used HashSets and stuff not supported by the MVM - and thus IE browsers. The Freenet simulation can be obtained along with the full source code download at sourceforge http://sourceforge.net/projects/neurogrid/ However, if you want to get a feel for the system without lots of download hassle, check out: http://www.neurogrid.net/applet.html It will run in many IE and NN browsers. I know we've had some problems with Mac based browsers and Mozilla. It's still not clear exactly what the problem is. Any help with browser compatibility issues will be greatly appreciated. Instructions are at: http://www.neurogrid.net/applet_explanation.html CHEERS> SAM p.s. Scott & Oscar> I heard good things about your simulation talk - are your visualization tools available open source? From oskar at freenetproject.org Wed Nov 14 23:12:02 2001 From: oskar at freenetproject.org (Oskar Sandberg) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] P2P Simulation Applet In-Reply-To: <3BF30B9B.CE12A0C@neurogrid.com>; from sam@neurogrid.com on Thu, Nov 15, 2001 at 09:26:03AM +0900 References: <3BF30B9B.CE12A0C@neurogrid.com> Message-ID: <20011115074109.S24989@sandbergs.org> On Thu, Nov 15, 2001 at 09:26:03AM +0900, Sam Joseph wrote: <> > p.s. Scott & Oscar> I heard good things about your simulation talk - are > your visualization tools available open source? Everything is in the Freenet CVS, though the only visualization tool of note was gnuplot... > > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers -- Oskar Sandberg oskar@freenetproject.org From sam at neurogrid.com Wed Nov 14 23:19:01 2001 From: sam at neurogrid.com (Sam Joseph) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] P2P Simulation Applet References: <3BF30B9B.CE12A0C@neurogrid.com> <20011115074109.S24989@sandbergs.org> Message-ID: <3BF36BE5.858EB7E7@neurogrid.com> Oskar Sandberg wrote: > On Thu, Nov 15, 2001 at 09:26:03AM +0900, Sam Joseph wrote: > <> > > p.s. Scott & Oscar> I heard good things about your simulation talk - are > > your visualization tools available open source? > > Everything is in the Freenet CVS, though the only visualization tool of > note was gnuplot... Thanks Oscar. I'll check it out. Do you have any screen shots using gnuplot? The only reason I ask was that I unfortunately missed your talk and Lada Adamic was saying that you managed to represent the changing structure of the freenet filespace really well using colour and size of nodes etc. I was interested in getting a look at that myself. No worries if it's not available. CHEERS> SAM From gojomo at usa.net Thu Nov 15 00:29:01 2001 From: gojomo at usa.net (Gordon Mohr) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] san francisco References: Message-ID: <019a01c16daf$76c45fd0$c6efa4d8@golden> > So speak up, who here is from the bay area? Me! - Gojomo ____________________ Gordon Mohr, gojomo@ bitzi.com, Bitzi CTO _ http://bitzi.com _ From oskar at freenetproject.org Thu Nov 15 00:34:01 2001 From: oskar at freenetproject.org (Oskar Sandberg) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] P2P Simulation Applet In-Reply-To: <3BF36BE5.858EB7E7@neurogrid.com>; from sam@neurogrid.com on Thu, Nov 15, 2001 at 04:16:53PM +0900 References: <3BF30B9B.CE12A0C@neurogrid.com> <20011115074109.S24989@sandbergs.org> <3BF36BE5.858EB7E7@neurogrid.com> Message-ID: <20011115085332.T24989@sandbergs.org> On Thu, Nov 15, 2001 at 04:16:53PM +0900, Sam Joseph wrote: > Oskar Sandberg wrote: > > > On Thu, Nov 15, 2001 at 09:26:03AM +0900, Sam Joseph wrote: > > <> > > > p.s. Scott & Oscar> I heard good things about your simulation talk - are > > > your visualization tools available open source? > > > > Everything is in the Freenet CVS, though the only visualization tool of > > note was gnuplot... > > Thanks Oscar. I'll check it out. Do you have any screen shots using gnuplot? Scott was going to publish the slides I believe. > The only reason I ask was that I unfortunately missed your talk and Lada > Adamic was saying that you managed to represent the changing structure of the > freenet filespace really well using colour and size of nodes etc. I was > interested in getting a look at that myself. Ok, that was the other thing I did, which was mapping the nodes against a 2D space, and trying to make a symbolic map of their relation to one another. The results look like this for a somewhat mature Freenet: http://www.student.nada.kth.se/~md98-osa/freenetmap.png (dots are notes, size indicates traffic, color the average keyvalue of the datastore, and relative position should indicate how much communication there is between the nodes.) The reason I don't really think this is of note, is that while they were fitting for an O'Reilly conference :-), I don't think those pictures are too relevant. The problem is that to move nodes that talk often closer to one another, I would move nodes toward one another when they talked, but then to keep the whole thing from just collapsing into the center I had to implement a divergence as well. Lacking a better solution, I just kept a running count of the "center of mass" and moved nodes radially away from that with time (with speed inversely proportional to the distance). This is the reason why you see the two clusters that balance each other out on the example above - the fact that they show different colors (average key values) is clearly not artificial, but the fact that there are two clusters rather than an even spread definitely is. Calculating the gravity as coming from the center of mass only works if you are outside the object... The correct thing to do, I suppose, would be define a negative gravity between the nodes and then set up and solve an equation system every time the divergence is calculated - but that would be a system in several thousand unknowns. Any other ideas are welcome (though by the looks of it people who enjoy this more than me have already written tons of simulator visualization stuff...) > No worries if it's not available. It's all in Serapis/map in the Freenet CVS. Even besides the above though, it is very primitive (you have manually tweek the constants for different simulations). As a matter of principle, I would never write a piece of software and not make it available. The whole idea is foreign to me. > > CHEERS> SAM > > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers -- Oskar Sandberg oskar@freenetproject.org From zooko at zooko.com Thu Nov 15 04:13:01 2001 From: zooko at zooko.com (Zooko) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] visualization (was: P2P Simulation Applet) In-Reply-To: Message from Oskar Sandberg of "Thu, 15 Nov 2001 08:53:32 +0100." <20011115085332.T24989@sandbergs.org> References: <3BF30B9B.CE12A0C@neurogrid.com> <20011115074109.S24989@sandbergs.org> <3BF36BE5.858EB7E7@neurogrid.com> <20011115085332.T24989@sandbergs.org> Message-ID: Check out "gnutellavision": http://bailando.sims.berkeley.edu/infovis.html It offers interactive exploration of graphs with radial layout. There are some beautiful movies available for download. (It's also written by some friends of mine.) Regards, Zooko From gojomo at usa.net Fri Nov 16 16:44:01 2001 From: gojomo at usa.net (Gordon Mohr) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] San Fran P2Pers: Bitzi "Hibernation Party" - Tue Nov 20 6pm @Jillian's References: <3BF30B9B.CE12A0C@neurogrid.com> <20011115074109.S24989@sandbergs.org> <3BF36BE5.858EB7E7@neurogrid.com> <20011115085332.T24989@sandbergs.org> Message-ID: <065e01c16f00$cdbc2ff0$c6efa4d8@golden> Yo fellow P2P-hackers! It's not a launch party. It's not a pink slip party. It's the first startup hibernation party! Come celebrate with Bitzi, the cooperative file catalog, as we dedicate ourselves to continuing our company on a "hibernation" budget. No free drinks, no free schwag, no networking-event door fee. Become one with the cheapness of it all and just wander in. Everyone's invited. @Jillian's San Francisco, Tuesday November 20, 6pm - 9pm. More details in our tongue-in-cheek press release, at: http://bitzi.com/about/releases/2001-11-16-hibernation Hope to see you there! - Gordon ____________________ Gordon Mohr, gojomo@ bitzi.com, Bitzi CTO _ http://bitzi.com _ From burton at openprivacy.org Sat Nov 17 21:04:01 2001 From: burton at openprivacy.org (Kevin A. Burton) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] san francisco In-Reply-To: References: Message-ID: <87g07cvfpj.fsf@universe.yi.org> -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Bram Cohen writes: > I'm considering having a p2p-hackers meeting at my house in san francisco, > if enough people are around. > > So speak up, who here is from the bay area? Me too. Would love to meet. Kevin - -- Kevin A. Burton ( burton@apache.org, burton@openprivacy.org, burtonator@acm.org ) Location - San Francisco, CA, Cell - 415.595.9965 Jabber - burtonator@jabber.org, Web - http://relativity.yi.org/ The 9000 series is the most reliable computer ever made. No 9000 computer has ever made a mistake or distorted information. We are all, by any practical definition of the words, fool proof and incapable of error. - Hal -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.6 (GNU/Linux) Comment: Get my public key at: http://relativity.yi.org/pgpkey.txt iD8DBQE79z+4AwM6xb2dfE0RAp4jAKCP0+IQngYjzQ8kUjWIKoLqPxfJtQCeNQ8e etwHzGKGAJ5Ud3AxHNDQQ58= =b1XG -----END PGP SIGNATURE----- From burton at openprivacy.org Sat Nov 17 22:08:01 2001 From: burton at openprivacy.org (Kevin A. Burton) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] San Fran P2Pers: Bitzi "Hibernation Party" - Tue Nov 20 6pm @Jillian's In-Reply-To: <065e01c16f00$cdbc2ff0$c6efa4d8@golden> References: <3BF30B9B.CE12A0C@neurogrid.com> <20011115074109.S24989@sandbergs.org> <3BF36BE5.858EB7E7@neurogrid.com> <20011115085332.T24989@sandbergs.org> <065e01c16f00$cdbc2ff0$c6efa4d8@golden> Message-ID: <877ksovfgx.fsf@universe.yi.org> -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 "Gordon Mohr" writes: > Yo fellow P2P-hackers! > > It's not a launch party. It's not a pink slip party. > > It's the first startup hibernation party! ha > @Jillian's San Francisco, Tuesday November 20, 6pm - 9pm. More details in our > tongue-in-cheek press release, at: > > http://bitzi.com/about/releases/2001-11-16-hibernation See you there. Sounds fun. We (openprivacy) should have done the hibernation party thing. It is a good idea :) Kevin - -- Kevin A. Burton ( burton@apache.org, burton@openprivacy.org, burtonator@acm.org ) Location - San Francisco, CA, Cell - 415.595.9965 Jabber - burtonator@jabber.org, Web - http://relativity.yi.org/ Questions are the beginning of wisdom. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.6 (GNU/Linux) Comment: Get my public key at: http://relativity.yi.org/pgpkey.txt iD8DBQE790DuAwM6xb2dfE0RAoF/AKDAcUHU4ZI7C1oqOcGPG/mohpZZbACgm/yk vhodqyzEn5TlCHw4ikr2KIo= =aGyJ -----END PGP SIGNATURE----- From dnm at pobox.com Mon Nov 26 00:03:02 2001 From: dnm at pobox.com (Dan Moniz) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] Fling Message-ID: Hey people, Has anyone else looked at this: ? I just found it by accident when reading some totally unrelated conversation messages on Slashdot, normally an activity I don't condone in the slightest. I'm reading through the available material now, I was just wondering if anyone else has already done so and had commentary to offer. -- Dan Moniz [http://www.pobox.com/~dnm/] From burton at openprivacy.org Tue Nov 27 17:15:02 2001 From: burton at openprivacy.org (Kevin A. Burton) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] Fling In-Reply-To: References: Message-ID: <87n117g0sl.fsf@universe.yi.org> -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Dan Moniz writes: > Hey people, > > Has anyone else looked at this: ? I > just found it by accident when reading some totally unrelated conversation > messages on Slashdot, normally an activity I don't condone in the slightest. > I'm reading through the available material now, I was just wondering if > anyone else has already done so and had commentary to offer. // I've designed and am building Fling because of my passionate conviction that // freedom is a good thing. Fling is deliberately designed to protect: // // * Porn and the sex trade // * Online casinos // * Political dissidents // * Unpopular opinions // * Discussions of abortion, HIV, homosexuality, yadda yadda // * Free (libre) online traders answerable only to TrustGuarantors // * Sale of government-disapproved goods // * E-cash transactions that leave no "paper trail" // * Anyone whose rights are being ignored or legislated away Hm... Why didn't he include Terrorists??? - -- Kevin A. Burton ( burton@apache.org, burton@openprivacy.org, burtonator@acm.org ) Location - San Francisco, CA, Cell - 415.595.9965 Jabber - burtonator@jabber.org, Web - http://relativity.yi.org/ Linux is kind of like UNIX but it isn't as expensive, isn't fragmented across multiple vendor, doesn't restrict your Freedom, and is just infinitely more pleasant. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.6 (GNU/Linux) Comment: Get my public key at: http://relativity.yi.org/pgpkey.txt iD8DBQE8BDj6AwM6xb2dfE0RArmGAJ48zjVS92uhmSyNwnakSJKqGFgL1QCfeQPM YvW2AbsNmbmtutyF8N9gnqo= =ZvSi -----END PGP SIGNATURE----- From oskar at freenetproject.org Tue Nov 27 18:49:01 2001 From: oskar at freenetproject.org (Oskar Sandberg) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] Fling In-Reply-To: <87n117g0sl.fsf@universe.yi.org>; from burton@openprivacy.org on Tue, Nov 27, 2001 at 05:08:54PM -0800 References: <87n117g0sl.fsf@universe.yi.org> Message-ID: <20011128034819.G2486@sandbergs.org> On Tue, Nov 27, 2001 at 05:08:54PM -0800, Kevin A. Burton wrote: > // I've designed and am building Fling because of my passionate conviction that > // freedom is a good thing. Fling is deliberately designed to protect: > // > // * Porn and the sex trade > // * Online casinos > // * Political dissidents > // * Unpopular opinions > // * Discussions of abortion, HIV, homosexuality, yadda yadda > // * Free (libre) online traders answerable only to TrustGuarantors > // * Sale of government-disapproved goods > // * E-cash transactions that leave no "paper trail" > // * Anyone whose rights are being ignored or legislated away > > Hm... Why didn't he include Terrorists??? I don't suppose that anonymous publishing networks are that useful for terrorists - they would be more interested in covert point to point communication, at least as long as Al Jazeera is still broadcasting... -- Oskar Sandberg oskar@freenetproject.org From gojomo at usa.net Tue Nov 27 22:30:02 2001 From: gojomo at usa.net (Gordon Mohr) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] Fling References: <87n117g0sl.fsf@universe.yi.org> <20011128034819.G2486@sandbergs.org> Message-ID: <016101c177d5$f2a19660$c6efa4d8@golden> > I don't suppose that anonymous publishing networks are that useful for > terrorists - they would be more interested in covert point to point > communication, at least as long as Al Jazeera is still broadcasting... Anonymous publishing on any interesting scale enables covert point-to-point communication as a trivial application. - Gojomo From arma at mit.edu Tue Nov 27 22:36:01 2001 From: arma at mit.edu (Roger Dingledine) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] Fling In-Reply-To: <016101c177d5$f2a19660$c6efa4d8@golden>; from gojomo@usa.net on Tue, Nov 27, 2001 at 10:28:51PM -0800 References: <87n117g0sl.fsf@universe.yi.org> <20011128034819.G2486@sandbergs.org> <016101c177d5$f2a19660$c6efa4d8@golden> Message-ID: <20011128013504.N27051@seul.org> On Tue, Nov 27, 2001 at 10:28:51PM -0800, Gordon Mohr wrote: > > I don't suppose that anonymous publishing networks are that useful for > > terrorists - they would be more interested in covert point to point > > communication, at least as long as Al Jazeera is still broadcasting... > > Anonymous publishing on any interesting scale enables covert > point-to-point communication as a trivial application. While we're doing witty but insightful one-liners... Publishing services which provide publisher anonymity against a curious server require a secure anonymous communications channel. (So maybe it's even more trivial than you suggested. The general argument is that the *publishing* service would not be the most convenient means of communication for such people.) --Roger From gohnesorge at lh-computertechnik.de Thu Nov 29 22:31:10 2001 From: gohnesorge at lh-computertechnik.de (g'o'tz ohnesorge) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] blanubot quoting code Message-ID: <3C07273A.6E351ABC@lh-computertechnik.de> Bram Cohen wrote: > For those of you who don't know, there's a nifty bot on #infoanarchy which > puts the urls everyone says up at > > http://blanu.net/infoanarchy.html > > We were discussing better commenting rules for it earlier today, and I've > got code for it worked out now, and since I don't know cherub or look's > email address, I'm just posting it here - > > import re > import cgi > > def bolden(s): > s = cgi.escape(s) > s = re.sub(r'(^_?|\s_?)\*(\S|\S.*?\S)\*(?=_?\s|_?\Z)', > r'\1\2', s) > s = re.sub(r'(^|\s|)_(\S|\S.*?\S)_(?=\s|\Z|)', > r'\1\2', s) > s = re.sub(r'(^|\s)(http://\S+|www.\S+|\S+.com' + \ > '|\S+.org|\S+.net)(?=\s|\Z)', r'\1\2', s) > return s I don't know a word of Perl (is it even?), but the above looks a slight bit as if you assume that all DNS addresses must always end either .com , .org , or .net . Not quite true, and much interesting stuff even hangs around .mil , .cx , .jp , and many others. Can you recode to capture everything that's got a . (dot) with neither a space nor another dot to both of its sides? Then you might capture the occasional useless lastword.firstword between sentences, but to me that sounds better than automatically missing all non.com|org|net URLs. That way, you'd also grab 123.45.6.7 style numeric IP numbers. Leaves only decimal IPs out then (M$ Internet Explorer can use the decimal translation 68883448235 of the 32 bits of 123.45.6.7 , maybe some other browsers, too; I've heard th at some also don't, expecially on alternative platforms; the issue was once described as a security hole, exploited by some spammers to go through company workplace surf-filters). From gohnesorge at lh-computertechnik.de Thu Nov 29 22:31:11 2001 From: gohnesorge at lh-computertechnik.de (g'o'tz ohnesorge) Date: Sat Dec 9 22:11:43 2006 Subject: [p2p-hackers] Fling Message-ID: <3C072782.DE59A1F2@lh-computertechnik.de> Roger Dingledine wrote: > Publishing services which provide publisher anonymity against a curious > server require a secure anonymous communications channel. > > (So maybe it's even more trivial than you suggested. The general argument > is that the *publishing* service would not be the most convenient means > of communication for such people.) I may be totally missing the point, but http://www.htthost.com offers a free client and server for making an encrypted tunnel to a proxy. Someone with access to all logfiles (especially whatIP addresses any given server communicated with, as mandated by recent laws in several European countries) would still figure out a single-step link, but you could still try to chain multiple such tunnels, possibly through "public", shared servers, to better hide yourself in the group.