Abstract : Chord is a distributed protocol performing efficient node lookup in a ring-based overlay network. Babelchord is a distributed protocol that performs resources virtualization and nodes self-aggregation via a social tower of Chord-based "floors". Nodes can register to one or many floors upon a floor's consensus. Babelchord provides a cost-effective alternative to hierarchical structured P2P systems and DHT merging by connecting smaller structured overlay networks in an unstructured way. Lookup routing performs as in Chord but a node belonging to more than one tower's floor, floods the request to all the floors it belongs to. The final peer (resp. floor), responsible for the successful lookup, is inserted into an hot peer (resp. hot floor) list that will be used to generate new floors' joins and creations. As such, inter-floors connections take place through "nodes at crossroads", a sort of neural synapses. Results from simulations show that Babelchord scale up logarithmically with the number of Babelchord nodes and floors: moreover a little number of synapses is sufficient to achieve an exhaustive lookup.