Take the data . . . and separate into 32 byte chunks. Lay these chunks out horizontally and vertically. Now, set the brightness of each pixel as the similarity between the bytes at x vs. the bytes at y. The actual metric, btw, is the Levenstein string distance, with some normalization.
And here’s a resulting image:
It would work equally for napkins and placemats. (Dinner settings based on the U.S. Code).
Next: music derived from the U.S. Code. I’m expecting something along the lines of Philip Glass.