The model searches until it finds an answer, including distance and resolution
Search is performed by a DB, the query then sub-queries LLMs on a tree of embeddings
Each coordinate of an embedding vector is a pair of coordinate and LLM
Like a dynamic dictionary, in which the definition for the word is an LLM trained on the word
Indexes become shortcuts to meanings that we can choose based on case and context
Does this exist already?