Your first link confirms you can have locks in a multithreaded lock free algorithm - "The Lock-Free property guarantees that at least some thread is doing progress on its work" - I always thought this property should have been called deadlock free.

That's a good point, it does seem consistent with that definition.

This other blog post [0] seems to use a stricter definition of lock-free which precludes any way to schedule threads which would cause progress to cease indefinitely. That seems to be what the ConcurrencyFreaks blog refers to as Wait-free.

Any experts in lock-free programming able to clarify things?

[0] https://preshing.com/20120612/an-introduction-to-lock-free-p...