If you would build an in-memory cache, how would you do it?
It should have good performance and be able to hold many entries.
Reads are more common than writes. I know how I would do it already,
but I’m curious about your approach.
Let's assume that keys accessed follow a power law, so some keys get
accessed very frequently and we would like them to have the fastest
retrieval of all.
Large language models have been shown to be vulnerable to adversarial
attacks, in which attackers introduce maliciously crafted token sequences
into the input prompt to circumvent the model’s safety mechanisms and
generate a harmful response [1, 14].
By the way, I like testing AIs on new games as they aren't in the training data and gpt5.6 sol high thinking was able to get from my second guess result to the correct answer. One letter was already locked and four more were down to a five letterish range. Still impressive as I remember models up until about the second generation of reasoning models really struggling with games like wordle.