Program Presentations
summary
Three concrete takeaways: kilobyte zkSNARK proofs let a cellphone verify a year‑long computation in under a second and power rollups; multi‑party computation powers threshold signature wallets (no single device holds the key); Aptos witness‑encrypted transactions hide mempool contents until on‑chain finality to prevent frontrunning; quantum workshops use compressed oracles to separate QMA vs QCMA; numerical work gives attainable matrix‑multiply bounds and highlights a 45,000x energy gap DRAM vs add that drives low‑precision and communication‑avoiding redesigns.
AI-written summary · about
chapters (8)
- 0:00Welcome to Industry Day
- 2:55Cryptography program highlights
- 15:59Quantum computing summer insights
- 28:24Linear algebra program overview
- 39:56Emerging hardware technologies
- 50:42Federated learning program preview
- 1:03:05High performance computing
- 1:22:50Q&A and closing
related talks
33mAn Introduction to Zero Knowledge Proofs
39mPrivacy and Evolution of SNARKs
36mPanel Discussion
17mThe Pod: Post-Quantum Readiness
10mCryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation
01h 07mProofs - Practice 2
18mSoK: Understanding zk-SNARKs: The Gap Between Research and Practice
24mA Framework for Post-Quantum Succinct Arguments