Answer extracted from the a16z crypto show podcast — listen to the full episode below.
How did the Popcorn project relate to ideas about verifying delegated computation?
The Popcorn project tackled a core challenge of delegation: how to verify that work completed by someone else was actually done correctly. Nisan and his team explored two main approaches—having multiple people perform the same work to check consistency, or using NP-like proofs to provide verification—while thinking about distributed systems where workstations from different organizations could share resources and cooperate despite trust and incentive challenges.
Building verification into a cooperative web
The Popcorn project emerged from a practical problem that became increasingly urgent in the 1990s. When you hand over computational work to an external party, you lose direct control and must find a way to validate the result. This wasn't initially framed as a blockchain problem—that framing came much later. Instead, Nisan focused on how independent workstations across the web could collaborate and share CPU resources even when they belonged to different institutions with no direct trust relationship.
The insight was straightforward but powerful: delegation without verification is worthless. As Nisan explains in the episode, the team experimented with multiple checking methods. One approach was simple redundancy—give the task to several workers independently and compare results. Another was more sophisticated: leverage the theoretical power of NP-like proofs to create a mathematical argument for correctness that the delegator could verify without redoing all the work.
"If you have some kind of theoretical inclination, you always find really fascinating theoretical questions that come up."
Noam Nisan — Principal Researcher at Starkware, Knuth Prize and Gödel Prize-winning computer scientist at Hebrew University of Jerusalem. His early work on algebraic methods for interactive proof systems established the theoretical foundations for modern SNARKs and verifiable computation, and he co-founded the field of algorithmic game theory.
The distributed context mattered enormously. Unlike a centralized company where every workstation belongs to the same employer, the web required protocols that worked across organizational boundaries. Trust couldn't be assumed—it had to be earned through cryptographic proof. This framing—verification as a mathematical guarantee, not an organizational promise—became foundational thinking that would later apply to blockchain systems, though that wasn't the original motivation.
The specific protocols and techniques Nisan developed during this period, including explorations of interactive proof structures, are detailed further in the full conversation, where he discusses how theoretical computer science and practical distributed system design converged to create tools still used today.
See also
What motivated a leading complexity theorist to pivot toward algorithmic game theory and economic computation in the mid-1990s?
Noam Nisan was inspired by the emergence of the Internet around 1995, which he saw as a massive paradigm shift that academia was too slow to embrace. He recognized that distributed systems with trust and incentive challenges required new theoretical foundations.