Worked on the google/heir repository to enhance the Polynomial dialect by integrating modular arithmetic operations into the fastNTT implementation, aligning types with ModArithType, and updating related MLIR files and tests. This integration improved the correctness and consistency of NTT and INTT modular arithmetic, supporting downstream polynomial arithmetic use cases. Additionally, contributed to llvm/offload-test-suite by correcting a documentation typo in the NumberParameters test, clarifying the maximum valid register space value and improving test maintainability. The work demonstrated proficiency in C++, MLIR, and compiler development, with a focus on low-level optimization, modular arithmetic, and rigorous code review and testing practices.