How it works: Every page is a 3,200‑character string drawn from a 29‑letter alphabet
(a–z, space, comma, period). The library is finite in theory but astronomically large
(293200 pages). This implementation does not store pages; it generates them on demand
from a hexadecimal “hexagon” seed using a reversible Linear Congruential Generator (LCG).
Searching simply embeds your text into a pseudo‑random page and returns the address that
regenerates that exact page. Browse lets you jump to any address you have.