Aug 2023 – Feb 2025 · 1 yr 6 mos · Bengaluru, Karnataka, India · On-site

• Simulation Platform :
• Designed and built a simulation platform from scratch to replicate real-time customer order behavior in a staging environment.
• Engineered a system that leverages historical data and real-time customer patterns to mimic
• production-like order behavior.
• Developed a highly impactful system that enables the order fulfillment platform to assess critical. business metrics before deployment, ensuring better decision-making and operational efficiency.
• Rider Assignment Tech
• Tech Developments :
• Spearheaded the modularization of external service integrations, introducing a generic interface to seamlessly consume/produce events and handle RPC calls.
• Led the transition from RPC-based communication to an event-driven architecture, enhancing serviceability for both riders and restaurants.
• Feature Developments :
• Implemented large-order capability in the logistics platform to support high-volume deliveries.
• Introduced the Bonus Order Drop feature, allowing riders to choose drop locations conveniently, improving their experience and efficiency.
• Developed Busy Percentage and Order-Rider Ratio signals to optimize serviceability and boost delivery success rates.
• Rider Supply Tech :
• Built ZOMART from scratch—an all-in-one lifestyle platform for Zomato delivery partners to purchase essential assets, streamlining their experience and enhancing retention.

Jul 2022 – Aug 2023 · 1 yr 1 mo

• Co Lending Platform Team :
• Led the tech effort in building a self-serve in-house rule engine, enabling partner banks to experiment with lending policies and optimize co-lending strategies.
• Designed and implemented the M2 co-lending model (Direct Assignment) for the Navi Lending Cloud Platform, handling end-to-end architecture, solutioning, and deployment.
• Health Insurance Tech Team
• Tech Developments :
• Redesigned and refactored critical services like porting-service and policy-services, improving system efficiency and maintainability.
• Feature Developments :
• Launched the Provisional Policy feature, offering customers a policy with limited benefits and a grace period to retry payments after a failed transaction.
• Developed the EMI Date Change feature, allowing customers to reschedule their EMI date after their last payment for greater flexibility.
• Led the end-to-end platform integration for "Navi Total Hospitalisation", configuring the product from scratch and ensuring a seamless launch.

Jun 2021 – Jul 2022 · 1 yr 1 mo

• Health Insurance Tech
• Tech Developments :
• Migrated old retail products to the V2 format, streamlining cancellation and claims processing.
• Consolidated pricing logic from multiple services into the Premium Engine, improving accuracy and maintainability.
• Enhanced Product Service and Payment Service by transforming sequential processes into asynchronous, parallel, and non-blocking executions, boosting efficiency.
• Integrated Grafana, introduced new metrics and alerts, and refined logging for improved monitoring and debugging in the Product Service and Premium Engine.
• Feature Developments :
• Envisioned and led the end to end effort to create a portal for seamless configurations of new insurance products, benefits and plans reducing experimentation turnover times from 1-1.5 week to 2-3 days
• Centralized GST calculation within the Premium Engine, ensuring consistent tax computation across services.
• Key Initiative(Insurance Product Configuration Portal) :
• Envisioned and led the end-to-end development of a self-serve portal for seamless configuration of new insurance products, benefits, and plans.
• Reduced experimentation turnover time from 1–1.5 weeks to just 2–3 days, significantly accelerating go-to-market speed and operational efficiency.

Jul 2020 – Jul 2021 · 1 yr · Mumbai, Maharashtra, India

• On eventual non negativity of sets of matrices : Theory and applications in Probabilistic Control systems, Termination of Linear loop Systems and Formal Verification of Linear Systems
• 1) Lower Bound Result : Proved the problem is coNP hard.
• 2) Showed that the problem is in PSPACE for Matrices of unbounded order with distinct eigenvalues and is in PTIME for Matrices which are of fixed order and have distinct eigenvalues or are of fixed order less than 6 by reducing it to a well known variant of the Skolem Problem i.e the Ultimate
• Positivity Problem.
• 3) Identified a subclass of LRS’s, for which the Ultimate Positivity problem is equivalent to
• the Eventual Non negativity problem.
• 4) Proved that the Strict Ultimate Positivity is decidable in PTIME, for this new subclass of matrices which is orthogonal to previously known classes of matrices for which the Ultimate Positivity or the Strict Ultimate Positivity problem is decidable.

