Random Data Quantifier

Locate any data within a (relatively) larger random data set.

To get started, enter a value to be used to seed the random data generation. Think of this like a password. Type some text into the data box and encode it!

What does it do?

Imagine an infinitely large encyclopedia set, and any message you can think of can be found within the volumes. Taking note of the first instance where you find a character of your message, you tear out the page to ensure no page is used twice. Eventually, you will collect a complete list of where each character of your complete message appears within the volumes of the encyclopedia.

How does it work?

A pseudo-random string of data will be generated based on the seed value. This value is deterministic and will always return the same value for any given seed. The algorithm will read through the message data and "random data" byte-by-byte. Each data byte is compared to the next (or first) byte within the random data set. If the data byte matches the random byte, the position within the random data is noted. A byte from the random data set, whether noted or not, is disgarded such that the next match must come from deeper within the random data. The result is an ordered list of numbers (low to high) representing the entirety of the original message as positions within the (pseudo-random) random data.