As with all distributed systems algorithms, we should assume Redlock is unsafe until proven otherwise.  A proof looks like <a href="http:&#x2F;&#x2F;ramcloud.stanford.edu&#x2F;raft.pdf" rel="nofollow">http:&#x2F;&#x2F;ramcloud.stanford.edu&#x2F;raft.pdf</a> (Raft), <a href="http:&#x2F;&#x2F;research.microsoft.com&#x2F;en-us&#x2F;um&#x2F;people&#x2F;lamport&#x2F;pubs&#x2F;paxos-simple.pdf" rel="nofollow">http:&#x2F;&#x2F;research.microsoft.com&#x2F;en-us&#x2F;um&#x2F;people&#x2F;lamport&#x2F;pubs&#x2F;p...</a> (Paxos) or <a href="http:&#x2F;&#x2F;www.tcs.hut.fi&#x2F;Studies&#x2F;T-79.5001&#x2F;reports&#x2F;2012-deSouzaMedeiros.pdf" rel="nofollow">http:&#x2F;&#x2F;www.tcs.hut.fi&#x2F;Studies&#x2F;T-79.5001&#x2F;reports&#x2F;2012-deSouza...</a> (Zookeeper).<p>Personally I&#x27;d prefer stronger proofs than even those, but I think those papers get us to the point where implementation issues are as important as theoretical issues.<p>In my personal opinion, Redlock is not at the point where we even need to consider the implementation.