Inspired by Find the largest fragile prime
A recurring prime (or whatever you choose to call it) is a prime that, when removing leading digits, always remain prime regardless of how many digits are removed.
for example 6317 is a recurring prime because... 317 is a recurring prime because... 17 is a recurring prime because... 7 is a prime
727 is a prime but not a recurring prime because 27 is not a prime.
Like the original question, your score is the largest recurring prime found by your program/ algorithm.
I copied these from the original question
You may use any language and any third-party libraries. You may use probabilistic primality tests. Everything is in base 10.
Edit: Welp... turns out I have not factored in adding zeros in this question. Although I have not thought about adding 0 at first but it indeed satisfy my requirements, since removing a digit in front of (any number of) zeros skips many digits of prime tests and returns trivially true if the last few digits is a recurring prime. To make this question less of a "zero spam" but also reward strategic use of zeros, at most 2 consecutive zeros can be present in your answer. (Sorry to Level River St who asked me this)