Leslie Lamport (New York, 1941), Marshall Pease, and Robert Shostak of SRI International publish in 1982 "The Byzantine Generals Problem" in ACM Transactions on Programming Languages and Systems, formalizing the problem of distributed consensus in the presence of malicious or faulty nodes. The problem models a set of generals who must coordinate an attack via potentially treacherous messengers: how can guaranteed agreement be reached if some participants actively lie? The article demonstrates that consensus is possible if and only if fewer than a third of participants are malicious, and provides the fundamental algorithms for Byzantine fault tolerance (BFT). Bitcoin solves the Byzantine generals problem in an open, permissionless network via proof-of-work: the computational cost makes attacking more expensive than cooperating. Nakamoto does not explicitly cite Lamport, but Bitcoin's solution is a direct response to the problem formalized in 1982. Lamport received the Turing Award in 2013 for Paxos and LaTeX, not for the Byzantine generals.