a16z crypto's banner
a16z crypto's profile picture

a16z crypto

@a16zcrypto1,440,755 subscribers

We back bold entrepreneurs building the next internet. Posts are not investment advice or an advertisement for investment services. See https://t.co/CrY32IX80W 👇

Videos

a16zcrypto's profile picture

Can a sufficiently powerful quantum computer forge the signatures used to authorize Bitcoin and Ethereum transactions? What would it take to upgrade both networks before that happens? In this new lecture, Stanford cryptographer Dan Boneh explores why blockchains may turn to signatures built from hash functions. He also presents new research on threshold signing. The talk ends with the questions Bitcoin still has to answer, including whether post-quantum signatures will require larger blocks, what happens to abandoned coins, and how someone such as Satoshi could prove ownership after Bitcoin’s current signatures have been retired. 00:00 Why blockchains need to prepare for quantum computers 03:05 Why Bitcoin may bet on hash-based signatures 06:25 The “big footgun” in stateful signatures 08:58 A quantum-safe signature that takes one billion hashes 14:13 Inside SLH-DSA’s virtual tree 20:30 How Bitcoin and Ethereum could make the switch 23:48 What happens when a wallet loses its state? 32:47 Can threshold signing survive the quantum transition? 36:39 How to hide lattice cryptography from the blockchain 38:49 Why threshold one-time signatures seem impossible 45:36 How context prevents forged signatures 49:37 The forgotten idea behind Winternitz signatures 54:50 Turning one-time signatures into threshold signatures 1:04:27 Will quantum-safe signatures require bigger Bitcoin blocks? 1:06:26 Abandoned bitcoin and Satoshi’s recovery problem

a16z crypto

115,401 views • 7 days ago

a16zcrypto's profile picture

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 crypto

195,753 views • 25 days ago

a16zcrypto's profile picture

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 crypto

56,326 views • 20 days ago

a16zcrypto's profile picture

What happens when intelligence becomes a line item? For the first time, companies can treat AI token spending almost like headcount: allocate more money, deploy more intelligence, and potentially get more work done. That changes the economics of building a company. It could reshape how companies form, how teams are managed, how businesses are financed, and who is best positioned to build them. a16z crypto General Partner Guy Wuollet and Head of Engineering ncitron.eth join Robert Hackett to explore why engineering leaders may soon manage token budgets like P&Ls, the emergence of software-engineering “pod shops”; and whether the future belongs to smaller, leaner businesses run by people who are unusually good at directing agents. They also ask why AI agents may naturally transact using stablecoins, and confront a larger question: If AI has created so much new intelligence, why hasn’t it produced an obvious jump in economic growth? And in a world where everyone can access powerful models, will intelligence matter less than grit, judgment, and agency? 0:00 Intro 4:01 Why token spending is starting to resemble headcount 4:51 Deciding how much spend is too much spend 9:04 The agentic A/B test: How to quantify "return on tokens" 12:05 The software-engineering "pod shop" 25:13 Paying deference to the Machine God 26:06 The rise (or not) of lean, AI-native microbusinesses 28:05 Everyone's a manager? The new style of thinking for engineers 30:48 Why AI agents may naturally use stablecoins 34:33 When AI productivity will appear in GDP 47:49 Why grit and agency may matter more than IQ 51:38 How AI could create new paths for startups 54:53 Innovation, commoditization, and creative destruction

a16z crypto

59,535 views • 1 month ago

a16zcrypto's profile picture

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 views • 1 month ago