A Wait-Free Stack
I&#x27;m not sure I see what&#x27;s novel about this - maybe it&#x27;s a verbiage thing around &quot;wait free,&quot; but if they&#x27;re atomically updating the top pointer and linked list, there will be lock contention on writes, and similarly when marking an item popped, on reads. I suppose the contention is bounded by the number of readers or writers,  but I wouldn&#x27;t consider that wait free (again, that could just be a verbiage thing). But, more to the point, this is just a slight twist on how Kafka works (stack vs log &#x2F; queue, but same with the pointer holding place and a cleanup operation), I don&#x27;t really see it as particularly novel...perhaps I&#x27;m missing something?