{"id":180,"date":"2026-05-07T17:38:32","date_gmt":"2026-05-07T17:38:32","guid":{"rendered":"https:\/\/byte64.com\/?p=180"},"modified":"2026-05-28T15:09:29","modified_gmt":"2026-05-28T15:09:29","slug":"visualizing-retrieval","status":"publish","type":"post","link":"https:\/\/byte64.com\/?p=180","title":{"rendered":"Visualizing Retrieval"},"content":{"rendered":"\n

Yesterday I created a Byte64 linkedin page<\/a>, so clearly had to create some visualizations to use as a background image. No AI slop would do. <\/p>\n\n\n\n

The first thing I tried was visualizing the PFORs the encode my search index. I don’t have a good sense of what the spacing is like between local document ids under a single keyword. I assumed they’re pretty evenly spread out.<\/p>\n\n\n\n

Here’s what that ends up looking like. Depending on the number of bits needed to encode the deltas, you’ll see more or fewer steps. The orange lines correspond to exceptions that are too big for the bits used and are inserted afterwards. They’re encoded as pairs of index (one byte) and varint value.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

I tried varying the height based on the bits used and stacking them together, but the visual wasn’t great:<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

Next, I turned to our vector embedding. I decided to use the “Albert Einstein” page as a seed and found all of it’s neighbors — pages that it links to. Next I found all connections between those neighbors by looking through links in those pages. This makes a graph of 405 pages with 4,203 directed edges. Finally, I took their embeddings, projected down to the first three coordinates, renormalized and plotted them on a sphere. Gemini was nice enough to use page rank for the. size and color of the vertices.<\/p>\n\n\n\n