Ch. 122Questions from a Turing Award Winner
Xiao Yi gave a talk demonstrating applications of his expansion across several areas of mathematics, including progress on the Riemann Hypothesis. During the Q&A, Turing Award winner Silvio Micali asked how the expansion might improve blockchain security, leaving Xiao Yi surprised by the audience’s computer science questions.
- Xiao Yi explained that his factorization sieve solution had made RSA encryption more secure and reduced the key length needed to match ECC.
- Xiao Yi showed how his expansion could push the Riemann Hypothesis critical-line result from 61% to 62.5%, then explored the Bohr-Landau theorem and other mathematical applications.
- Xiao Yi finished his thirty-minute presentation and opened the floor to questions, with more than a hundred attendees raising their hands.
- Silvio Micali introduced himself as an MIT professor and Turing Award winner, then asked whether Xiao’s expansion could strengthen blockchain cryptocurrencies and other blockchain applications.
- Xiao Yi was surprised to learn that the audience’s questions would extend beyond pure mathematics.