That's not how it's works. Being "infinite" is not enough, the number 1.110100100010000... is "infinite", without repeating patterns and dosen't have other digits that 1 or 0.
to be fair, though, 1 and 0 are just binary representations of values, same as decimal and hexadecimal. within your example, we'd absolutely find the entire works of shakespeare encoded in ascii, unicode, and lcd pixel format with each letter arranged in 3x5 grids.
If it's infinite without repeating patterns then it just contain all patterns, no? Eh i guess that's not how that works, is it? Half of all patterns is still infinity.
In some encoding scheme, those digits can represent something other than binary digits. If we consider your string of digits to truly be infinite, some substring somewhere will be meaningful.
“I may be a staunch atheist,” said Richard Stallman, creator of the GNU + Linux operating system and self-proclaimed architect of the modern world, “but any decent analysis in comparative religion would conclude that the universe is a copyleft creation, thereby pi should automatically fall under the terms of the GNUv3 license.”
Is there an algorithm or number such that we could basically pirate data from it by saying "start digit 9,031,643,679 with length 5,345,109 is an MP4 of Shrek"? Something that we could calculate in a day or less?
The short answer is no, and even if we could, the digit index you'd start at would have a larger binary representation than the actual data you were trying to encode.
An example I found: the string of digits 0123456789 occurs at position 17387594880. In this case, it took 11 digits to describe where to find a 10-digit number.
So I think such an algorithm would technically work, but your "start digit" would be so large it would use more data than just sending the raw file data. Not to mention the impossible amount of computing power needed.
What if instead we utilized an algorithm, some code, that would ultimately generate the file? I could imagine a program that generates a number which ultimately is more dense than the program. For example, if we just-so-happened to need a million digits of Pi the program would be shorter than the number.
Is there a way to tailor an algorithm to collapse down to any number? As an example, what if we needed a million digits of Pi but the last 10 digits need to be all 9s?
Similarly: if you write a program to randomly run through all the combinations of pixels on a decently large screen (say, 1080p) you will eventually see every important question and answer that can be expressed on a screen.
Conceptually this is basically just standard encryption: some math that spits out gibberish unless you have the info to make that gibberish become something useful.
Welp, time for quectoquectoquectoquectoquectometers.
Actually, a plank length seems to be 10 microquectometers, so my first guess might only be necessary for interpretation of the world, and not physical accuracy.