optimizely / chord Goto Github PK

What is the state of this?
Is there anyone actively maintaining it?

// Computes a new key equal to key + 2 ^ exponent.
// Assumes key is a 4 element array of 32 bit words, most significant word first.

Try creating a few hashes with small string lengths up to 4, only the first word of the hash will be effected. Then try hashing string lengths up to 8, only the first two words will be effected.

I'm curious as to why you chose to use UDP as opposed to TCP.

For example instead of having a FIND_SUCCESSOR and FOUND_SUCCESSOR message types, couldn't you just open a TCP connection, request the successor, and then get a response with that information?

I'm honestly not that knowledgeable in this area, and would be interested to know if there is a specific reason TCP might not be as good a solution to use with Chord.