Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

First Principles Ep. 3 with Leslie Lamport Before blockchains could reach consensus, Leslie Lamport had to define what agreement even meant when computers fail, lie, or disappear. Hosted by Tim Roughgarden with Ittai Abraham. 00:00 The problem every blockchain is built to solve 02:52 Why concurrent systems are surprisingly...

67,597 Aufrufe • vor 4 Monaten •via X (Twitter)

10 Kommentare

Profilbild von a16z crypto
a16z cryptovor 4 Monaten

First Principles Ep. 2 w/ Barbara Liskov Every blockchain alive today leans on replication ideas worked out in the 1980s, by a Turing Award winner who wasn’t thinking about how it might apply to money at all. Hosted by @Tim_Roughgarden with @ittaia. 00:00 How do systems stay reliable when parts fail? 01:18 Barbara Liskov’s path from programming languages to distributed systems 05:45 Why modularity is “everything” 07:22 The replication problem: keeping data available across many machines 09:58 Viewstamped replication and the “ledger” before blockchains 16:32 Why good research starts with what you don’t understand 18:10 Leslie Lamport, Paxos, and the inevitability of ideas in the right time, in the right place 21:48 Practical Byzantine Fault Tolerance: what changes when replicas can lie 19:35 How PBFT bridged theory and practical systems 22:38 Why you should never trust an individual replica 28:39 Why blockchains are state machine replication in the wild 31:27 AI, verification, and the future of computer science

Profilbild von a16z crypto
a16z cryptovor 4 Monaten

First Principles Ep. 1 Bitcoin gets credited with inventing trustless consensus. It didn’t. The problem was named in the 1980s, and it took the research world years to even notice Satoshi had solved it. A new series hosted by @Tim_Roughgarden, with @ittaia. 00:00 Introduction to First Principles: The Scientific Roots of Blockchain Technology 00:56 Why consensus matters for blockchains 02:30 Byzantine agreement: The old computer science problem Bitcoin made practical 04:34 Blockchains as a shared system of record: State machine replication and blockchain state 06:41 How two research worlds — distributed computing and crypto — began to converge 07:49 Proof of work vs. proof of stake 09:27 Why Ethereum’s move to proof-of-stake took years 11:08 When crypto rediscovered decades of distributed systems research 12:49 Throughput, latency, and modern consensus design 14:05 DAG-based protocols and faster blockchains 15:25 Peace time vs. war time: why modern blockchains need two modes 16:47 Theory, practice, and the future of blockchain research

Profilbild von a16z crypto
a16z cryptovor 4 Monaten

A handful of ideas hold up the entire digital world, but most of us never learn where they came from. So we went to the source: the people who solved these problems, and won Turing Awards and Nobel Prizes for it. First Principles, hosted by @Tim_Roughgarden. First episode out now.

Profilbild von Geração Alpha
Geração Alphavor 4 Monaten

@Tim_Roughgarden @ittaia teoria legal mas a gente so lança meme na solana e torce pra 100x

Profilbild von João Capital
João Capitalvor 4 Monaten

@Tim_Roughgarden @ittaia Como o apoio da DARPA influenciou o desenvolvimento de algoritmos como o Paxos?

Profilbild von Daniel Vargas
Daniel Vargasvor 4 Monaten

@Tim_Roughgarden @ittaia una vez en p2p dos vendedores me dieron saldos distintos y no supe cual creer, perdi la transaccion.

Profilbild von Ananth Narayan
Ananth Narayanvor 4 Monaten

@Tim_Roughgarden @ittaia Are these interviews on YouTube as well?

Profilbild von hiimrave.icp Ƹ̵̡Ӝ̵̨̄Ʒ ∞
hiimrave.icp Ƹ̵̡Ӝ̵̨̄Ʒ ∞vor 4 Monaten

@Tim_Roughgarden @ittaia Interview @dominic_w hes the best $ICP

Profilbild von ✨ 𝑺𝒐𝒑𝒉𝒊𝒆 | 𝑯𝒆𝒂𝒍𝒕𝒉 & 𝑭𝒊𝒏𝒂𝒏𝒄𝒆 ✨
✨ 𝑺𝒐𝒑𝒉𝒊𝒆 | 𝑯𝒆𝒂𝒍𝒕𝒉 & 𝑭𝒊𝒏𝒂𝒏𝒄𝒆 ✨vor 4 Monaten

@Tim_Roughgarden @ittaia

Profilbild von FuegoDev
FuegoDevvor 3 Monaten

@Tim_Roughgarden @ittaia Paxos and PBFT solve agreement on ordering when proposers can fail or lie. @RetiumChain 's mesh sidesteps that specific problem: block position is computed from factorization, not proposed and voted on. Keepers still agree on canonical ticks, just not on competing proposals.

