RYRahul Yesantharao

Rahul Yesantharao

*This is an algorithmically generated author record based on publicly available information.

Rahul Yesantharao has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Hardcaml: An OCaml Hardware Domain-Specific Language for Efficient and Robust Design

    by Andy Ray, Benjamin Devlin, Fu Yong Quah, Rahul Yesantharao

    Hardcaml is an embedded hardware design domain specific language (DSL) implemented in the OCaml programming language. Unlike high level synthesis (HLS), Hardcaml allows for low level control of the underlying hardware for maximum productivity, while abstracting away many of the tedious aspects of traditional hardware definition languages (HDLs) such as Verilog or VHDL. The richness of OCaml's type system combined with Hardcaml's fast circuit elaboration checks reduces the chances of user-introduced bugs and erroneous connections with features like custom type defining, type-safe parameterized modules and elaboration-time bit-width inference and validation. Hardcaml tooling emphasizes fast feedback through simulation, testing, and verification. Hardcaml includes both a native OCaml cycle-accurate and event-driven simulator, along with backend support for external simulators such as Verilator. Unit tests can live in the source code, which can optionally include digital ASCII waveforms representing the simulator's output. Hardcaml also provides tools for SAT proving and formal verification. For several years Hardcaml has been industrially proven in many FPGA designs internally in Jane Street.


  • Open Access

    Hardcaml MSM: A High-Performance Split CPU-FPGA Multi-Scalar Multiplication Engine

    by Andy Ray, Benjamin Devlin, Fu Yong Quah, Rahul Yesantharao

    This paper presents a split CPU-FPGA Multi-Scalar Multiplication (MSM) engine written in Hardcaml. Hardcaml MSM was submitted to the 2022 ZPrize cryptography competition and won 1st place in the FPGA track. Hardcaml MSM targets the BLS12-377 elliptic curve and is currently the lowest-latency implementation utilizing FPGAs published. For a MSM of order 2^26 we achieve a single-round MSM latency of 5.518s and average power of 52W, with our design running at 278MHz. When performing multiple rounds of MSM with the same base points but random scalars, we are able to further mask host I/O and memory latency and reduce latency to 5.083s. This is a latency improvement of 13% over the previously fastest reported FPGA solution, and an improvement of 472% when compared to state of the art open-source CPU library gnark-crypto.