In the pure theoretical thought experiment of Planck computers, let’s say an ai is trying to hide its password against the Planck computer who also happens to have unconstrained memory storage, then rotating password constantly yields geometric distribution and not rotating yields hypergeometric distribution for the probability of survival.
Caveat: The assumption of unconstrained memory probably means that the password cracking speed of the Planck computer has to be reduced. And checking guessed passwords probably incur computational burden as time goes on.
deleted by creator