Chris Beck is an award-winning theoretical computer scientist and software engineer.
During his doctoral studies at Princeton, he developed new techniques for understanding
Time-Space trade-offs in Proof Complexity, and related areas in computational complexity theory.
His research was published in FOCS and STOC and the Siam Journal of Computing.
His research was supported by a Simons Fellowship, and he continued his studies as a Post Doc
in the Computer Science / Discrete Mathematics group at the Institute for Advanced Study in Princeton.
Chris also has long-standing interests in open source software development and low-level
systems programming. Chris worked as a software engineer on the Tesla Autopilot project from 2017-2018
on issues related to zero-copy serialization and shared-memory ring buffers.
Subsequently, Chris joined MobileCoin and worked on simple and direct ways to create SGX enclaves
from rust code and other low-level programming issues, as well as cryptography issues like,
creating ways to compute hashes for the blockchain that are safe, simple, and support schema evolution.
Chris later took a lead role in the design and implementation of the MobileCoin Fog project, which
is MobileCoin's solution to creating a fast and private integration for Signal app to use MobileCoin.
MobileCoin Fog is notable because it is the first production deployment of an Oblivious RAM web-service
to millions of users, which makes it possible to ensure that signal servers do not reveal any significant
information about payments.
Chris enjoys working on bleeding edge problems that require bringing ideas from theory into practice.
Chris particularly enjoys high-value problems where both performance and correctness are critical.