Latest Interviews

Heuristics and Biases

Sandor Lehoczky

Leveraging the foundational work of Daniel Kahneman and Amos Tversky, this presentation elucidates how human cognition relies on error-prone heuristics and the conflict between fast, intuitive System 1 thinking and slow, analytical System 2 reasoning. The discussion details empirical evidence of systemic biases such as loss aversion, anchoring, and confirmation bias, demonstrating their profound impact on diverse fields ranging from judicial parole decisions to financial market behavior. Rather than attempting to eliminate these innate flaws, the session advocates for strategic mitigation through meta-cognition, Bayesian updating, and the disciplined practice of overriding automatic responses to improve real-world decision-making outcomes.

Arjun Guha: On Verification for System Configurations Languages

Arjun Guha

Researchers developed "Rehearsal," a verification tool designed to detect determinism and idempotency violations in Puppet configuration manifests, which are frequent causes of major system outages. The system employs a transformation pipeline that converts complex Puppet syntax into Datalog and a low-level modeling language, leveraging the Z3 SMT solver alongside optimizations like partial order reduction and state pruning to analyze real-world code efficiently. Benchmarks on GitHub-scraped manifests demonstrate that this approach successfully identifies previously unknown non-deterministic bugs and generates fixes, although current limitations exclude shell script execution and specific file permission modeling.

How to Build an Exchange

Claudio, Ron, Pete

A US equities matching engine utilizes a deterministic, single-instance architecture to process three million messages per second while ensuring fair, latency-critical order execution across thousands of symbols. The system employs C++ and OCaml on a dedicated machine to replace complex distributed consensus with high-speed, single-threaded logic, allowing state machines to recover from failures within 30 to 60 seconds via message log replay. This design guarantees regulatory reproducibility and financial reliability by eliminating consensus overhead, enabling clients to achieve precise atomicity and global risk enforcement through simplified, high-throughput message sequencing.

Why Functional Programming Doesn't Matter

John Hughes, Tony Hoare

Jane Street, a high-frequency proprietary trading firm executing millions of daily trades, attributes its engineering success to OCaml's expressive static types rather than traditional functional features like laziness or strict purity. This type system enforces correctness by eliminating null pointer exceptions, forcing logic updates at compile-time to prevent bugs, and encoding business invariants to exclude impossible states. Consequently, the firm prioritizes predictable performance and verifiable clarity to protect its capital against errors, viewing advanced type systems as a more critical asset than higher-order functions or declarative purity.

Why OCaml

Approximately a decade ago, Jane Street adopted OCaml as its primary functional programming language to secure C-like performance and rigorous type safety while maintaining development conciseness. This strategic choice serves as a filtering mechanism for hiring, attracting highly motivated engineers through a specialized one-month training program that results in a consolidated, high-performing workforce. Although the firm faces ecosystem limitations compared to mainstream languages, the implementation of a single language across its multi-billion-dollar systems enables significant code reuse and shifts the priority from empirical testing to the universal guarantees of static type checking.

Effective ML 2011 Harvard CS51 Part 1

Ron Minsky

Ron Minsky, a technical leader at Jane Street Capital, presented a comprehensive case for prioritizing code correctness and maintainability through strict OCaml design principles that leverage the type system to enforce data invariants and ensure pattern match exhaustiveness. The lecture outlined specific architectural strategies, including mandatory interfaces, uniform naming conventions, and a "reader-over-writer" philosophy, which collectively minimize cognitive load and prevent silent failures in high-stakes financial systems. Additionally, the speaker addressed immediate course logistics by extending the Moogle project description deadline and recommending simple list-based implementations to avoid unnecessary debugging complexity.

Effective ML 2011 Harvard CS51 Part 2

Jane Street's engineering philosophy prioritizes explicit error handling, strict boilerplate avoidance, and managed complexity to ensure robust high-frequency trading systems. By leveraging OCaml's predictable performance and enforcing rigorous code review protocols alongside small, autonomous teams, the firm balances mathematical precision with human oversight in a hybrid trading model. This approach treats software development as a discipline of clarity and maintainability, where static typing and disciplined mutation control enable reliable operation in volatile markets.

Caml Trading

Carl Curry, Ron Minsky

Jane Street Capital, a proprietary trading firm operating in four global cities, transitioned its primary development stack to the functional programming language OCaml to satisfy critical demands for absolute correctness, high performance, and code maintainability. This adoption enables the firm's 35 core developers to leverage OCaml's powerful type system and algebraic data types for static exhaustiveness checks, ensuring the rigorous standards required to process billions of dollars in daily equity trades without error. While the language presents challenges in ecosystem maturity, the firm has actively mitigated these gaps through its Jane Street Summer Project and achieved superior hiring outcomes by attracting engineers skilled in functional paradigms.

Seven Implementations of Incremental

Incremental is an internal OCaml library that efficiently refreshes large computations by modeling logic as a dependency graph, allowing localized updates when only small data subsets change. Through eight iterative development phases, the team resolved critical academic limitations regarding garbage collection and dynamic graph restructuring, culminating in a production-ready V8 implementation that achieved a threefold speedup using generalized algebraic data types. This technology successfully transformed a slow trading system frontend into the suite's fastest application and is now being explored for reactive JavaScript compilation and efficient functional data structure diffing.