# Justin Sun Prize Celebrates Breakthroughs in Mathematics and AI-Assisted Research
## A New Era of Mathematical Recognition
The Office of Justin Sun has revealed the inaugural laureates of the Justin Sun Prize, an initiative designed to honor outstanding contributions to mathematics, formal verification, and AI-assisted scientific discovery. This first round of awards recognizes three exceptional researchers: independent number theorist Wouter van Doorn, mathematics Ph.D. student Quanyu Tang, and mathematics researcher Yanyang Li from Southeast University in Nanjing. Together, their work tackles six long-standing Erdős problems — some of the most challenging and influential questions in modern mathematics.
## Who Are the Recipients?
Wouter van Doorn is an independent mathematician who first developed his passion for number theory as an undergraduate in 2010. After completing his master’s degree, he chose to continue his research outside traditional academic institutions, building a career through collaboration and publication with mathematicians around the world. His contributions have demonstrated that impactful mathematical research is not confined to university walls.
Quanyu Tang is a doctoral student at the University of Science and Technology of China. His research interests span number theory, combinatorics, and the emerging field of AI-assisted mathematical discovery. Tang’s work reflects a growing trend in mathematics where computational tools and human intuition work hand in hand.
Yanyang Li, based at Southeast University’s School of Mathematics in Nanjing, joined forces with van Doorn and Tang on several of the awarded problems. Li’s participation highlights the importance of institutional collaboration in solving some of the most stubborn mathematical challenges.
## The Erdős Problems and Their Significance
Erdős problems are mathematical questions originally posed or popularized by the legendary Hungarian mathematician Paul Erdős, known for his prolific collaborations and his passion for elegant yet extraordinarily difficult problems. These questions often involve numbers, patterns, and mathematical structures, and many have resisted solution for decades. The catalog of Erdős problems, meticulously maintained by mathematician Thomas Bloom at the University of Manchester, contains over 1,200 entries, each representing a potential goldmine of discovery.
The three recipients made significant progress across several of these problems:
– **Problem #650:** Van Doorn, Tang, and Li worked together to determine exactly how many integers can always be matched to distinct multiples within a specified interval. Their solution offers a rare and compelling demonstration of how human mathematical judgment and artificial intelligence can complement each other in the proof process. ChatGPT was used to help develop the initial proof strategy, while Aristotle, an AI system specialized in mathematical reasoning, helped repair a gap during the Lean formalization process. The researchers then simplified the argument and wrote the final proofs and exposition.
– **Problem #369:** Van Doorn produced a computer-checkable proof in Lean, a software environment designed to verify mathematical reasoning. This problem concerns consecutive integers with restricted prime factors, a topic at the intersection of additive number theory and combinatorics.
– **Problem #457:** Also tackled by van Doorn, this question explores whether a short run of consecutive integers can collectively contain every prime within a given range — a deceptively simple-sounding question with deep implications.
– **Problem #469:** Van Doorn addressed this problem, which asks whether the reciprocals of a special class of numbers expressible as sums of their divisors add up to a finite total. The problem touches on foundational questions in number theory.
– **Problem #1044:** Tang resolved this problem independently, establishing a sharp lower limit for the boundary lengths of regions defined by polynomials — a result with applications in discrete geometry and optimization.
– **Problem #1196:** Tang contributed to a larger team effort alongside Li to solve this problem, which involves bounding weighted sums over sets of integers where no member divides another.
## A Philosophy of Open and Verifiable Mathematics
The Justin Sun Prize operates on a fundamentally different philosophy from traditional awards. It is decentralized and built on the principle that mathematical work should be evaluated based on the strength, rigor, and verifiability of the proof itself, rather than the prestige or reputation of the person presenting it. This approach democratizes mathematical recognition and encourages researchers from all backgrounds to contribute.
Justin Sun established the prize as a personal, long-term commitment to return wealth generated through mathematics and technology back to mathematics itself. The legacy of the prize is intended to be defined by the body of work it recognizes and the enduring significance of the laureates’ discoveries.
A defining feature of the prize is its emphasis on machine-verifiable proofs. By linking clearly defined mathematical challenges to formal verification systems like Lean, the initiative ensures that results are not only correct but independently checkable by anyone with access to the software. This commitment to openness, public benefit, and open-source access sets a new standard for academic recognition.
## Compensation and Accessibility
The prizes will be distributed in either USDT on the TRON blockchain (TRC-20 standard) or USDC on Ethereum (ERC-20 standard), allowing recipients to choose the platform that best suits their needs. This crypto-native approach to prize distribution reflects the Office of Justin Sun’s broader involvement in the blockchain ecosystem, led by TRON, which has processed over $13 trillion in volume since its inception and remains a leading blockchain for stablecoin transactions worldwide.
All information about the Justin Sun Prize, its problem catalog, recipient contributions, and application process is publicly available through the program’s GitHub repository, ensuring full transparency and accessibility to the global mathematical community.
—
## Frequently Asked Questions (FAQ)
**What is the Justin Sun Prize?**
The Justin Sun Prize is an academic initiative founded by Justin Sun to recognize and reward outstanding contributions to mathematics, formal verification, and AI-assisted scientific discovery. It prioritizes the rigor and verifiability of proof over the reputation of the researcher.
**Who are the first recipients of the Justin Sun Prize?**
The first confirmed laureates are independent number theorist Wouter van Doorn, mathematics Ph.D. student Quanyu Tang, and mathematics researcher Yanyang Li from Southeast University in Nanjing.
**What are Erdős problems?**
Erdős problems are mathematical questions posed or popularized by Hungarian mathematician Paul Erdős. They often involve questions about numbers, patterns, and mathematical structures, and many remain unsolved for decades. The catalog compiled by Thomas Bloom contains over 1,200 problems.
**How was AI used in the awarded research?**
For Problem #650, ChatGPT helped develop the proof strategy, while Aristotle — an AI system for mathematical reasoning — repaired a gap during the formalization of the proof in Lean. The researchers then refined the argument and wrote the final proofs manually.
**What is Lean, and why does it matter?**
Lean is a software environment designed for formal verification of mathematical proofs. It allows proofs to be checked by computer, ensuring a level of rigor that complements traditional mathematical exposition. The Justin Sun Prize explicitly values work that produces machine-checkable proofs.
**How are the prizes distributed?**
Winners can choose to receive their prize in either USDT on the TRON blockchain or USDC on Ethereum, depending on their preference.
**Where can I find more information?**
All details about the prize, including the problem catalog, recipient contributions, and submission guidelines, are available through the program’s public GitHub repository. For general information, you can visit the Office of Justin Sun’s official website.
**What is the philosophy behind the prize?**
The Justin Sun Prize is built on the belief that mathematical merit should be judged by the quality and verifiability of the proof itself, not by the prestige of the researcher. It promotes openness, public benefit, and access to mathematical knowledge for everyone.
—
## Conclusion
The inaugural Justin Sun Prize represents a meaningful shift in how the mathematical community recognizes and rewards research. By emphasizing verifiable proofs, embracing AI-assisted discovery, and decentralizing the evaluation process, the prize opens doors for researchers regardless of institutional affiliation or background. The contributions of van Doorn, Tang, and Li — spanning problems that have challenged mathematicians for years — demonstrate the power of human curiosity enhanced by modern computational tools. As the prize continues into future rounds, it has the potential to inspire a new generation of mathematicians to tackle some of the hardest unsolved problems in the field, with rigor, openness, and collaboration at the forefront.
Thank you for reading
