Eshan Chattopadhyay, associate professor at Cornell University and David Zuckerman, doctor of computer science at The University of Texas at Austin have been awarded the 2025 Gödel Prize. The prize was awarded for their research paper, “Explicit Two-Source Extractors and Resilient Functions, ” which presents a landmark solution to a central open problem in randomness extraction. Originally published in 2019, the report introduced a novel method for constructing obvious two-source extractors—mathematical devices used to create high-quality volatility from two moderately random sources. Eshan Chattopadhyay, an Indian-origin teacher, completed his PhD at The University of Texas at Austin before joining Cornell University. His analysis focuses on pseudorandomness, loop difficulty, and conversation difficulty. In 2021, he received the National Science Foundation CAREER Award. Expressing his love, Chattopadhyay said, “This reputation is truly an amazing respect. The Gödel Prize has celebrated some of the most beautiful and basic function in our area. It feels surreal—and greatly gratifying—that our report is being placed in that group. ”David Zuckerman earned his PhD from the University of California, Berkeley. He is commonly recognized for his fundamental contributions to pseudorandomness and computing difficulty. His influence in the field was earlier recognized with the 30-Year Test of Time Award at FOCS 2021. Zuckerman on being conferred the honor said, “Previously, most studies on randomness recovery focused on seeded compressors. ” “Now, our work—and the functions that followed —have demonstrated significant improvements in two-source recyclers and Ramsey maps. I hope this attracts fresh skills to the area, ” he added. Named after the famous mathematician Kurt Gödel, the Gödel Prize is simultaneously awarded by ACM SIGACT and the German Association for Theoretical Computer Science. It will be formally presented at the ACM Symposium on Theory of Computing (STOC ) in Prague this June.
