Chapter 5 of 6

The library: how Blazing Kiwi looks things up

Blazing Kiwi is too small to remember everything. It turns your question into a 256-bit key, looks the subject up in an offline library and reads the two best pages before it answers.

Click a hole on the query card, or focus the figure and use the arrow keys and Space.

Photosynthesis · agree 14 · differ 2 · key score 12 of 16

Photosynthesisagree 14 · differ 2 · key score 12note
Calvin cycleagree 12 · differ 4 · key score 8note
Chlorophyllagree 11 · differ 5 · key score 6further page
Leafagree 10 · differ 6 · key score 4further page
Marsagree 7 · differ 9 · key score -2further page
Jazzagree 5 · differ 11 · key score -6in the deck

Fig. 1 — The card sorter. A message's key is the signs of 256 numbers projected from the averaged internal state of the message, one bit each. Each of the 49,690 library entries has its own 256-bit key, made ahead of time the same way. Matching compares bit by bit: key score = agree − differ, which equals 256 − 2 × differ, so higher is better. The shipped search adds two more terms to it: a BM25 score for the word pieces an entry shares with the message, and a bonus when the entry's title appears in the message; the key score counts 32 × (agree − differ) / 256 points (version 1.1). The best two entries become notes the model reads before answering; the next three are offered as further pages. The figure ranks by the key score alone. 16 of the 256 positions are drawn: a notch open to the edge is 1, a closed hole is 0. Every number on the figure is computed from those 16 alone, so agree and differ always add to 16.

In numbers

49,690

Wikipedia summaries, offline

10.6 MB compressed and searched inside the tab.

94.1%

Right page among the two notes

Held-out questions; 97.5% when a question names the page’s title.

0.27 ms

To search the whole library

Median time in WebAssembly.

120 / 200

Library questions answered correctly

Flyingkiwi 0.6B, which has no library, answered 25.