Comment by infogulch

Last month a Show HN: ContextVault proposed an interesting long-term memory architecture. I discussed the design with the founder: https://news.ycombinator.com/item?id=48900288#48901679 (I think he bailed the conversation when I got too close haha.)

The basic shape is to periodically "distill the conversation into several areas (problem, solution, learnings, 'context' or original problem, plus other fields) and vectorized" (aka vector embedding), then queried against pgvector table to find related "memories". The vectorized distillates are also inserted into the pgvector table with a reference to back to the source conversation to add new memories.

Vector search requires a full scan but it's still pretty fast and I bet it's more accurate the FTS.