The earliest analysis of randomised algorithms in the theorem prover was almost certainly by Hurd [21] within the HOL technique, who modelled them by assuming the existence of the infinite sequence of random bits which packages can eat. He applied this approach to formalise the Miller–Rabin primality take a look at.Thanks for sharing your journey