Jul 2019 – Jul 2021 · 2 yrs · Mumbai, Maharashtra, India

• Teaching Assistant for the following courses at IIT Bombay :
• 1) Foundations of Verification and Automated Reasoning(CS-771)
• 2) Automata Theory(CS-310)
• 3) Computer Architecture and Organization(CS-305/341)

Jul 2018 – Apr 2019 · 9 mos · Shibpur

• Optimization problems on set of Isothetic line segments :
• 1) Objective : To find the maximum width, axis parallel, empty rectagular annulus for a set of Isothetic line segments.
• 2) Survey of recent works : Algorithms, Bounds, Decidability results, Approximations of the problem and related work.Designed a Poly-time Algorithm to decide the min-width annulus. Obtained quartic upper bounds as a result.
• 3) Deduced that, a Greedy approach will work, when the line segments follow a special arrangement of no overlaps. Worked on an Alternative Problem : Finding a maximum independent set of isothetic line segments in a plane.
• 4) Extended an existing algorithm for a decidable subclass of the problem (for Outer-segment graphs) for square-graphs. Explored a few applications of this problem in the domain of Train Scheduling and Classroom Scheduling.

May 2018 – Jul 2018 · 2 mos · Noida, Uttar Pradesh, India

• Topic : Design and Verification of SD-Card features version 6.0
• Objectives :
• 1) Getting Familiar with Verilog, System Verilog, UVM methodology and the internal specifications of SD-Card Version 6.00.
• 2) Writing Tests/Sequences/Stimulus and generating coverpoints for testing the new features added in SD-Card after Spec version 4.20
• 3) Report bugs in the code if possible
• Results :
• Succesfully came up with a Verification and Coverage Plan for the COP and CQ features of the SD-Card and generated 32 coverpoints to test all possible scenarios related to these features. Challenges faced included the timings and status of the SD-card when the coverpoints were sampled so that mis-hit of coverpoints could be avoided.
• Initial tests were able to cover 81.7% of the coverpoints, After writing the new tests, 100% coverage could be acheived.
• Industrial Exposure :
• Working Knowledge about the Chip design cycle, especially the Functional Verification part. Exposure to industrial work culture and methodologies. Experience of Project Design and Planning.

May 2017 – Jul 2017 · 2 mos · Bengaluru, Karnataka, India

• CRYPTOGRAPHY AND INFORMATION SCEURITY LAB, CSA dept. IISc
• Algorithms for Fault Tolerant Consensus :
• 1) Extensive analysis on probabilistic protocols for achieving byzantine agreement in optimal time complexity in a distributed setting. Implemented primitive encryption and decryption schemes and Secure Multi Party Computation protocols.
• 2) Presented relevant research papers for the protocol : Polynomial Byzantine Agreement by Dolev-Strong, as a part of the reading group. Active participant/researcher at Secure MPC workshop.

Sep 2016 – Mar 2017 · 6 mos · Greater Kolkata Area

• Android Application for Location Sharing :
• Developed an Android based application for sharing location. Coded the client interface using the Google Maps API to track location of the users by their Gmail-ID. Implemented a scalable server using Java Sockets.

May 2016 – Jul 2016 · 2 mos · Kharagpur I, India

• Memory Optimization for Symmetric Key Encryption :
• Implemented the DES, 2-DES, 3-DES encryption and decryption protocols, analyzed the possible cryptographic attacks to break the encryption schemes and designed a memory optimized version of the attacks.