The article talks about a recent paper[1] by one of the interviewees that uses McMahon partition functions for primality testing. I wonder how its running time of compares to that of the AKS primality test, and something more practical like BPSW.[2] Could it find an application in practical cryptography?

1. https://arxiv.org/abs/2405.06451v2

2. https://en.wikipedia.org/wiki/Baillie%E2%80%93PSW_primality_...