<p><pre><code>  2. If your data store can always accept the write only if 
  your token is greater than all the past tokens, than it’s a 
  linearizable store. If you have a linearizable store, you 
  can just generate an incremental ID for each Redlock 
  acquired, so this would make Redlock equivalent to 
  another distributed lock system that provides an 
  incremental token ID with every new lock. However in the 
  next point I’ll show how this is not needed.
</code></pre>
you confuse which system is the linearizable one in this point. your storage system is just a dumb storage system that simply returns the object version with the highest clock. what makes it linearizable to an outside observer is that the system generating the lock ids is itself linearizable. if every insert is accompanied by an authentic lock id the system is linearizable. if you generate this lock id via the storage system itself then the storage system must also be linearizable<p><pre><code>  3. However “2” is not a sensible choice anyway: most of the times the 
  result of working to a shared resource is not writing to a linearizable 
  store, so what to do? Each Redlock is associated with a large random 
  token (which is generated in a way that collisions can be ignored. The 
  Redlock specification assumes textually “20 bytes from &#x2F;dev&#x2F;urandom”). 
  What do you do with a unique token? For example you can implement Check 
  and Set. When starting to work with a shared resource, we set its state 
  to “`&lt;token&gt;`”, then we operate the read-modify-write only if the token 
  is still the same when we write.
</code></pre>
would you say this sequence of events is correct:<p>* process A acquires lock<p>* process B acquires a lock on the same resource after a time out and sets it&#x27;s lock id on the resource<p>* process A sets it&#x27;s lock id on the resource<p>* process A writes a new version of the resource<p>* process B attempts and fails to write a new version of the resource<p>if it&#x27;s not correct, would you say redlock prevents it? how?<p>now consider what happens if the resource is only one of a group of resources that need to be transactionally updated<p>the bottom line is that distributed transactional locking requires linearization and redlock is plainly not linearizable. please reconsider it&#x27;s continued development and steer users towards something safer like zookeeper