Extended version of the paper "Consistent Hashing and Random Trees" with proofs I've been reading the following paper:


David Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Mathew Levine, Daniel Lewin, "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web", 1997. pdf


In the paper the authors mention that 
the proofs will be available in the "full paper". 
But I cannot find any extended version of the paper with proofs.
Can someone direct me to a version with the proofs?
Answering my own question.

I found that the authors never published an extended version with proofs.

The closest thing to an extended paper is,


  Rina Panigrahy. Relieving hot spots on the worldwide web. 1997. 1


which was the Master's thesis of Rina Panigrahy (under Prof. Karger &amp; Prof. Smith), who's also a co-author of the paper under discussion.  It is a good, detailed reference to the original paper with all the proofs I needed.