Jane Street
Showing 61–75 of 112 transcripts.
- 1h 10m
Compiler Optimization with Greta Yorsh
Jane Street compiler engineer Greta Jorsch presents a strategic shift toward combining formal verification with targeted testing and super optimization to address the undecidability limits of pure verification in compiler design. Her team's implementation of sampling-based Feedback-Directed Optimization in the OCaml compiler achieved 10–20% performance gains by stabilizing runtime behavior and minimizing cache misses while managing the trade-off between portability and architecture-specific micro-optimizations. Jorsch advocates for open-sourcing these performance tooling benchmarks to influence upstream development, emphasizing that modular compiler passes can balance internal innovation with community maintainability.
- 1h 2m
Multicast and the Markets with Brian Nigito
Over the past two decades, securities exchanges have transitioned from physical floors to highly regulated, electronic ecosystems where ultra-low latency determines competitive advantage. To achieve this, firms utilize specialized networking architectures like UDP multicast and co-located hardware to distribute market data faster than standard internet protocols allow, while relying on custom recovery layers and sequencer models to ensure transactional reliability. As hardware speeds approach 25 Gbps, the industry is increasingly shifting from general-purpose servers to specialized FPGAs and custom network cards to manage serialization delays and maintain deterministic performance.
- 58 min
Build Systems with Andrey Mokhov
This presentation analyzes the historical evolution of build systems, highlighting the enduring dominance of `Make` and its specific technical limitations regarding scalability and complexity, as illustrated by the GHC migration to Hadrian. It introduces a theoretical framework that decomposes build architectures into schedulers and rebuilders to propose innovations like Cloud Shake, while examining industry-specific implementations at Jane Street, such as the Dune and Jenga systems. The discussion concludes by exploring emerging trends toward fine-grained incrementality, IDE integration, and the broader convergence of build tools with general-purpose incremental computation models.
- 59 min
Programmable Hardware with Andy Ray
Jane Street leverages FPGA and ASIC hardware to achieve deterministic, line-rate processing for high-frequency financial trading, overcoming the latency and scalability limitations inherent in general-purpose software. To modernize this engineering workflow, the firm utilizes HardCAML, an open-source domain-specific language built on OCaml that enables composable, test-driven hardware design comparable to modern software development. By releasing specialized libraries and realistic examples, Jane Street aims to lower the barrier to entry for complex hardware engineering and accelerate industry-wide adoption of rigorous, software-style verification practices in chip design.
- 12 min
Real Numbers – Episode 16, Finale
The final episode of Season 1 of *Real Numbers* derives five distinct mathematical solutions to the geometric distribution problem of calculating the expected number of half-court shots Danielle needs to make. The episode further analyzes a bonus problem involving two consecutive successes, demonstrating via a recursive state method that the expected attempts equal 30 rather than the intuitive estimate of 25. Concluding the season, the host solicits listener feedback on problem topics, format changes, and potential mathematical depth for the upcoming second season.
- 11 min
Real Numbers – Episode 15, The Half Court Shot
Host discusses probability theory by solving a problem where a student named Jayden schedules two or three exams across five weekdays, calculating expected spans of 1.6 and 2.4 days respectively through enumeration and linearity of expectation. The episode transitions to a new challenge involving a basketball player named Danielle who makes 20% of her half-court shots, asking listeners to determine the expected attempts needed for a single success and for two consecutive makes. While the mathematical framework for the exam scenarios is fully derived and verified, the solution to Danielle's geometric distribution problem remains pending for the listener to solve.
- 6 min
Real Numbers – Episode 14, Finals Week
In this Real Numbers episode, the host explores expected value applications by challenging listeners to calculate the average interval between randomly scheduled final exams and reviewing a previous problem on the expected number of distinct snowboards used over six days. The snowboard scenario is resolved by demonstrating two distinct approaches using indicator variables and the linearity of expectation, both confirming that a user will sharpen approximately 3.99 different boards on average. The episode concludes by inviting the audience to submit their own solutions and alternative problem ideas for future episodes focused on mathematical expectation.
- 6 min
Real Numbers – Episode 13, How Many Snowboards Need Sharpening
This instructional session applies the linearity of expectation to calculate expected values in scenarios involving both independent and dependent selections. Using the marching band example, the analysis demonstrates how fixed global distributions alter probabilities while the method for summing indicator variables remains valid regardless of independence. The presentation concludes by challenging the audience to utilize this specific probabilistic framework to determine the expected number of snowboards requiring sharpening in a student-led lesson environment.
- 10 min
Real Numbers – Episode 12, Photographing the Chaotic Marching Band
The episode explores expected value and the linearity of expectation by first applying these concepts to a conditional probability problem involving a haunted forest monster. The instructors update monster type probabilities based on a 4-damage roll to calculate a resulting expected value of 5.5 for the second attack. The session concludes by introducing a problem of the week that contrasts independent choice scenarios with fixed pool distributions to determine the expected number of synchronized rows in a marching band.
- 10 min
Real Numbers – Episode 11, The Unknown Monster
The episode calculates the expected damage of a random monster attack by weighting uniform distributions across three difficulty tiers and determines the conditional expectation of a second attack following a four-damage outcome. A prior review solves the geometric optimization of a painting passing through a composite window, utilizing the Power of a Point theorem to prove the maximum height corresponds to the Golden Ratio. Both segments demonstrate how probabilistic weighting and geometric theorems can simplify complex mathematical problems into elegant, closed-form solutions.
- 8 min
Real Numbers – Episode 10, The Art Thief at the Window
A geometric puzzle challenge asks viewers to calculate the maximum height of a rigid three-meter wide rectangular painting that can pass through a composite window formed by a one-meter square topped with a semicircle. The episode also details a river crossing scenario where a boat with a motor speed five-thirds of the current's velocity requires an upstream aiming point of 127.5 meters to reach a specific dock. Both problems are solved using algebraic quadratic equations and verified through geometric properties like similar triangles and the tangent double-angle formula, inviting the audience to submit their own solutions for the window problem.
- 7 min
Real Numbers – Episode 08, Crossing the River
Host Sawyer presents a physics challenge where viewers must calculate the precise aiming angle required for a boat traveling at an unknown speed to cross a 100-meter wide river with an unknown current and land at a specific downstream dock. The segment also revisits a previous geometry problem, confirming that reshaping a hemispherical slush cone involves removing a 3-cm radius circular section and moving a volume of $40\pi/3$ cubic centimeters. Sawyer concludes the episode by inviting the audience to submit their navigational bearings and diagrams for the river crossing solution.
- 7 min
Real Numbers – Episode 05, Grandma's Secret College Fund
This episode concludes a probability series by applying Bayes' theorem to a piggy bank scenario where a drawn $20 bill updates the prior probability that a grandmother added either a one or twenty-dollar note on Sunday. The discussion briefly recapitulates a previous DMV exam study analysis that established a 73.3% probability of an applicant having studied given they passed. To finalize the segment, the hosts invite viewers to submit their solutions to the piggy bank problem and propose mathematical topics for the upcoming transition to geometric problems.
- 7 min
Real Numbers – Episode 04, Passing Your Driver's Test
This episode introduces Bayes' theorem to invert conditional probabilities, utilizing a DMV exam scenario to demonstrate calculating the likelihood that a passing applicant studied. The presentation further details Jane Street's business application of Bayesian inference for validating mathematical models against empirical data and derives the underlying proof using the commutative property of logical intersection. Concurrently, the summary resolves a prior probability challenge involving a card game where specific disjoint scenarios combine to yield a one-in-78 chance of losing an Ace on the first turn. Viewers are now tasked with solving the DMV problem using the provided formula, with the solution to be revealed in a future challenge.
- 7 min
Real Numbers – Episode 03, A Perfectly Balanced War
In a "Real Numbers" segment, hosts analyze probability within the card game War using a reduced 26-card deck where Clara holds all Clubs and Damien holds all Diamonds to calculate the likelihood of Clara winning an Ace in the first battle. The episode explains how to solve this dependent event problem using conditional probability formulas and contrasts them with previous methods for finding consecutive taxi sequences, specifically the state machine and inside-out logic approaches. Viewers are encouraged to submit their own calculations for the card game scenario and propose mathematical extensions for future episodes.