Before Bitcoin: The Intellectual Foundations of Blockchain Technologies

Before Bitcoin: The Intellectual Foundations of Blockchain Technologies The origins of blockchain technology predate the Bitcoin whitepaper, drawing on decades of foundational research across distributed computing, economics, and cryptography. Through the 'First Principles' interview series hosted by Tim Roughgarden, leading computer scientists and economists discuss the historical research that ultimately enabled modern blockchains. Blockchain architectures synthesize long-standing questions regarding machine consensus, trustless coordination, and market rules rather than inventing them from scratch. Distributed systems pioneers Barbara Liskov and Leslie Lamport formulated key consensus and fault-tolerance frameworks, including viewstamped replication, Paxos, and Byzantine agreement. Nobel laureates Alvin Roth and Paul Milgrom contributed foundational principles of market and mechanism design, linking economic incentives directly to practical system operations. Cryptographic and algorithmic advances from Ron Rivest, Shafi Goldwasser, and Noam Nisan introduced critical primitives such as public-key cryptography, zero-knowledge proofs, and the sum-check protocol. Consensus and Distributed Systems The operational reliability of blockchains relies on solutions to distributed system failures developed decades earlier. Turing Award winners Barbara Liskov and Leslie Lamport investigated concurrency, Byzantine agreement, logical clocks, and state machine replication. Liskov’s work on viewstamped replication and Practical Byzantine Fault Tolerance emphasized rigorous specification for surviving failures, while Lamport's formulations, including Paxos, addressed concurrency and proving algorithm correctness. Economic Mechanism and Market Design Blockchains incorporate economic rule sets that govern user behavior, reflecting principles from market and auction design. Nobel laureates Alvin Roth and Paul Milgrom addressed how theoretical economics applies to institutional mechanisms, ranging from matching systems to modern auctions. Milgrom highlighted the expanding dialogue between economists and computer scientists, challenging convenient economic assumptions to design practical mechanisms. Cryptography and Algorithmic Theory Foundational work in computer science established the cryptographic components behind modern blockchain networks. Ron Rivest detailed the development of RSA, public-key cryptography, digital signatures, and hash functions. In parallel, Shafi Goldwasser explored interactive and zero-knowledge proofs that laid the groundwork for SNARKs, while Noam Nisan examined complexity theory, algorithmic game theory, and the sum-check protocol, illustrating how theoretical concepts eventually transition into practical engineering systems.

比特币诞生之前：奠定区块链基础的核心思想与先驱访谈 比特币与区块链技术并非凭空产生，其底层思想源远流长。a16z crypto 研究负责人 Tim Roughgarden 主持的访谈系列《First Principles》对话了多位图灵奖、诺贝尔奖及哥德尔奖得主，回顾了分布式系统、市场设计和现代密码学等领域为区块链奠基的关键探索。 区块链并非单一发明者的产物，而是融合了机器容错共识、无信任协同与市场机制设计等既有研究问题。 Barbara Liskov 与 Leslie Lamport 探讨了视图复制、PBFT、逻辑时钟、拜占庭共识及 Paxos 等分布式系统核心理论。 诺贝尔经济学奖得主 Alvin Roth 与 Paul Milgrom 阐述了市场设计、拍卖理论以及经济学与计算机科学的跨学科融合。 Ron Rivest、Shafi Goldwasser 与 Noam Nisan 梳理了公钥密码学、零知识证明、复杂度理论及求和校验协议如何最终演化为现代区块链的关键技术。 区块链背后的思想演进与访谈缘起 人们常将比特币白皮书视为凭空出现的起点，但其技术脉络实际上更为久远曲折。关于机器如何在出现故障或恶意行为时达成共识、陌生人间如何实现免信任协作，以及市场规则如何塑造参与者行为等问题，早在区块链之前就已被广泛探索。为此，高等研究院教授兼 a16z crypto 研究负责人 Tim Roughgarden 主持了《First Principles》系列对话，邀请计算与经济学领域的开拓者分享他们最初的研究历程。 分布式系统与容错共识的奠基 图灵奖得主 Barbara Liskov 回顾了从数据抽象到分布式系统的转变，阐述了视图变更复制（Viewstamped Replication）与实用拜占庭容错（PBFT）的诞生，并强调了在应对系统失效时严谨规范与推理的重要性。同为图灵奖得主的 Leslie Lamport 则讨论了并发、逻辑时钟、拜占庭共识、状态机复制和 Paxos 协议，展示了最初的纯理论问题如何演变成分布式计算的核心基石。 机制设计与经济学机制的现实映射 在经济与机制设计方面，诺贝尔经济学奖得主 Alvin Roth 解释了市场设计理论如何应用于医疗匹配、学校选择和肾脏交换等实际制度，并指出规则往往决定了市场能否存在。诺贝尔经济学奖得主 Paul Milgrom 探讨了拍卖理论以及理论经济学向实用机制设计的演进，并提及了经济学家与计算机科学家之间日益深入的对话。 现代密码学与理论计算的深远影响 在密码学与理论计算领域，图灵奖得主 Ron Rivest 回顾了 RSA、公钥密码学、数字签名和哈希函数的发明演变。零知识证明共同发明人 Shafi Goldwasser 梳理了从交互式证明到零知识、再到高效验证的路径，这些研究最终催生了现代 SNARK 技术。哥德尔奖得主 Noam Nisan 则反思了复杂度理论、求和校验协议以及算法博弈论的发展，说明高度抽象的理论构想如何经历数十年最终转化为实用系统。

