But the problem is that when you have a BAD idea you also may find yourself bashing people over the head with it :)
I wonder if he will win the Turing Award for Paxos. Awhile ago I thought it would be deserved, but I also feel like the full state machine is a bit awkward and heavy-handed for a lot of distributed systems problems (especially distributed systems over WAN, which I think is more interesting these days). I like the Bloom/CRDT work. And Raft is a simpler algorithm when you need strong consensus.
You also can't ignore his other work in logical clocks, the bakery algorithm, the Chandy-Lamport algorithm, and TLA+.
Very useful if you are into distributed systems and would like to see a practical implementation with clear examples.
I also think Lamport overstates his success with formulating the Byzantine generals problem in terms of Byzantine generals. I know the problem as the Byzantine generals problem, but think of it in terms of computers, not generals. It's just easier to understand the problem that way, the generals stuff just gets in the way. iirc my distributed systems textbook (Lynch) did not actually formulate the problem in terms of generals, but I could be misremembering.
http://research.microsoft.com/en-us/um/people/lamport/pubs/p...
For those that don't know, Paxos is one of the most important algorithms in distributed systems, so it's amazing to see that it wasn't even published for 8 years due to the author's ... odd structuring of the problem.