forum.i2p ~ View topic - About specification bit-torrent protocol for i2p

I2Phile Joined: 09 Mar 2010 Posts: 298 Location: Russia

Good day, dear.

The situation is complicated by poor knowledge of spoken English, because I write through the google translator - I hope you will understand what I meant to say Smile

In general, what is required.

Recently I started studying anonser of tracker bytemoonsoon, mostly with the research purpose, as well as to determine the possibility of adapting existing torrent engines (as TorrentPier etc) under i2p. Exactly, I tried to understand the protocol specification bit-torrent for I2P. So, I was very surprised when I saw that in anonsere not used BASE64 address of the tunnel, but there is a suspicious peer_id to 20 characters. The fact is that unless you use the address of tunnels, in what way then it searches feasts each other? How could I see them transferred to 20 characters, which make up this peer_id. Search and share files, if I correctly understood is exactly on it? I'd like, at least one eye to see the protocol specification data bit-torrent for i2p. In particular it clear - the client's needs to find other peers, neighbors.

The ideal answer is a link to a page of documentation, which describes the bit-torrent protocol over i2p, because I just could not find it on the official site i2p2.de. However, I want to believe that everything is, but I just watched it:)

Yes, and at the same time ... Maybe someone know where you can find .po files for Robert? Since in supply is in English only in the compiled .mo file, and Poedit they do not perceive. And without that the Russian language program will be difficult to translate Smile

P.S. It's not that it represents a peer_id - as far as I could tell from the protocol specifications - it is the client identifier, which includes the type of the client. The question is about something else - like from the information given by anonser, client understands - where to look for other peers, and how they communicate.

Take a look at http://echelon.i2p
This site stores i2p applications, sources and documentation.
Maybe this helps you.

I2Phile Joined: 10 May 2005 Posts: 453

It is a great suggestion, sorry there is no spec documented now.

If somebody wants to make one, volunteer on http://trac.i2p2.i2p/wiki/specs

The easiest is to look at the source of a client or tracker, or even easier, just look at the HTTP GET parameters for the tracker announce, and look at the bencoded reply.

My list of tracker features may also help: http://zzz.i2p/files/trackers.html

I2Phile Joined: 09 Mar 2010 Posts: 298 Location: Russia

Thank you!

So, in the I2P not only bytemoonsoon engine work? I probably do not quite understand the specifics protocol under I2P - instead of a pair of ip:port must be transmitted BASE64 ID? Find a managed just bytemoonsoon, slightly rewritten anonser, introduced bencode functions and more - in a separate object, corrected some of the possible security problems, now gradually write a new .torrent loader...

Also, there is very good and familiar to many in Russia engine - torrent pier ... But - I very much doubt that he will work in I2P correctly, because focused on the use of IP addresses ... If it were possible to adapt it - then the functional would be much better than you can write alone. But for this we need to clearly understand how the bittorrent protocol works in i2p.

By the way, may be you know - Is the source available, well, or at least a description of the protocol of the same Robert? After all of this can be a more or less clear understanding of how the protocol works for both sides: the server and client.

I2Phile Joined: 10 May 2005 Posts: 453

All the trackers listed on my torrent features chart work on i2p - 4 different implementations (bytemonsoon, opentracker, zzzot, and postman2)

More would be even better!

Yes, the basic idea is that the IP is replaced with the base64 address.

For the modified bytemonsoon source, ask postman.

For Robert source, ask sponge.

There are many other i2p clients, the source for each is available.