arvidn / bittorrent-multi-have Goto Github PK

https://wiki.debian.org/DebTorrent/UniquePieces

Since v2 is based on merkle trees it might make sense to use tree-layer based addressing, similar to the hash request message format in BEP52.

So instead about just being about multi-haves it could also add optional support for sub-piece haves.
Clients probably should be required to send full-piece haves regardless whether they send sub-piece ones or not, to simplify tracking on the other side, in case implementations have no interest of keeping track of such fine-grained information.

1. The number of request messages that would need to be sent per byte of payload byte received.

That doesn't seem true. Am I missing something? You always send requests for 16KiB-chunks, no matter the piece size.

In fact, the request usage should go down a tiny bit since endgame mode will be shorter.