People often tell the story of the first Bitcoin [whitepaper](https://bitcoin.org/bitcoin.pdf) as if it [materialized](https://a16zcrypto.com/posts/article/forum-posts-software-innovation-bitcoin-whitepaper-10th-anniversary/) in a vacuum and then led linearly to mining, smart contracts, tokens, DeFi, and every successive generation of blockchain design. But the intellectual history of these technologies is actually much older and more labyrinthine, complete with twists, turns, and false starts. And instead of a single inventor (or two), the foundational technologies behind blockchains pull on threads left by others. For instance, answering questions like: How can machines agree when some fail or behave maliciously? How can strangers communicate and coordinate trustlessly? How do the rules of a market affect how people behave within them? Blockchains didn’t create these questions. But they have brought them together, helping propel them forward in new contexts. This is why we created *[First Principles](https://a16zcrypto.com/posts/article/first-principles-series-interviews-computing-pioneers/)*, a special series of conversations hosted by Institute for Advanced Study professor and a16z crypto Head of Research Tim Roughgarden. Throughout, Turing Award winners, Nobel laureates, and Gödel Prize winners share the origin stories behind their pioneering work — much of which underpins things we use every day — and explore how work done for one problem later became part of technologies its creators never anticipated. You can watch all of the conversations [here](https://youtube.com/playlist?list=PLjQ9HCQMu_8yIg60YAq67HDdvp7E_T5e8&si=1pk09FSbUDSZ92WJ). **Barbara Liskov ([2008 Turing Award Winner](https://amturing.acm.org/award_winners/liskov_1108679.cfm), [MIT](https://www.csail.mit.edu/person/barbara-liskov))** shares her path from programming languages and data abstraction to distributed systems, the development of viewstamped replication and Practical Byzantine Fault Tolerance, and the importance of specification and careful reasoning when building systems that have to survive failure. “It felt to me like we were in a fun house full of these distorting mirrors. You had to really think about things in an odd way to come to grips with this.” — Barbara Liskov **Leslie Lamport ([2013 Turing Award Winner](https://amturing.acm.org/award_winners/lamport_1205376.cfm), [most recently at Microsoft Research](https://lamport.azurewebsites.net/pubs/pubs.html))** discusses his work on concurrency, logical clocks, Byzantine agreement, state machine replication, and Paxos, and how problems that began as theoretical questions became central to distributed computing. “I got back a letter from the editor pointing out where the bug in my algorithm was. This had two effects. The first was, it made me realize how tricky concurrency is, and how you really have to be essentially able to prove the correctness of a concurrent algorithm. And the second was, I’m just gonna solve that damn problem.” — Leslie Lamport **Alvin Roth ([2012 Nobel Prize in Economic Sciences](https://www.nobelprize.org/prizes/economic-sciences/2012/summary/), [Stanford University](https://web.stanford.edu/~alroth/))** explains how market design moved from economic theory into institutions — including medical matching, school choice, and kidney exchange — and why the rules of a market often determine whether the market can exist at all. “That was really the beginning of my career as a practical market designer, when I agreed that their hard problems would become my problem.” — Alvin Roth **Paul Milgrom ([2020 Nobel Prize in Economic Sciences](https://www.nobelprize.org/prizes/economic-sciences/2020/summary/), [Stanford University](https://milgrom.people.stanford.edu/))** discusses auction theory and the movement between theoretical economics and practical mechanism design — including the growing dialogue between economists and computer scientists. “Many of the assumptions that we make in economics are arbitrary for convenience, for simplicity. And they’re just wrong.” — Paul Milgrom **Ron Rivest ([2002 Turing Award Winner](https://amturing.acm.org/award_winners/rivest_1403005.cfm), [MIT](https://people.csail.mit.edu/rivest/))** revisits the invention of RSA and the early development of public-key cryptography, digital signatures, and hash functions, as well as the evolution of the security assumptions that underpin much of modern digital communication. “Most of mathematics turns out to be useful somewhere, and cryptography is a great consumer of mathematics.” — Ron Rivest **Shafi Goldwasser ([2012 Turing Award Winner](https://amturing.acm.org/award_winners/goldwasser_8627889.cfm), [MIT](https://www.csail.mit.edu/person/shafi-goldwasser))**, co-inventor of zero-knowledge proofs, traces the path from early cryptographic puzzles to interactive proofs and zero knowledge, and from there to questions about efficient verification that eventually helped make modern SNARKs possible. “For me, I need a narrative. There has to be, first of all, a story in your head. The problem is more of a narrative, and now you can attach to it a specific math problem.” — Shafi Goldwasser **Noam Nisan ([2012 Gödel Prize Co-Winner](https://www.sigact.sigact.hosting.acm.org/prizes/g%C3%B6del.html), [Hebrew University of Jerusalem](https://www.cs.huji.ac.il/~noam/), also StarkWare)** reflects on complexity theory, the sum-check protocol, algorithmic game theory, and the unpredictable path by which theoretical ideas can become part of practical systems decades after they first appear. “I never thought of this as anything that could be practical … It was highly theoretical, and I was sure it \[would\] never become useful.” — Noam Nisan