# Chord

- how consistent?  eventual?

- gossip overhead a problem?  

- Between Chord and RAFT I’m starting to get confused about practical considerations of working with these algorithms in a replicated environment. Do we commonly “layer” these algorithms based on some kind of sharding or consistent hashing method to split out our replicas?

- seems secure...but byzantime....

- how mapping keys to nodes

-  When node n leaves the network, all of its assigned keys are reassigned to n’s successor  (r successors, plus higher level replication)

- If all of the nodes that node n can reach (the successor list of size r  = O(logn)) leave, is that node lost? I

- refresher log(N)

- what about partitions

- stabalization is dependent on low churn
