Track tasks and feature requests
Join 40 million developers who use GitHub issues to help identify, assign, and keep track of the features and bug fixes your projects need.
Sign up for free See pricing for teams and enterprisesHello and support from KadOH #18
Comments
This comment has been minimized.
This comment has been minimized.
"Si quieres viajar alrededor del mundo y ser invitado a hablar en un monton |
This comment has been minimized.
This comment has been minimized.
|
@piranna okay let's start! -> https://github.com/kadoh/routing-table is a rough extraction of KadOH routing table implementation with minimal reformatting. |
This comment has been minimized.
This comment has been minimized.
|
Wow, fan service!!! :-D Thanks, I'm going to take it a look :-) 2013/12/8 Alexandre Lacheze notifications@github.com
"Si quieres viajar alrededor del mundo y ser invitado a hablar en un monton |
This comment has been minimized.
This comment has been minimized.
|
@alexstrat - thanks for the note! I remember hearing about KadOH a year ago, but didn't investigate too deeply. I'm definitely going to take a closer look at what you've built and learn what I can that might help WebTorrent. It sounds like you broke new ground with KadOH, doing Kademlia in JS. Very cool! Your routing table implementation (https://github.com/kadoh/routing-table) sounds like it might be really useful for webtorrent. Let me know if there are any other pieces of KadOH that might make sense to incorporate or even use for inspiration. |
This comment has been minimized.
This comment has been minimized.
|
Just a question: KadOH is for looking (routing) peers, for addresing its Send from my Samsung Galaxy Note II
|
This comment has been minimized.
This comment has been minimized.
|
@piranna KadOH is not much than an implementation of Kademlia, a DHT (Distributed Hash Table) algorithm. From an external perspective, it provides a way to get and put key/value tuples distributively stored across participating peers. One key element of the algorithm is indeed the routing (aka finding the right peer(s)): each peer stores contacts of some others in a bit-tree sorted table (that's our routing-table) and finding a peer resides in jumping from peer to peer by querying routing-tables of others thru So, to answer your question, KadOH gives solution for looking (routing) peers, but not for addressing content of files. Once you find the peer that got your file (KadOH job), you can establish a P2P connection to transfer the file (ShareIt job)! :) |
Hi @feross,
I just bumped into webtorrent and i'm astonished: I really think you are on top of something big!
I'm co-author (with @jinroh) of KadOH, a (dying?) project that has much in common with webtorrent:
Now, it's been a while since last time we did a true commit to KadOH.. One last initiative I wanted to achieve was to split our implementation into several reusable modules (for instance, eventually is our implementation of ~promises) but I never went further.
However, I think there is probably some parts of KadOH that could interesting to pickup to continue building webtorrent. We got for instance an implementation of the Kademlia routing table (with its iterative-lookup algorithm) that webtorrent might be interested in (#11?).
I would be very happy and proud to discuss it and help you building webtorrent by integrating pieces of KadOH!
– Alex