Jiangqi Dai Has Built An Academic Profile That Stands Out Across Both Mathematics And Computer Science. His Name Became Especially Notable Through The William Lowell Putnam Mathematical Competition, Where He Was Named One Of The Five Highest-Ranking Individual Competitors In Both 2023 And 2024. His Record Also Extends Into International Programming, Including A Gold Medal At The 2022 International Olympiad In Informatics And A Perfect 600-Point Score.
What Makes Jiangqi Dai Particularly Interesting Is The Combination Of These Achievements. He Has Demonstrated Exceptional Ability In Mathematical Problem-Solving, Algorithmic Programming, And More Advanced Theoretical Computer Science Research. By 2025, His Research With Mohsen Ghaffari And Julian Portmann Had Reached The IEEE Symposium On Foundations Of Computer Science, Commonly Known As FOCS, One Of The Major Conferences In The Field.
Quick Bio Information
| Information | Details |
|---|---|
| Full Name | Jiangqi Dai |
| Academic Institution | Massachusetts Institute Of Technology |
| Academic Area | Mathematics And Computer Science |
| Known For | Mathematics And Competitive Programming |
| Putnam Recognition | Putnam Fellow In 2023 And 2024 |
| 2023 Putnam Status | One Of The Five Highest-Ranking Individuals |
| 2024 Putnam Status | One Of The Five Highest-Ranking Individuals |
| Putnam Award | $2,500 For Each Fellowship |
| IOI Year | 2022 |
| IOI Result | Gold Medal |
| IOI Score | 600 Out Of 600 |
| IOI Rank | Joint First Place |
| IOI Country | China |
| ICPC World Finals | 2024 |
| ICPC Result | 11th Place |
| AtCoder World Tour Finals | 2025 And 2026 |
| 2025 AtCoder Result | 3rd Place |
| 2026 AtCoder Result | 1st Place |
| FOCS Research | Arboricity Approximation |
| Research Co-Authors | Mohsen Ghaffari And Julian Portmann |
| Research Conference | FOCS 2025 |
Who Is Jiangqi Dai?
Jiangqi Dai Is An MIT-Associated Student And Researcher Whose Public Record Shows An Unusual Combination Of Mathematical And Computational Achievement. Rather Than Being Known For A Single Award, Jiangqi Dai Has Built A Record Across Several Different Types Of Difficult Competitions And Academic Work.
His Putnam Achievements Demonstrate Advanced Mathematical Problem-Solving, While His International Programming Results Demonstrate Strong Algorithmic Skills. His Later Research Record Adds Another Dimension, Showing An Ability To Move From Solving Carefully Designed Competition Problems Toward Open-Ended Questions In Theoretical Computer Science.
Jiangqi Dai’s Education At MIT
Jiangqi Dai Is Associated With The Massachusetts Institute Of Technology, An Institution Particularly Well Known For Mathematics, Computer Science, Engineering, And Scientific Research. MIT Has Also Developed A Particularly Strong Tradition In The Putnam Competition, And Dai’s Own Results Became Part Of That Tradition.
Public MIT Records Confirm His Participation As An MIT Undergraduate In The 2023 And 2024 Putnam Competitions. In 2023, MIT’s Putnam Team Finished First, While All Five Putnam Fellows Came From MIT. Dai Was Among Those Five.
Jiangqi Dai And The Putnam Mathematical Competition
The Putnam Competition Is One Of The Best-Known Mathematics Competitions For Undergraduate Students In The United States And Canada. It Is Famous For Problems That Require Creativity, Proof, Careful Reasoning, And The Ability To Discover An Elegant Solution Rather Than Simply Apply A Standard Formula.
The Competition Is Held In Two Three-Hour Sessions On A Single Saturday, Making Both Mathematical Ability And Concentration Important. The Five Highest-Ranking Individual Competitors Are Named Putnam Fellows. The 2024 Winners Announcement Confirms That Jiangqi Dai Was Among Those Five Highest-Ranking Individuals.
Jiangqi Dai’s Two-Time Putnam Fellow Achievement
One Of The Most Important Facts About Jiangqi Dai Is That His Putnam Success Was Not A One-Time Result. He Was A Putnam Fellow In The 2023 Competition And Again In The 2024 Competition. MIT’s Mathematics Department Lists Him Among The 2023 Fellows, And MIT News Later Confirmed His Second Fellowship In 2024.
His First Fellowship Came During His First Year At MIT, According To MIT News. The 2023 Competition Produced Five Putnam Fellows, And Dai Was One Of Them. Each Fellow Received A $2,500 Award. The Following Year, Dai Repeated The Achievement, Again Joining The Five Highest-Ranking Individual Competitors.
His Outstanding Competitive Programming Career
Jiangqi Dai’s Record Is Not Limited To Traditional Mathematics. His Competitive Programming Career Is Equally Striking. Competitive Programming Requires Participants To Turn Mathematical Ideas Into Working Algorithms, Usually Under Strict Time Limits And With Large Or Difficult Inputs.
This Difference Matters. A Person Can Be Strong At Mathematical Proof Without Being An Exceptional Programmer, Just As A Strong Programmer May Not Be Comfortable With Abstract Mathematical Problems. Jiangqi Dai’s public competition record shows strength in both areas, which helps explain why his profile is especially notable among students interested in algorithms and theoretical computer science.
Jiangqi Dai And The International Olympiad In Informatics
Before His MIT Putnam Success, Jiangqi Dai Had Already Established Himself Internationally Through The International Olympiad In Informatics, Or IOI. At The 2022 IOI In Yogyakarta, Indonesia, He Represented China And Finished With A Gold Medal And A Perfect Score Of 600 Out Of 600.
The Official IOI 2022 Results Show Jiangqi Dai In Joint First Place With Shaoxuan Tang, With Both Competitors Scoring 600 Points. Dai Received Full Marks Across All Six Scored Tasks.
This Result Is Particularly Significant Because The IOI Is Designed Around Advanced Algorithmic Problem-Solving. Competitors Need To Analyze Problems, Develop Efficient Algorithms, Implement Their Ideas Correctly, And Perform Under Competition Conditions. Dai’s Perfect Score Provides A Concrete Measure Of His Exceptional Programming Ability.
Jiangqi Dai At The ICPC World Finals
Jiangqi Dai Also Reached The International Collegiate Programming Contest World Finals With MIT. His 2024 Team Finished 11th Overall According To The Public Competition Record, And The Team Was Also Recognized As The North America Champion.
The ICPC Is Different From The IOI Because It Is A Team Competition. This Means Success Requires More Than Individual Algorithmic Ability. Team Members Must Divide Problems Effectively, Communicate Clearly, Manage Time, And Decide Which Problems Offer The Best opportunities for points.
For Jiangqi Dai, The ICPC Result Added Another International Achievement To A Record That Already Included The IOI And Putnam Competition.
Jiangqi Dai’s AtCoder Achievements
His Competitive Programming Record Continued To Develop After His Earlier International Success. The available competition record lists Jiangqi Dai In Third Place At The 2025 AtCoder World Tour Finals Algorithm Competition. It Also Records Him Finishing First At The 2026 AtCoder World Tour Finals Algorithm Competition, With A Score Of 4,300 Out Of 8,300.
These Results Are Useful When Looking At Jiangqi Dai’s Development Over Time. His Achievements Were Not Confined To A Single Period As A High-School Competitor. His Record Shows Continued Success In Highly Competitive Algorithmic Events Into 2025 And 2026.
Jiangqi Dai’s Research In Theoretical Computer Science
Competition Success Is Only One Part Of Jiangqi Dai’s Academic Story. His Research Record Shows A Transition Toward Theoretical Computer Science, Where The Goal Is Not Simply To Win A Contest But To Develop New Ideas That Can Advance A Research Area.
One Of His Most Visible Research Contributions Is The Paper “Constant Approximation Of Arboricity In Near-Optimal Sublinear Time,” Written With Mohsen Ghaffari And Julian Portmann. The Paper Was Accepted To FOCS 2025 And Appears In The Conference Proceedings On Pages 552–564.
Research With Mohsen Ghaffari And Julian Portmann
The Paper’s Topic May Sound Highly Technical, But Its Core Idea Can Be Explained More Simply. A Graph Is A Mathematical Structure Made Up Of Vertices And Edges. Graphs Are Used To Represent Networks, Connections, Relationships, And Many Other Systems.
Arboricity Is A Way Of Describing How Densely Edges Are Distributed Within A Graph. The Research By Jiangqi Dai, Mohsen Ghaffari, And Julian Portmann Develops A Randomized Algorithm That Produces A Constant-Factor Approximation Of A Graph’s Arboricity While Using A Near-Optimal Number Of Queries To The Graph’s Adjacency Lists.
The Authors Explain That Their Method Uses Approximately (\tilde{O}(n/\lambda)) Queries And Time, Where (n) Represents The Number Of Vertices And (\lambda) Represents Arboricity. Their Result Improves On An Earlier (O(\log^2 n)) Approximation That Had The Same Query And Time Complexity.
Why His Research Matters
The Importance Of This Work Goes Beyond A Single Mathematical Quantity. Large Graphs Can Contain Vast Numbers Of Connections, And Algorithms That Need To Inspect Every Part Of A Graph Can Become Expensive. Sublinear Algorithms Try To Learn Useful Information Without Reading The Entire Input.
The Research Also Addresses A Difficult Technical Issue In Randomized Recursive Algorithms. According To The Paper’s Abstract, The Approach Runs Multiple Recursions In Parallel And Uses A Careful Scheduling Mechanism To Control The Effects Of Bad Random Samples. The Authors Suggest That This Parallelism And Scheduling Idea Could Be Useful In Other Sublinear Algorithms That Depend On Probabilistic Recursion.
Mathematics And Computer Science Together
Jiangqi Dai’s Record Makes More Sense When Mathematics And Computer Science Are Viewed As Connected Rather Than Completely Separate Subjects. The Putnam Competition Tests Abstract Mathematical Reasoning, While The IOI And AtCoder Test Algorithmic Construction And Programming.
The Research On Arboricity Brings These Skills Together. Graph Theory Is Deeply Mathematical, Yet Graph Algorithms Also Need Efficient Computational Methods. This Combination Helps Explain Why A Student With Strong Mathematical Problem-Solving Skills Can Be Especially Effective In Theoretical Computer Science.
What Makes Jiangqi Dai’s Achievements Remarkable?
The Most Impressive Feature Of Jiangqi Dai’s Record Is Its Breadth. He Was A Perfect-Score IOI Gold Medalist, A Two-Time Putnam Fellow, An ICPC World Finals Competitor, A High-Level AtCoder Competitor, And A Co-Author Of Research Published At FOCS.
Each Achievement Measures Something Slightly Different. The IOI Shows International Programming Excellence. The Putnam Results Demonstrate Exceptional Undergraduate Mathematical Ability. The ICPC Result Shows Team-Based Algorithmic Skill. AtCoder Demonstrates Continued Individual Competitive Strength. His FOCS Paper Shows That His Work Has Also Entered Formal Academic Research.
Jiangqi Dai’s Academic Strengths And Areas Of Expertise
Based On His Public Record, Jiangqi Dai’s Major Areas Of Strength Include Mathematics, Algorithms, Competitive Programming, Graph Problems, And Theoretical Computer Science. It Is Important, However, Not To Turn These achievements Into Unsupported Claims About His Entire Academic Career.
The Evidence Supports A Clear Picture: He Has Demonstrated Exceptional Problem-Solving Ability Across Mathematical And Computational Settings, And His Research Record Shows That These Skills Have Been Applied To Advanced Questions In Algorithms And Graph Theory.
Jiangqi Dai’s Influence And Future Potential
Because Jiangqi Dai Is Still At An Early Stage Of His Academic Career, It Is Better To Focus On His Documented Work Rather Than Predict A Specific Future Career. His existing record already provides a strong foundation for further research in algorithms, theoretical computer science, mathematics, or related fields.
His 2026 Competitive Programming Success Also Shows That His Technical Skills Remain Highly Competitive. At The Same Time, His FOCS Research Indicates A Move Beyond Competition Toward Original Academic Work. That Combination Makes His Future Academic Development Worth Following.
What Can Students Learn From Jiangqi Dai’s Journey?
Jiangqi Dai’s Public Achievements Offer A Useful Lesson About The Value Of Deep Problem-Solving Skills. His Record Does Not Suggest That Mathematics And Programming Must Be Learned In Isolation. Instead, The Two Can Reinforce Each Other.
Mathematical Thinking Can Help With Algorithms, While Programming Provides A Practical Way To Test And Implement Ideas. Competition Can Develop Speed And Precision, While Research Develops Patience, Creativity, And The Ability To Work On Questions Without A Known Answer. Dai’s Journey Shows How These Different Experiences Can Come Together Over Time.
Final Thoughts
Jiangqi Dai Has Developed A Remarkable Public Academic And Competition Record In A Relatively Short Period. His Two Putnam Fellow Honors Place Him Among The Top Individual Performers In One Of The Most Prestigious Undergraduate Mathematics Competitions. His Perfect 600-Point IOI Result Demonstrates A Different Kind Of Excellence In Algorithmic Programming, While His ICPC And AtCoder Results Show That His Competitive Skills Continued To Develop.
Perhaps The Most Interesting Part Of Jiangqi Dai’s Story Is What Happened Beyond Competitions. His Co-Authored FOCS 2025 Paper Shows A Transition From Solving Challenging Problems Under Competition Conditions To Contributing To Research In Theoretical Computer Science. That Combination Of Mathematical Depth, Programming Skill, And Research Experience Gives His Profile A Distinctive Character.
For Readers Searching For Jiangqi Dai’s Biography, Education, Achievements, Research, Or MIT Connection, The Available Evidence Presents A Clear Picture Of An Exceptionally Strong Young Mathematician And Computer Scientist. His Story Is Not Simply About Awards. It Is About The Development Of Skills That Connect Mathematics, Algorithms, And Research.
FAQs About Jiangqi Dai
Who Is Jiangqi Dai?
Jiangqi Dai Is An MIT-Associated Student And Researcher Known For Exceptional Achievements In Mathematics And Competitive Programming. He Has Been A Putnam Fellow Twice And Has Also Achieved Major International Results In Programming Competitions.
Is Jiangqi Dai An MIT Student?
Yes. Public MIT Records Identify Jiangqi Dai With MIT And List Him Among The Institute’s Putnam Fellows. His Research Paper With Mohsen Ghaffari Also Identifies His Affiliation As MIT.
How Many Times Has Jiangqi Dai Been A Putnam Fellow?
Jiangqi Dai Was A Putnam Fellow In 2023 And Again In 2024. MIT News Described His 2024 Result As His Second Putnam Fellowship.
What Did Jiangqi Dai Achieve At The IOI?
At The 2022 International Olympiad In Informatics, Jiangqi Dai Won A Gold Medal And Finished In Joint First Place With A Perfect Score Of 600 Out Of 600.
What Is Jiangqi Dai Known For In Competitive Programming?
His Public Competition Record Includes First Place At The 2022 IOI, 11th Place At The 2024 ICPC World Finals, Third Place At The 2025 AtCoder World Tour Finals, And First Place At The 2026 AtCoder World Tour Finals.
What Research Has Jiangqi Dai Published?
Jiangqi Dai Co-Authored “Constant Approximation Of Arboricity In Near-Optimal Sublinear Time” With Mohsen Ghaffari And Julian Portmann. The Paper Was Published In The Proceedings Of FOCS 2025 And Addresses Efficient Approximation Of Graph Arboricity.
Who Are Jiangqi Dai’s Research Co-Authors?
The FOCS 2025 Research Paper Was Co-Authored By Jiangqi Dai, MIT Professor Mohsen Ghaffari, And Julian Portmann.
Why Is Jiangqi Dai’s Academic Record Notable?
His Record Combines Several High-Level Achievements That Usually Appear Separately: Top-Level Undergraduate Mathematics, A Perfect-Score International Informatics Result, Strong International Programming Results, And Published Research In Theoretical Computer Science. Together, These Achievements Make Jiangqi Dai A Particularly Interesting Figure To Follow In Mathematics And Computer Science.
Learn more and explore exciting content on: Shaoqing Ren: Biography, Career, Research, and Achievements
Leave a Reply