Ähnliche Videos

First Principles Ep. 6 with Ron Rivest Long before the internet became a place to bank, transact, or build blockchains, Turing Award winner Ron Rivest helped solve a foundational problem: how can strangers communicate securely without first meeting to exchange a secret? Rivest tells the story of inventing RSA with Adi Shamir and Leonard Adleman, why digital signatures fascinated him even more than encryption, and how cryptographic hashes, government pressure, patents, and standards shaped the security infrastructure we rely on today. Rivest shares his unusually candid views on quantum computing, post-quantum security, and more. Hosted by Tim Roughgarden with Dan Boneh. 00:00 Intro: the two problems that could break modern cryptography 01:10 Why Ron Rivest’s work underpins the internet and blockchains 08:10 Before public-key cryptography, there was no theory of security 11:05 The open problem that led to RSA 13:55 The night Ron Rivest discovered the core idea behind RSA 17:55 Why digital signatures were the real breakthrough 19:14 The RSA challenge — and a prediction that was off by quadrillions of years 28:33 How government pressure shaped cryptographic standards 30:36 Designing the hash functions that made digital signatures practical 33:26 The Fiat–Shamir transformation, explained 38:04 Building a cryptography company before the web existed 42:31 Will quantum computers ever become powerful enough to break RSA? 48:02 The cryptography securing the internet, elections, and everyday life 50:11 What surprised Dan: Quantum giveth and quantum taketh away

a16z crypto

62,339 Aufrufe • vor 3 Monaten

First Principles Ep. 7 with Noam Nisan More than 30 years ago, Gödel Prize winner Noam Nisan helped develop a proof technique he never expected anyone to use in the real world. Today, the sum-check protocol sits at the heart of some of the fastest modern SNARKs. Nisan traces its unlikely journey from early work on interactive proofs and IP = PSPACE to practical systems for verifiable computation. But Nisan’s career also tells a broader story about how research responds to technological change. When the web arrived in the 1990s, he deliberately left a field in which he was already a leading researcher to understand a new problem: How do you get independent actors on the internet to cooperate when they have different incentives? That question helped give rise to algorithmic game theory — and, decades later, brought Nisan back to questions around blockchain fees, token economics, and protocol design. Hosted by Tim Roughgarden with Justin Thaler 0:00 Intro 1:28 Noam Nisan and the origins of verifiable computation 2:58 Why Noam Nisan left complexity theory 7:52 POPcorn, distributed computing, and early blockchain-like ideas 11:10 The birth of algorithmic game theory 16:14 Justin Thaler discovers the sum-check protocol 25:05 From arithmetization to LFKN 27:06 The story behind IP = PSPACE 30:40 Why sum-check matters for modern SNARKs 31:15 What is a SNARK? 38:52 The key idea behind sum-check: turning two into one 44:03 When SNARKs went from theory to practice 46:03 Why blockchains were the breakthrough use case 50:36 Noam Nisan’s move into blockchain economics 56:15 EIP-1559, transaction fees, and efficient blockspace 1:02:07 From theoretical computer science to real-world systems 1:08:49 Boiling down the sum-check protocol: Two become one 1:10:58 Is the sum-check protocol optimal?

a16z Frontier

63,520 Aufrufe • vor 3 Monaten

First Principles Ep. 6 with Shafi Goldwasser What if you could prove something is true without revealing why it’s true? Turing Award winner Shafi Goldwasser tells the origin story of zero-knowledge proofs: how a playful question about playing poker securely over the telephone led her, Silvio Micali, and Charles Rackoff to rethink what a mathematical proof could be. Goldwasser traces those ideas through interactive proofs, the sum-check protocol, SNARKs, and the systems now used to verify computation and preserve privacy on blockchains. She also reflects on why breakthrough ideas are often rejected at first, how toy problems can produce foundational theories, and whether AI systems should have to prove their answers. Hosted by Tim Roughgarden with Justin Thaler 00:00 Intro 03:36 How mental poker inspired zero-knowledge proofs: Proving that something is true without revealing the underlying information 06:30 The simulation paradigm and the meaning of “zero knowledge” 08:33 Why the original paper was repeatedly rejected 10:33 How interactive proofs became more powerful than conventional proofs 13:36 The road to modern SNARKs 19:02 Why the sum-check protocol is so useful for verifiable computation 25:31 Why many so-called “zk proofs” are not actually zero knowledge 34:06 Why toy examples, playfulness, and narratives can produce deep theory 37:23 The role of rigor and computational assumptions in cryptography 42:44 Applying zero-knowledge proofs to law, evidence, and secret software 45:23 Training AI systems to provide proofs alongside their answers 54:27 Why genuinely new ideas are often difficult for experts to recognize

a16z Frontier

203,553 Aufrufe • vor 3 Monaten