According to the article, the original motivating problem posed by Terence Tao is to develop an algorithm that deterministically generates an N-digit prime in p

According to the article, the original motivating problem posed by Terence Tao is to develop an algorithm that deterministically generates an N-digit prime in polynomial time. The article says of the new algorithm: >The algorithm works for infinitely many input lengths, but it doesn’t cover all lengths of digits. There may still be some values of n out there for which the algorithm doesn’t deterministically produce a prime. So the advancement here is that they've "nearly solved" the problem posed by Tao, and maybe (hopefully) someone else will be able to build on their solution to fully solve the problem.