Yannik Schrade on the Tucker Carlson Show
Tucker Carlson and Yannik Schrade discuss privacy, surveillance, and the world that Arcium is building with encrypted computing.
Tucker Carlson and Yannik Schrade discuss privacy, surveillance, and the world that Arcium is building with encrypted computing.
Yannik Schrade is an entrepreneur, computer scientist, and advocate for privacy-preserving technologies. As the founder and CEO of Arcium, he is building unstoppable cryptographic infrastructure for encrypted computing.
With a background in cryptography and distributed systems, Yannik has dedicated his career to empowering individuals and organizations with tools that protect their information while enabling more powerful computation.
Yannik is a strong advocate for privacy rights and cryptography, heavily influenced by cypherpunk ideas. He frequently speaks at major conferences worldwide, sharing his vision for a future where privacy is a fundamental freedom right, not a privilege, and a requirement for resilient digital infrastructure, national security and safe AI.
I write about privacy, technology, politics, game theory, and the intersection of all of them.
The EU is outlawing private communication, anonymous social media accounts, will scan your private messages and force you to register with your ID/passport everywhere online.
Yannik and Tucker Carlson talk about privacy, encryption, surveillance and the world Arcium is building.
Presenting the future of confidential computing at one of the largest crypto events in Abu Dhabi.
Why privacy is not optional in the age of AI and mass surveillance.
A deep dive into cryptographic techniques that will shape the next decade of computing.
The story behind creating a confidential computing network from scratch.
Announcing Arcium's acquisition of Inpher.
Why encryption matters for everyone.
I'm the founder and CEO of Arcium, where we're building the encrypted execution engine of the internet. Our mission is to enable the most powerful privacy-preserving applications without sacrificing performance or decentralization. We've raised over $15M from top-tier investors and assembled a world-class team of cryptographers and engineers to make this vision a reality.
I am the co-author and inventor of the Cerberus MPC (secure Multi-Party Computation) protocol which is the first practical, general purpose dishonest majority MPC protocol under security with identifiable abort. This novel security setup allows the protocol to be instantiated in trustless decentralized applications as security with identifiable abort ensures cheater identification. Cerberus in a cornerstone of the broader Arcium Protocol to power encrypted computing. The Cerberus MPC paper is planned to be published in Q1 2026 after final cryptographic peer-review.
In August 2025, I formalized a bandwidth-growth heuristic for secure Multi-Party Computation (MPC) protocols inspired by Nielsen's Law of Internet Bandwidth. This heuristic helps explain the hardware-based scalability of MPC protocols and classifies them into two categories: (1) latency-constrained and (2) bandwidth-constrained protocols. I have not yet published a full cryptographic paper about this "MPC Scaling Law" - it should additionally incorporate Moore's Law for local operations and contextualize scalability against lattice-based protocols. In the meantime, here is the concise version:
MPC Scaling Law. \( T(t, n, m) \approx S(n) + L_{\text{prop}} + \frac{m\,C(n)}{b_0\,B^t} + E(n) \) where \[ \lim_{n\to\infty} S(n) = \lim_{n\to\infty} E(n) = 0. \] Thus, asymptotically, \[ T(t, n, m) \to L_{\text{prop}} + \frac{m\,C(n)}{b_0\,B^t}. \]
Interpretation. As internet bandwidth grows by \( B \approx 1.5 \) (Nielsen: +50%) per year (\(t \in \mathbb{Z}_{\ge 0}\) from baseline year \(t := 0\) with initial bandwidth \(b_0\)), bandwidth-constrained \(n\)-party pairwise MPC (e.g., Cerberus, BDOZ, etc.) rounds become ≈33% faster each year until capped by the one-way propagation delay \(L_{\text{prop}}\). Beyond that point, total capacity scales with bandwidth as \(B^{1/p}\) (where \(C(n) \propto n^p\)). In particular, pairwise designs can add ≈50% more parties (\(n_{t+1} = \lfloor 1.5\,n_t \rfloor\)) or run ≈50% more parallel executions (\(m_{t+1} = \lfloor 1.5\,m_t \rfloor\)) per year without slowing rounds, with residual synchronization \(S(n)\) and error-correction \(E(n)\) costs asymptotically eliminated through protocol and network optimization.
I am the author of w25519, an open source cryptographic library for the Short-Weierstrass representation Curve25519 isomorphism for curve operations and Diffie-Hellman key exchange. The use of Short-Weiterstrass as representation allows for very efficient ECDH in R1CS for Zero-Knowledge-Proofs using Pippenger's Algorithm for ECM paired with plaintext divisions under certain conditions.
Before Arcium, I founded shiftscreen, at it's time one of the most sold productivity apps on the Apple App Store that enabled users to connect their iPad's and iPhone to external displays. I scaled the application to hundreds of thousands of customers across 130+ countries.
After high school I studied Law at the Heidelberg Law School. After founding shiftscreen, I dropped out of Law to study Computer Science and Mathematics at the Technical University of Munich. After founding Arcium I dropped out of college.
I believe privacy is the most important freedom right of the 21st century and beyond. As the world continues to shift deeper into the digital realm, strong and unbreakable privacy and encryption become essential. Yet the importance of privacy goes beyond being a core human right - our systems and architectures must be resilient and secure.
Privacy should however never be built as a limitation to innovation (otherwise it won't find adoption). I see the ultimate convergence of computing and privacy in encrypted computing - the ability to process data without ever seeing it.
To me, this is the foundational prerequisite for the advancement and flourishing of humanity. With my work on Arcium, I aim to build a better, more private, secure, and powerful internet. I want to enable a world where systems can operate without requiring trust. A world where people can interact without exposing anything. An internet that not only protects our privacy but also empowers stronger collaboration through encryption and secure computation.
I want to accelerate human progress and eliminate single points of failure.
Outside of my work on Arcium and advocacy for privacy, I am also involved in wildlife management and conservation.
(The picture above shows me releasing a young hawk after rescuing it and helping it recover.)